Skip to main content

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.

7 votes
1 answer
629 views

AEGIS-256 uses a 256-bit key to produce a 128-bit authentication tag. What is its security level against Grover's algorithm? I assume Grover's algorithm quadratically reduces the keyspace so in this ...
DerekKnowles's user avatar
4 votes
1 answer
176 views

Grover's algorithm is said to reduce the strength of symmetric algorithms to basically half the number of bits in the key. I.e. AES-256 will have the strength of AES-128. What I've tried to understand ...
Joachim Strömbergson's user avatar
1 vote
0 answers
85 views

I read in the Q/A on this site: " https://crypto.stackexchange.com/questions/76738/has-aes-128-been-fully-broken" that AES-128 is resistant to PQC. This is true even when Grover's algorithm ...
Molo4's user avatar
  • 31
0 votes
1 answer
141 views

Hashcash is a mechanism to prove that the sender of a message is really intending to send that message instead of just performing a denial of service attack. It makes denial of service attacks harder ...
juhist's user avatar
  • 1,643
0 votes
0 answers
72 views

I've been reading about the security implications of quantum computing on cryptographic algorithms and came across some discussions regarding SHA-256. I understand that SHA-256 is currently considered ...
Nerses Asaturyan's user avatar
8 votes
2 answers
3k views

So Grover's algorithm, also known as the quantum search algorithm, can find an entry, with a high probability, in an unstructured database. Well can't we consider the basis of a lattice problem an ...
Steve Mucci's user avatar
2 votes
1 answer
117 views

Can you explain the mathematical details of Grover's algorithm for children?
Flan1335's user avatar
  • 381
3 votes
1 answer
328 views

I know that if using Grover's algorithm to break a cipher, one would need to perform (2^[key space])^0.5 queries (the square root of the number of all possible keys). A simple transposition cipher ...
alpominth's user avatar
  • 393
0 votes
1 answer
222 views

Grover, a quantum algorithm, weakens AES and ChaCha20. Is it possible to use multiple symmetric keys to encrypt a message multiple times to achieve 256-bit security for quantum computers?
Flan1335's user avatar
  • 381
1 vote
1 answer
505 views

I'm very new to cryptography and this may sound so foolish. Often I read quantum computers will brute force keys. Let's assume this is true (does it depend on key length? or on an algorithm? I don't ...
hajalev896's user avatar
2 votes
1 answer
412 views

I am wondering if one can apply Grover algorithm on a key encapsulation mechanism in order to crack the shared key. For example, FrodoKEM is a key generation protocol that, for some parameters, shares ...
C.S.'s user avatar
  • 525
0 votes
2 answers
276 views

Hello, I was wondering whether it is theoretically possible to use Grover alrogithm to break AES in CBC mode. Assume that I have ~1000 plaintext/ciphertext pairs and key length is 128 bits. I thought ...
pajacol's user avatar
  • 15
0 votes
0 answers
176 views

As far as I know, quantum computers are able to solve only some of the NP-Problems in polynomial time, using the Grovers algorithm. I read that if one manages to create a reduction of Grovers ...
namaewa's user avatar
  • 59
26 votes
7 answers
7k views

According to this Bloomberg article: A Swiss Company Says It Found Weakness That Imperils Encryption Terra Quantum AG has a team of about 80 quantum physicists, cryptographers and mathematicians, who ...
kelalaka's user avatar
  • 50k
1 vote
1 answer
301 views

I understand that asymmetric encryption is fundamentally deemed useless under Shor's Algorithm, and understand that symmetric encryption is somewhat quantum-resistant as long as the key-length is ...
CyberCrusader's user avatar

15 30 50 per page