Grover vs. McEliece

This paper shows that quantum information-set-decoding attacks are asymptotically much faster than non-quantum information-set-decoding attacks.

[1]  Daniel J. Bernstein,et al.  Explicit bounds for generic decoding algorithms for code-based cryptography , 2009 .

[2]  Lov K. Grover.  Quantum Mechanics Helps in Searching for a Needle in a Haystack , 1997, quant-ph/9706033.

[3]  Lov K. Grover.  A fast quantum mechanical algorithm for database search , 1996, STOC '96.

[4]  Tanja Lange,et al.  Attacking and defending the McEliece cryptosystem , 2008, IACR Cryptol. ePrint Arch..

[5]  Peter W. Shor,et al.  Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..

[6]  Christof Zalka.  Fast versions of Shor's quantum factoring algorithm , 1998 .

[7]  Jacques Stern,et al.  A method for finding codewords of small weight , 1989, Coding Theory and Applications.

[8]  Gilles Brassard,et al.  Tight bounds on quantum searching , 1996, quant-ph/9605034.

[9]  今井 浩.  20世紀の名著名論：Peter Shor : Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 2004 .

[10]  Ernest F. Brickell,et al.  An Observation on the Security of McEliece's Public-Key Cryptosystem , 1988, EUROCRYPT.

[11]  Arnaldo V. Moura,et al.  LATIN'98: Theoretical Informatics , 1998, Lecture Notes in Computer Science.

[12]  Alexander Barg,et al.  A quantum decoding algorithm of the simplex code , 2004 .

[13]  Gary L. Miller,et al.  Proceedings of the twenty-eighth annual ACM symposium on Theory of computing , 1996, STOC 1996.

[14]  Niklaus Wirth,et al.  Advances in Cryptology — EUROCRYPT ’88 , 2000, Lecture Notes in Computer Science.

[15]  Robert J. McEliece,et al.  A public key cryptosystem based on algebraic coding theory , 1978 .

[16]  Peter W. Shor,et al.  Algorithms for quantum computation: discrete logarithms and factoring , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[17]  Todd A. Brun,et al.  Quantum Computing , 2011, Computer Science, The Hardware, Software and Heart of It.

[18]  Gilles Brassard,et al.  Quantum Cryptanalysis of Hash and Claw-Free Functions , 1998, LATIN.

[19]  F. MacWilliams,et al.  Codes which detect deception , 1974 .

[20]  Raphael Overbeck,et al.  Code-based cryptography , 2009 .

[21]  P. Godlewski,et al.  Coding Theory and Applications , 1986, Lecture Notes in Computer Science.

[22]  D. Bernstein.  Cost analysis of hash collisions : will quantum computers make SHARCS obsolete? , 2009 .

[23]  Gilles Brassard,et al.  Quantum cryptanalysis of hash and claw-free functions , 1997, SIGA.

[24]  Jintai Ding,et al.  Post-Quantum Cryptography, Second International Workshop, PQCrypto 2008, Cincinnati, OH, USA, October 17-19, 2008, Proceedings , 2008, PQCrypto.