McEliece and Niederreiter Cryptosystems That Resist Quantum…抵御的和.pdfVIP

McEliece and Niederreiter Cryptosystems That Resist Quantum Fourier Sampling Attacks Hang Dinh Indiana University South Bend joint work with Cristopher Moore Alexander Russell University of New Mexico University of Connecticut Post-quantum cryptography 鈥 Shor鈥檚 quantum algorithms for Factoring and Discrete Logarithm break RSA, ElGamal, elliptic curve cryptography... 鈥 Are there 鈥減ost-quantum鈥 cryptosystems? 飦 cryptosystems we can carry out with classical computers 飩 [unlike quantum cryptosystems, which require quantum facility] 飦 which will remain secure even if and when quantum computers are built. Hang Dinh - IU South Bend Post-quantum cryptography 鈥 Candidates for post-quantum cryptosystems: 飦 lattice-based 飦 code-based (the McEliece system and its relatives) 飦 hash-based 飦 multivariate 飦 secret-key cryptography 鈥 Bernstein, 2009: 飦 These systems are believed to resist quantum computers. 飦 鈥淣obody has figured out a way to apply Shor鈥檚 algorithm to any of these systems.鈥 Hang Dinh - IU South Bend We show that some McEliece and Niederreiter cryptosystems resist the natural analog of Shor鈥檚 quantum attack. Hang Dinh - IU South Bend How Shor鈥檚 algorithm works Breaking RSA Breaking ElGamal, elliptic private key curve cryptography Integer Factorization Discrete Logarithm Hidden Subgroup Problem Hidden Subgroup Problem over a cyclic group ZN over an abelian group ZN 脳ZN Quantum Fourier Sampling Quantum Four