Compact McEliece keys from goppa codes

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

Volumn 5867 LNCS, Issue , 2009, Pages 376-392

  Misoczki, Rafael ^a   Barreto, Paulo S L M ^a  

^a UNIVERSITY OF SÃO PAULO   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHIC OPERATIONS; CRYPTOSYSTEMS; GOPPA CODES; KEY SIZES; MCELIECE; MCELIECE CRYPTOSYSTEM; PUBLIC KEYS;

COST REDUCTION; ERROR CORRECTION; KEYS (FOR LOCKS);

CRYPTOGRAPHY;

EID: 70549109066     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-05445-7_24     Document Type: Conference Paper

References (29)

1. Baldi, M., Chiaraluce, F.: Cryptanalysis of a new instance of McEliece cryptosys-tem based on QC-LDPC code. In: IEEE International Symposium on Information Theory - ISIT 2007, Nice, France, pp. 2591-2595. IEEE, Los Alamitos (2007)
2. Baldi, M., Chiaraluce, F., Bodrato, M.: A new analysis of the mcEliece cryptosys-tem based on QC-LDPC codes. In: Ostrovsky, R., De Prisco, R., Visconti, I. (eds.) SCN 2008. LNCS, vol. 5229, pp. 246-262. Springer, Heidelberg (2008)
3. Berger, T.P., Cayrel, P.-L., Gaborit, P., Otmani, A.: Reducing key length of the McEliece cryptosystem. In: Preneel, B. (ed.) AFRICACRYPT 2009. LNCS, vol. 5580, pp. 77-97. Springer, Heidelberg (2009), http://www.unilim.fr/pages- perso/philippe.gaborit/reducing.pdf
4. Berlekamp, E., McEliece, R., van Tilborg, H.: On the inherent intractability of certain coding problems. IEEE Transactions on Information Theory 24(3), 384-386 (1978)
5. Bernstein, D.J.: List decoding for binary Goppa codes (2008) (preprint), http://cr.yp.to/papers.html#goppalist
6. Bernstein, D.J., Buchmann, J., Dahmen, E.: Post-Quantum Cryptography. Springer, Heidelberg (2008)
7. Bernstein, D.J., Lange, T., Peters, C.: Attacking and defending the mcEliece cryp-tosystem. In: Buchmann, J., Ding, J. (eds.) PQCrypto 2008. LNCS, vol. 5299, pp. 31-46. Springer, Heidelberg (2008), http://www.springerlink.com/ content/68v69185x478p53g
8. Gaborit, P.: Shorter keys for code based cryptography. In: International Workshop on Coding and Cryptography - WCC 2005, Bergen, Norway, pp. 81-91. ACM Press, New York (2005)
9. Gaborit, P., Girault, M.: Lightweight code-based authentication and signature. In: IEEE International Symposium on Information Theory - ISIT 2007, Nice, France, pp. 191-195. IEEE, Los Alamitos (2007)
10. Gibson, J.K.: Severely denting the Gabidulin version of the McEliece public key cryptosystem. Designs, Codes and Cryptography 6(1), 37-45 (1995)
11. Gibson, J.K.: The security of the Gabidulin public key cryptosystem. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 212-223. Springer, Heidelberg (1996)
12. Gulamhusein, M.N.: Simple matrix-theory proof of the discrete dyadic convolution theorem. Electronics Letters 9(10), 238-239 (1973)
13. IEEE P1363 Working Group. IEEE 1363-1: Standard Specifications for Public-Key Cryptographic Techniques Based on Hard Problems over Lattices, Draft (2009), http://grouper.ieee.org/groups/1363/lattPK/index.html
14. Loidreau, P., Sendrier, N.: Some weak keys in McEliece public-key cryptosystem. In: IEEE International Symposium on Information Theory - ISIT 1998, Boston, USA, p. 382. IEEE, Los Alamitos (1998)
15. MacWilliams, F.J., Sloane, N.J.A.: The theory of error-correcting codes. North-Holland Mathematical Library, vol. 16 (1977)
16. McEliece, R.: A public-key cryptosystem based on algebraic coding theory. The Deep Space Network Progress Report, DSN PR 42-44 (1978), http://ipnpr.jpl.nasa.gov/progressreport2/42-44/44N.PDF
17. Micciancio, D.: Generalized compact knapsacks, cyclic lattices, and efficient oneway functions. Computational Complexity 16(4), 365-411 (2007)
18. Monico, C., Rosenthal, J., Shokrollahi, A.: Using low density parity check codes in the McEliece cryptosystem. In: IEEE International Symposium on Information Theory - ISIT 2000, Sorrento, Italy, p. 215. IEEE, Los Alamitos (2000)
19. Niederreiter, H.: Knapsack-type cryptosystems and algebraic coding theory. Problems of Control and Information Theory 15(2), 159-166 (1986)
20. European Network of Excellence in Cryptology (ECRYPT). ECRYPT yearly report on algorithms and keysizes (2007-2008). D.SPA.28 Rev. 1.1, IST-2002-507932 ECRYPT, 07/2008 (2008), http://www.ecrypt.eu.org/ecrypt1/ documents/D.SPA.28-1.1.pdf
21. National Institute of Standards and Technology (NIST). Recommendation for key management - part 1: General (2007), http://csrc.nist.gov/publications/ nistpubs/800-57/sp800-57-Part1-revised2-Mar08-2007.pdf
22. Otmani, A., Tillich, J.-P., Dallot, L.: Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes (2008) (preprint), http://arxiv.org/abs/0804.0409v2
23. Patterson, N.J.: The algebraic decoding of Goppa codes. IEEE Transactions on Information Theory 21(2), 203-207 (1975)
24. Sarwate, D.V.: On the complexity of decoding Goppa codes. IEEE Transactions on Information Theory 23(4), 515-516 (1977)
25. Schechter, S.: On the inversion of certain matrices. Mathematical Tables and Other Aids to Computation 13(66), 73-77 (1959), http://www.jstor.org/stable/ 2001955
26. Sendrier, N.: Finding the permutation between equivalent linear codes: the support splitting algorithm. IEEE Transactions on Information Theory 46(4), 1193-1203 (2000)
27. Sidelnikov, V., Shestakov, S.: On cryptosystems based on generalized Reed-Solomon codes. Discrete Mathematics 4(3), 57-63 (1992)
28. Tzeng, K.K., Zimmermann, K.: On extending Goppa codes to cyclic codes. IEEE Transactions on Information Theory 21, 721-726 (1975)
29. Wieschebrink, C.: Two NP-complete problems in coding theory with an application in code based cryptography. In: IEEE International Symposium on Information Theory - ISIT 2006, Seattle, USA, pp. 1733-1737. IEEE, Los Alamitos (2006)