Timeline for Does Grover's algorithm really threaten symmetric security proofs?
Current License: CC BY-SA 4.0
19 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 19, 2023 at 13:10 | answer | added | James_pic | timeline score: 3 | |
| Oct 18, 2023 at 23:44 | history | edited | Victor Espinoza | CC BY-SA 4.0 |
Change of title to specify the question.
|
| Oct 18, 2023 at 23:37 | history | edited | Victor Espinoza | CC BY-SA 4.0 |
Well, my question is about this conflict with the limits of information theory and security proofs. I know they are related, but in no post do they answer how quantum computers affect the assumption of infinite computation and what a quantum query is.
|
| S Oct 18, 2023 at 23:20 | history | suggested | Peter Mortensen | CC BY-SA 4.0 |
Copy edited (e.g. ref. <https://en.wikipedia.org/wiki/Brute-force_attack> and <https://en.wiktionary.org/wiki/truly#Adverb>). Jeopardy compliance.
|
| Oct 18, 2023 at 21:30 | review | Suggested edits | |||
| S Oct 18, 2023 at 23:20 | |||||
| Oct 18, 2023 at 16:23 | comment | added | Glenn Willen | Grover's Algorithm has a very simple explanation: If you could do some brute-force search with N queries to some oracle, now you can instead do it with sqrt(N) queries. This breaks (quantitatively, not totally) a lot of things, and it should be straightforward to analyze what it breaks or not. E.g. it would not break a true one-time pad, which is information-theoretically (not merely computationally) secure. | |
| Oct 18, 2023 at 1:29 | answer | added | Jon Callas | timeline score: 10 | |
| Oct 17, 2023 at 16:51 | answer | added | kelalaka | timeline score: 12 | |
| Oct 17, 2023 at 14:22 | answer | added | Oscar Smith | timeline score: 15 | |
| Oct 17, 2023 at 7:58 | comment | added | kelalaka | Note that for RSA, ECC-like scheme the Shor's period doesn't need any (plaintext,ciphertext) pair. | |
| Oct 17, 2023 at 6:39 | history | became hot network question | |||
| Oct 17, 2023 at 6:20 | review | Close votes | |||
| Oct 26, 2023 at 3:07 | |||||
| Oct 17, 2023 at 6:04 | comment | added | kelalaka | Does this answer your question? Is AES-256 a post-quantum secure cipher or not? and Could quantum computers "break" symmetric crypto-systems (e.g. AES)? – and Is AES-128 quantum safe? | |
| Oct 17, 2023 at 4:16 | vote | accept | Victor Espinoza | ||
| Oct 17, 2023 at 0:42 | answer | added | Hhan | timeline score: 13 | |
| Oct 16, 2023 at 23:22 | history | edited | user93353 | CC BY-SA 4.0 |
He really doesn't groove much!
|
| Oct 16, 2023 at 22:58 | history | edited | Victor Espinoza | CC BY-SA 4.0 |
minor typos
|
| S Oct 16, 2023 at 22:38 | review | First questions | |||
| Oct 17, 2023 at 1:03 | |||||
| S Oct 16, 2023 at 22:38 | history | asked | Victor Espinoza | CC BY-SA 4.0 |