Timeline for What does the work "An Efficient Quantum Algorithm for Lattice Problems Achieving Subexponential Approximation Factor" mean?
Current License: CC BY-SA 4.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 1, 2022 at 18:49 | answer | added | SeanH | timeline score: 11 | |
| Sep 23, 2021 at 7:49 | comment | added | Yehuda Lindell | @kelaka I agree that someone saying that they need privacy for 20 years may worry now. Personally, I doubt it will happen within 20 years but I can see the concern. In any case, meanwhile I strongly recommend using double encryption with both RSA/Lattices or ECC/Lattices. | |
| Sep 23, 2021 at 7:04 | comment | added | yyyyyyy | There is now a note by Léo Ducas & Wessel van Woerden claiming that classical LLL suffices to get pretty much the same result. | |
| Sep 22, 2021 at 23:19 | comment | added | Mark Schultz-Wu♦ | @kelalaka it really depends on the application. Some (like authentication) are mildly impacted in the near-term, with minor exceptions (perhaps OS updates or other highly security critical things). | |
| Sep 22, 2021 at 21:13 | comment | added | kelalaka | @YehudaLindell isn't it a threat if such a machine is possible? Since the eavesdropper can store the communication and break all. This is why we are using AES-256 not AES-128. | |
| Sep 22, 2021 at 15:00 | history | tweeted | twitter.com/StackCrypto/status/1440692386695286787 | ||
| Sep 22, 2021 at 11:53 | answer | added | Chris Peikert | timeline score: 31 | |
| Sep 22, 2021 at 11:09 | history | became hot network question | |||
| Sep 22, 2021 at 7:50 | answer | added | Mark Schultz-Wu♦ | timeline score: 8 | |
| Sep 22, 2021 at 7:06 | comment | added | Yehuda Lindell | @fgrieu One of the major selling points of lattice cryptography is quantum resistance. So the question is whether this new result invalidates that claim. Clearly there is no threat until a quantum computer at stage is built, if such a machine is ever built. However, the question remains as to whether lattice-based cryptography should continue to be a candidate for a post-quantum world. | |
| Sep 22, 2021 at 6:29 | comment | added | fgrieu♦ | Before this work implies the insecurity of lattice cryptography, we'll need Cryptographically Relevant Quantum Computers. [Late addition: this comments the obvious: the question's "Will ((this result) imply the insecurity of lattice cryptography?" could only be with CRQC] | |
| Sep 22, 2021 at 3:01 | history | asked | Eric_Qin | CC BY-SA 4.0 |