Skip to main content
Cryptography

Return to Question

Became Hot Network Question
fix \sqrt latex; make link inline just to satisfy the 6-char minimum edit size, sheesh
Source Link
edit approved Jul 24, 2022 at 22:40
Community Bot
edit approved Jul 24, 2022 at 22:40
Community Bot
  • 1

It is well known that Grover's algorithm can solve AES in $O(\sqrt(n))$$O(\sqrt{n})$ time, which is why symmetric key length needs to be double to maintain their security level in the face of a quantum adversary. A recent eprint paper (  https://eprint.iacr.org/2022/948A recent eprint paper) claims there exists a polylog time attack on AES (or searching unsorted sets in general) using a quantum computer. Can Can someone familiar with quantum computing comment on the validity of this attack?

It is well known that Grover's algorithm can solve AES in $O(\sqrt(n))$ time, which is why symmetric key length needs to be double to maintain their security level in the face of a quantum adversary. A recent eprint paper (https://eprint.iacr.org/2022/948) claims there exists a polylog time attack on AES (or searching unsorted sets in general) using a quantum computer. Can someone familiar with quantum computing comment on the validity of this attack?

It is well known that Grover's algorithm can solve AES in $O(\sqrt{n})$ time, which is why symmetric key length needs to be double to maintain their security level in the face of a quantum adversary.   A recent eprint paper claims there exists a polylog time attack on AES (or searching unsorted sets in general) using a quantum computer. Can someone familiar with quantum computing comment on the validity of this attack?

deleted 4 characters in body
Source Link
Maeher
Maeher
  • 7.1k
  • 1
  • 35
  • 45

It is well known that Grover's algorithm can solve AES in $O(\sqrt(n))$ time, which is why symmetric key length needs to be double to maintain their security level in the face of a quantum adversary. A recent eprint paper (https://eprint.iacr.org/2022/948.pdfhttps://eprint.iacr.org/2022/948) claims there exists a polylog time attack on AES (or searching unsorted sets in general) using a quantum computer. Can someone familiar with quantum computing comment on the validity of this attack?

It is well known that Grover's algorithm can solve AES in $O(\sqrt(n))$ time, which is why symmetric key length needs to be double to maintain their security level in the face of a quantum adversary. A recent eprint paper (https://eprint.iacr.org/2022/948.pdf) claims there exists a polylog time attack on AES (or searching unsorted sets in general) using a quantum computer. Can someone familiar with quantum computing comment on the validity of this attack?

It is well known that Grover's algorithm can solve AES in $O(\sqrt(n))$ time, which is why symmetric key length needs to be double to maintain their security level in the face of a quantum adversary. A recent eprint paper (https://eprint.iacr.org/2022/948) claims there exists a polylog time attack on AES (or searching unsorted sets in general) using a quantum computer. Can someone familiar with quantum computing comment on the validity of this attack?

Tweeted twitter.com/StackCrypto/status/1551220668955500546
Source Link
lamba
lamba
  • 1.4k
  • 8
  • 18

New paper claims quantum polylog time attack on AES

It is well known that Grover's algorithm can solve AES in $O(\sqrt(n))$ time, which is why symmetric key length needs to be double to maintain their security level in the face of a quantum adversary. A recent eprint paper (https://eprint.iacr.org/2022/948.pdf) claims there exists a polylog time attack on AES (or searching unsorted sets in general) using a quantum computer. Can someone familiar with quantum computing comment on the validity of this attack?