Questions tagged [grovers-algorithm]

Grover's algorithm is an algorithm for quantum based computing that can halve the strength of security of a symmetric cipher, given a quantum computer with enough stable interconnected qubits to implement the attack.

Filter by
Sorted by
Tagged with
1
vote
1answer
130 views

How likely is it that AES-256 is crackable within 100 years (2120)?

When people ask for a block-cipher with a larger key space than AES-256 replies usually just state that there is no need. I see where that is coming from the future is hard to predict. The two main ...
0
votes
1answer
101 views

Using SHA384 as an asymmetric cipher?

SHA384 is a hash function that can be (and is) used to verify data by checking it. Can it also be used as the background for a public-key crypto system? Here is what I mean: A 48-byte string is ...
2
votes
2answers
854 views

Attacking AES-128 with Grover's algorithm

How many plain text / cipher text pairs are required by Grover's algorithm when it is used to try and discover a secret AES key? I am trying to determine if having a device which limits the speed at ...
1
vote
1answer
311 views

Real world performance of (still theoretical) Grover's Algorithm

Grover's Algorithm is a quantum algorithm for searching "black box" functions and could be used to reduce the search space for things like symmetric ciphers and hashes by as much as half (quadratic ...
6
votes
2answers
423 views

Can Grover's Algorithm be combined with a meet-in-the-middle attack?

We all know and love the meet-in-the-middle attack, which basically makes double encryption pointless using a time-memory trade-off. Now, the NSA recently recommended to use double encryption to ...
15
votes
2answers
717 views

Can Grover's algorithm be parallelized?

Using a quantum computer, Grover's algorithm can search an unordered list of length $N$ in time $\sqrt{N}$. Applied to cryptography this means that it can recover $n$ bit keys and find preimages for $...
5
votes
1answer
449 views

Does Grover's algorithm effect block size or only key size?

We know that Grover's algorithm can speed up cracking symmetric keys. Basically the keyspace is halved. This means we have to use at least a 256-bit key (to get 128-bit security). I heard somewhere ...