Key reduction of McEliece's cryptosystem using list decoding

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2011, Pages 2681-2685

  Barbier, Morgan ^a   Barreto, Paulo S L M ^b  

^a INRIA SACLAY   (France)

^b UNIVERSITY OF SÃO PAULO   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

GOPPA CODES; KEY-REDUCTION; LIST DECODING; MCELIECE; MCELIECE CRYPTOSYSTEM; NEW STUDY; PUBLIC KEYS; SECURITY LEVEL; STRUCTURED CODES;

ALGORITHMS; CRYPTOGRAPHY; INFORMATION THEORY;

DECODING;

EID: 80054803850     PISSN: 21578104     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2011.6034058     Document Type: Conference Paper

References (33)

1. C. Aguilar Melchor, P.-L. Cayrel, and P. Gaborit, "A new efficient threshold ring signature scheme based on coding theory", in Post-Quantum Cryptography, ser. Lecture Notes in Computer Science, J. Buchmann and J. Ding, Eds. Springer Berlin/Heidelberg, 2008, vol. 5299, pp. 1-16.
2. M. Alekhnovich, "Linear diophantine equations over polynomials and soft decoding of Reed-Solomon codes", Information Theory, IEEE Transactions on, vol. 51, no. 7, pp. 2257-2265, July 2005.
3. D. Augot, M. Barbier, and A. Couvreur, "List-decoding of binary Goppa codes up to the binary Johnson bound", INRIA Saclay, Tech. Rep., 2010. [Online]. Available: http://hal.archives-ouvertes.fr/inria-00547106/en/
4. E. Barker, W. Barker, W. Burr, W. Polk, and M. Smid, "Recommendation for key management - part 1: General (revised)", NIST Special Publication 800-57, no. 1/3, pp. 1-142, 2007. [Online]. Available: http://csrc.nist.gov/ publications/nistpubs/800-57/sp800-57-Part1-revised2-Mar08-2007.pdf
5. P. Beelen and K. Brander, "Efficient list decoding of a class of algebraicgeometry codes", Advances in Mathematics of Communication, vol. 4, no. 4, pp. 485-518, 2010.
6. -, "Key equations for list decoding of Reed-Solomon codes and how to solve them", J. Symb. Comput., vol. 45, pp. 773-786, July 2010. [Online]. Available: http://dx.doi.org/10.1016/j.jsc.2010.03.010
7. T. Berger, P.-L. Cayrel, P. Gaborit, and A. Otmani, "Reducing key length of the McEliece cryptosystem", in Progress in Cryptology - AFRICACRYPT 2009, ser. Lecture Notes in Computer Science, B. Preneel, Ed. Springer Berlin/Heidelberg, 2009, vol. 5580, pp. 77-97.
8. T. P. Berger and P. Loidreau, "How to mask the structure of codes for a cryptographic use", Designs, Codes and Cryptography, vol. 35, pp. 63-79, 2005.
9. E. Berlekamp, R. McEliece, and H. Van Tilborg, "On the inherent intractability of certain coding problems", Information Theory, IEEE Transactions on, vol. 24, no. 3, pp. 384-386, May 1978.
10. E. Berlekamp, Algebraic coding theory, 2nd ed. Aegean Park Press, 1984.
11. D. Bernstein, "List decoding for binary Goppa codes", 2008, http://cr. yp. to/codes/goppalist-20081107.pdf.
12. -, "Simplified high-speed high-distance list decoding for alternant codes", March 2011, http://cr.yp. to/codes/simplelist-20110320.pdf.
13. D. Bernstein, J. Buchmann, and E. Dahmen, Eds., Post-Quantum cryptography. Springer Berlin/Heidelberg, 2009.
14. D. Bernstein, T. Lange, and C. Peters, "Attacking and defending the McEliece cryptosystem", in Post-Quantum Cryptography, ser. Lecture Notes in Computer Science, J. Buchmann and J. Ding, Eds. Springer Berlin/Heidelberg, 2008, vol. 5299, pp. 31-46.
15. -, "Explicit bounds for generic decoding algorithms for code-based cryptography", WCC 2009, pp. 168-180, May 2009.
16. -, "Smaller decoding exponents: ball-collision decoding", Cryptology ePrint Archive, Report 2010/585, 2010, http://eprint.iacr.org/.
17. -, "Wild McEliece", Cryptology ePrint Archive, Report 2010/410, 2010, accepted at SAC 2010.
18. D. Engelbert, R. Overbeck, and A. Schmidt, "A summary of McEliecetype cryptosystems and their security", Cryptology ePrint Archive, Report 2006/162, 2006.
19. J.-C. Faugère, A. Otmani, L. Perret, and J.-P. Tillich, "Algebraic cryptanalysis of McEliece variants with compact keys", in Advances in Cryptology - EUROCRYPT 2010, ser. Lecture Notes in Computer Science, H. Gilbert, Ed. Springer Berlin/Heidelberg, 2010, vol. 6110, pp. 279-298.
20. M. Finiasz and N. Sendrier, "Security bounds for the design of codebased cryptosystems", in Advances in Cryptology - ASIACRYPT 2009, ser. Lecture Notes in Computer Science, M. Matsui, Ed. Springer Berlin/Heidelberg, 2009, vol. 5912, pp. 88-105.
21. V. Guruswami and M. Sudan, "Improved decoding of Reed-Solomon and algebraic-geometry codes", Information Theory, IEEE transactions on, vol. 45, no. 6, pp. 1757-1767, 1999.
22. Y. X. Li, R. Deng, and X. M. Wang, "On the equivalence of McEliece's and Niederreiter's public-key cryptosystems", Information Theory, IEEE Transactions on, vol. 40, no. 1, pp. 271-273, Jan. 1994.
23. F. J. MacWilliams and N. J. A. Sloane, The theory of error-correcting codes. II. Amsterdam: North-Holland Publishing Co., 1977, north-Holland Mathematical Library, Vol. 16.
24. R. McEliece, "A public-key cryptosystem based on algebraic coding theory", Deep Space Network Progress Report, vol. 44, pp. 114-116, 1978.
25. R. Misoczki and P. S. L. M. Barreto, "Compact McEliece keys from Goppa codes", in Selected Areas in Cryptography - SAC 2009, ser. Lecture Notes in Computer Science, vol. 5867. Springer, 2009, pp. 276-392, updated version: http://eprint.iacr.org/2009/187.
26. H. Niederreiter, "Knapsack-type cryptosystems and algebraic coding theory", Problems of Control and Information Theory, pp. 15(2):159-166, 1986.
27. H. Orman and P. Hoffman, Determining Strengths For Public Keys Used For Exchanging Symmetric Keys, Purple Streak Development and VPN Consortium, april 2004.
28. A. Otmani, J.-P. Tillich, and L. Dallot, "Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes", Mathematics in Computer Science, vol. 3, pp. 129-140, 2010.
29. R. Overbeck and N. Sendrier, "Code-based cryptography", in Post-Quantum Cryptography, D. Bernstein, J. Buchmann, and E. Dahmen, Eds. Springer Berlin/Heidelberg, 2009, pp. 95-145.
30. N. Patterson, "The algebraic decoding of Goppa codes", Information Theory, IEEE Transactions on, vol. 21, no. 2, pp. 203-207, Mar. 1975.
31. D. Pointcheval, "Chosen-ciphertext security for any one-way cryptosystem", in Public Key Cryptography, ser. Lecture Notes in Computer Science, H. Imai and Y. Zheng, Eds. Springer Berlin/Heidelberg, 2000, vol. 1751, pp. 129-146.
32. J. Stern, "A method for finding codewords of small weight", in Coding Theory and Applications, ser. Lecture Notes in Computer Science, G. Cohen and J. Wolfmann, Eds. Springer Berlin/Heidelberg, 1989, vol. 388, pp. 106-113.
33. E. Verheul, J. Doumen, and H. Van Tilborg, "Sloppy Alice attacks! Adaptive chosen ciphertext attacks on the McEliece public-key cryptosystem", in Information, coding and mathematics: proceedings of workshop honoring prof. Bob McEliece on his 60th birthday/ed. by Mario Blaum. Boston: Kluwer Academic Publishers, 2002, pp. 99-119.