Shtetl-Optimized » Blog Archive » That IACR pre

Update (April 19): Apparently a bug has been found, and the author has withdrawn the claim (see the comments). For those who don't yet know from their other social media: a week ago the cryptographer Yilei Chen posted a preprint, eprint.iacr.org/2024/555, claiming to give a polynomial-time quantum algorithm to solve lattice problems. For example, it…

Related Keywords

Texas , United States , Scott Aaronson , Thomas Vidick , Lior Eldar , Eldar Shor , Izzy Grosof , Connor Tabarrok , Len Adleman , Omri Shmueli , Hans Heum , Yilei Chen , Oded Regev , Mark Spinelli , Dan Simon , Hongxun Wu , Youtube , Committee Of Guardians , Fully Homomorphic Encryption , Spinelli Says , Graph Isomorphism , Oracle Says , Grosof Says , Feeney Says , Bounded Distance , Physicist Says , Kuperberg Says , Heum Says , Simon Says , Reeves Says , Bierhorst Says , Complex Gaussian , Zelinsky Says , Was Not Uncovered After All , Nea Says , Shtetl Optimized , Shtetl Optimized Committee ,