all InfoSec news
Quantum Algorithms for Lattice Problems
April 10, 2024, 3:54 p.m. |
IACR News www.iacr.org
ePrint Report: Quantum Algorithms for Lattice Problems
Yilei Chen
We show a polynomial time quantum algorithm for solving the learning with errors problem (LWE) with certain polynomial modulus-noise ratios. Combining with the reductions from lattice problems to LWE shown by Regev [J.ACM 2009], we obtain polynomial time quantum algorithms for solving the decisional shortest vector problem (GapSVP) and the shortest independent vector problem (SIVP) for all $n$-dimensional lattices within approximation factors of $\tilde{\Omega}(n^{4.5})$. Previously, no polynomial or even subexponential time …
acm algorithm algorithms chen eprint report errors noise problem problems quantum quantum algorithms report
More from www.iacr.org / IACR News
$\mathsf{FRAST}$: TFHE-friendly Cipher Based on Random S-boxes
2 days, 16 hours ago |
www.iacr.org
A Deniability Analysis of Signal's Initial Handshake PQXDH
2 days, 16 hours ago |
www.iacr.org
BGJ15 Revisited: Sieving with Streamed Memory Access
2 days, 16 hours ago |
www.iacr.org
Quantum Key-Revocable Dual-Regev Encryption, Revisited
2 days, 16 hours ago |
www.iacr.org
Jobs in InfoSec / Cybersecurity
Information Security Engineers
@ D. E. Shaw Research | New York City
Technology Security Analyst
@ Halton Region | Oakville, Ontario, Canada
Senior Cyber Security Analyst
@ Valley Water | San Jose, CA
COMM Penetration Tester (PenTest-2), Chantilly, VA OS&CI Job #368
@ Allen Integrated Solutions | Chantilly, Virginia, United States
Consultant Sécurité SI H/F Gouvernance - Risques - Conformité
@ Hifield | Sèvres, France
Infrastructure Consultant
@ Telefonica Tech | Belfast, United Kingdom