McEliece and Niederreiter cryptosystems that resist quantum Fourier sampling attacks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6841 LNCS, Issue , 2011, Pages 761-779

  Dinh, Hang ^a   Moore, Cristopher ^b,c   Russell, Alexander ^d  

^a INDIANA UNIVERSITY SOUTH BEND   (United States)

^b UNIVERSITY OF NEW MEXICO   (United States)

^c SANTA FE INSTITUTE   (United States)

^d UNIVERSITY OF CONNECTICUT   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); FOURIER TRANSFORMS; GRAPH ALGORITHMS; PUBLIC KEY CRYPTOGRAPHY; QUANTUM COMPUTERS; QUANTUM THEORY;

AUTOMORPHISM GROUPS; CLASSICAL GOPPA CODES; HIDDEN SUBGROUP PROBLEM; MCELIECE CRYPTOSYSTEM; NIEDERREITER CRYPTOSYSTEM; POST QUANTUM CRYPTOGRAPHY; PUBLIC KEY CRYPTOSYSTEMS; QUANTUM FOURIER SAMPLINGS;

QUANTUM CRYPTOGRAPHY;

EID: 80052020068     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-22792-9_43     Document Type: Conference Paper

References (26)

1. Bernstein, D.J., Lange, T., Peters, C.: Attacking and defending the mcEliece cryptosystem. In: Buchmann, J., Ding, J. (eds.) PQCrypto 2008. LNCS, vol. 5299, pp. 31-46. Springer, Heidelberg (2008)
2. Courtois, N., Finiasz, M., Sendrier, N.: How to achieve a mcEliece-based digital signature scheme. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 157-174. Springer, Heidelberg (2001)
3. Dinh, H., Moore, C., Russell, A.: The McEliece cryptosystem resists quantum Fourier sampling attacks, preprint (2010), http://arxiv.org/abs/1008. 2390
4. Engelbert, D., Overbeck, R., Schmidt, A.: A summary of McEliece-type cryptosystems and their security. J. Math. Crypt. 1, 151-199 (2007)
5. Fulton, W., Harris, J.: Representation Theory - A First Course. Springer-Verlag, New York Inc., Heidelberg (1991)
6. Grigni,M., Schulman, J., Vazirani,M., Vazirani, U.: Quantum mechanical algorithms for the nonabelian hidden subgroup problem. Combinatorica 24(1), 137-154 (2004)
7. Hallgren, S., Moore, C., Rötteler, M., Russell, A., Sen, P.: Limitations of quantum coset states for graph isomorphism. In: STOC 2006: Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing, pp. 604-617 (2006)
8. Kempe, J., Shalev, A.: The hidden subgroup problem and permutation group theory. In: SODA 2005: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1118-1125 (2005)
9. Kempe, J., Pyber, L., Shalev, A.: Permutation groups, minimal degrees and quantum computing. Groups, Geometry, and Dynamics 1(4), 553-584 (2007), http://xxx.lanl.gov/abs/quant-ph/0607204
10. Li,Y.X., Deng, R.H.,Wang, X.M.:On the equivalence ofMcElieces and Niederreiters publickey cryptosystems. IEEE Transactions on Information Theory 40(1), 271-273 (1994)
11. Loidreau, P., Sendrier, N.:Weak keys in the McEliece public-key cryptosystem. IEEE Transactions on Information Theory 47(3), 1207-1212 (2001)
12. Lomont, C.: The hidden subgroup problem - review and open problems (2004), http://arXiv.org:quantph/0411037
13. McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. JPL DSN Progress Report, 114-116 (1978)
14. Menezes, A.J., van Oorschot, P.C., Vanstone, S.A.: Handbook of applied cryptography. CRC Press, Boca Raton (1996)
15. Moore, C., Russell, A., Schulman, L.J.: The symmetric group defies strong quantum Fourier sampling. SIAM Journal of Computing 37, 1842-1864 (2008)
16. Niederreiter, H.: Knapsack-type cryptosystems and algebraic coding theory. Problems of Control and Information Theory. Problemy Upravlenija i Teorii Informacii 15(2), 159-166 (1986)
17. Petrank, E., Roth, R.M.: Is code equivalence easy to decide? IEEE Transactions on Information Theory 43(5), 1602-1604 (1997), doi:10.1109/18. 623157
18. Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: STOC 2005: Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing, pp. 84-93 (2005)
19. Roichman, Y.: Upper bound on the characters of the symmetric groups. Invent. Math. 125(3), 451-485 (1996)
20. Ryan, J.A.: Excluding some weak keys in the McEliece cryptosystem. In: Proceedings of the 8th IEEE Africon, pp. 1-5 (2007)
21. Sendrier, N.: Finding the permutation between equivalent linear codes: the support splitting algorithm. IEEE Transactions on Information Theory 46(4), 1193-1203 (2000)
22. Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing 26, 1484-1509 (1997)
23. Sidelnikov, V.M., Shestakov, S.O.: On insecurity of cryptosystems based on generalized Reed-Solomon codes. Discrete Mathematics and Applications 2(4), 439-444 (1992)
24. Simon, D.R.: On the power of quantum computation. SIAM J. Comput. 26(5), 1474-1483 (1997)
25. Stichtenoth, H.: On automorphisms of geometric Goppa codes. Journal of Algebra 130, 113-121 (1990)
26. van Lint, J.H.: Introduction to coding theory, 2nd edn. Springer, Heidelberg (1992)