Timeline for Grover algorithm for public key cryptography - FrodoKEM
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 12, 2021 at 19:28 | history | became hot network question | |||
| Nov 12, 2021 at 16:44 | history | edited | kelalaka | CC BY-SA 4.0 |
edited title
|
| Nov 12, 2021 at 14:46 | comment | added | kelalaka | A simple Grover time analysis is here and the parallel Grover machine inefficiency is here | |
| Nov 12, 2021 at 13:27 | answer | added | poncho | timeline score: 6 | |
| Nov 12, 2021 at 12:51 | comment | added | kelalaka | Of course it is not clear that how one can run the $\sqrt{2^n}$ Grover Oracles calls in the real life. What is the cost of ( timexmoney ) of preparing the next Oracle... | |
| Nov 12, 2021 at 12:40 | comment | added | C.S. | Thank you @kelalaka. What about breaking FrodoKEM it self? Is it possible with Grover's algorithm? | |
| Nov 12, 2021 at 12:29 | comment | added | kelalaka | Are you asking using Grover's Against FrodoKem or Against the symmetric key encryption that FrodoKem produced? What symmetric encryption is under usage after FrodoKem? Consider it like RSA-KEM ( Key Encapsulation Mechanism) + AES-GCM (Data Encapsulation Mechanism (DEM)). Grover will beat AES-128 in a near future but not AES-256. | |
| Nov 12, 2021 at 11:25 | history | asked | C.S. | CC BY-SA 4.0 |