Reducing key length of the McEliece Cryptosystem

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

Volumn 5580 LNCS, Issue , 2009, Pages 77-97

  Berger, Thierry P ^a   Cayrel, Pierre Louis ^b   Gaborit, Philippe ^a   Otmani, Ayoub ^c  

^a UNIVERSITY OF LIMOGES   (France)

^b UNIVERSITÉ PARIS 8   (France)

^c UNIVERSITÉ DE CAEN   (France)

Author keywords

Alternant code; McEliece cryptosystem; Public key cryptography; Quasi cyclic

Indexed keywords

ALTERNANT CODE; ALTERNANT CODES; COMPACT REPRESENTATION; DECISION PROBLEMS; DECODING ALGORITHM; ENCRYPTION AND DECRYPTION; GENERAL METHOD; LINEAR ERROR-CORRECTING CODES; MAXIMUM DISTANCE; MCELIECE CRYPTOSYSTEM; MDS CODE; NP COMPLETE; OPTIMAL CODES; POSSIBLE SOLUTIONS; PUBLIC KEY CRYPTOSYSTEMS; PUBLIC KEYS; QUASI-CYCLIC; QUASICYCLIC CODES; REED SOLOMON; RS CODES; SYNDROME DECODING;

ARTIFICIAL INTELLIGENCE; BLOCK CODES; DECODING; PUBLIC KEY CRYPTOGRAPHY; REED-SOLOMON CODES;

COMMUNICATION CHANNELS (INFORMATION THEORY);

EID: 70350633827     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02384-2_6     Document Type: Conference Paper

References (31)

1. Baldi, M., Chiaraluce, G.F.: Cryptanalysis of a new instance of McEliece cryptosys-tem based on QC-LDPC codes. In: IEEE International Symposium on Information Theory, Nice, France, March 2007, pp. 2591-2595 (2007)
2. 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)
3. 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)
4. Biswas, B., Sendrier, N.: Mceliece cryptosystem implementation: theory and practice. In: Buchmann, J., Ding, J. (eds.) PQCrypto 2008. LNCS, vol. 5299, pp. 47-62. Springer, Heidelberg (2008)
5. Shokrollahi, A., Monico, C., Rosenthal, J.: Using low density parity check codes in the McEliece cryptosystem. In: IEEE International Symposium on Information Theory (ISIT 2000), Sorrento, Italy, p. 215 (2000)
6. Canteaut, A., Chabanne, H.: A further improvement of the work factor in an attempt at breaking McEliece's cryptosystem. In: EUROCODE 1994, pp. 169-173. INRIA (1994)
7. Canteaut, A., Chabaud, F.: Improvements of the attacks on cryptosystems based on error-correcting codes. Technical Report 95-21, INRIA (1995)
8. Canteaut, A., Chabaud, F.: A new algorithm for finding minimum-weight words in a linear code: Application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511. IEEE Transactions on Information Theory 44(1), 367-378 (1998)
9. Canteaut, A., Sendrier, N.: Cryptanalysis of the original McEliece cryptosystem. In: Ohta, K., Pei, D. (eds.) ASIACRYPT 1998. LNCS, vol. 1514, pp. 187-199. Springer, Heidelberg (1998)
10. Cayrel, P.L., Otmani, A., Vergnaud, D.: On Kabatianskii-Krouk-Smeets Signatures. In: Carlet, C., Sunar, B. (eds.) WAIFI 2007. LNCS, vol. 4547, pp. 237-251. Springer, Heidelberg (2007)
11. Engelbert, D., Overbeck, R., Schmidt, A.: A summary of McEliece-type cryptosystems and their security. Journal of Mathematical Cryptology 1, 151-199 (2007)
12. Gaborit, P.: Shorter keys for code based cryptography. In: Proceedings of the 2005 International Workshop on Coding and Cryptography (WCC 2005), Bergen, Norway, pp. 81-91 (March 2005)
13. Gaborit, P., Girault, M.: Lightweight code-based authentication and signature. In: IEEE International Symposium on Information Theory (ISIT 2007), Nice, France, March 2007, pp. 191-195 (2007)
14. Gaborit, P., Lauradoux, C., Sendrier, N.: Synd: a fast code-based stream cipher with a security reduction. In: IEEE International Symposium on Information Theory (ISIT 2007), Nice, France, March 2007, pp. 186-190 (2007)
15. Hoffstein, J., Pipher, J., Silverman, J.H.: NTRU: A ring-based public key cryptosystem. In: Buhler, J. (ed.) ANTS 1998. LNCS, vol. 1423, pp. 267-288. Springer, Heidelberg (1998)
16. Kobara, K., Imai, H.: Semantically secure mceliece public-key cryptosystems-conversions for mceliece pkc. In: Kim, K. (ed.) PKC 2001. LNCS, vol. 1992, pp. 19-35. Springer, Heidelberg (2001)
17. Lee, P.J., Brickell, E.F.: An observation on the security of mcEliece's public-key cryptosystem. In: Günther, C.G. (ed.) EUROCRYPT 1988. LNCS, vol. 330, pp. 275-280. Springer, Heidelberg (1988)
18. Leon, J.S.: A probabilistic algorithm for computing minimum weights of large error-correcting codes. IEEE Transactions on Information Theory 34(5), 1354-1359 (1988)
19. Li, Y.X., Deng, R.H., Wang, X.-M.: On the equivalence of McEliece's and Niederre-iter's public-key cryptosystems. IEEE Transactions on Information Theory 40(1), 271-273 (1994)
20. MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes, 5th edn. North-Holland, Amsterdam (1986)
21. McEliece, R.J.: A Public-Key System Based on Algebraic Coding Theory, pp. 114-116. Jet Propulsion Lab. (1978); DSN Progress Report 44
22. Minder, L., Shokrollahi, A.: Cryptanalysis of the Sidelnikov cryptosystem. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 347-360. Springer, Heidelberg (2007)
23. Niederreiter, H.: Knapsack-type cryptosystems and algebraic coding theory. Problems Control Inform. Theory 15(2), 159-166 (1986)
24. Otmani, A., Tillich, J.P., Dallot, L.: Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes (2008) (preprint)
25. 25. Sendrier, N.: On the concatenated structure of a linear code. Appl. Algebra Eng. Commun. Comput. (AAECC) 9(3), 221-242 (1998)
26. Sendrier, N.: Cryptosystèmes à clé publique basés sur les codes correcteurs d'erreurs. Ph.D thesis, Université Paris 6, France (2002)
27. Sidelnikov, V.M.: A public-key cryptosystem based on binary Reed-Muller codes. Discrete Mathematics and Applications 4(3) (1994)
28. Sidelnikov, V.M., Shestakov, S.O.: On the insecurity of cryptosystems based on generalized Reed-Solomon codes. Discrete Mathematics and Applications 1(4), 439-444 (1992)
29. Stern, J.: A method for finding codewords of small weight. In: Cohen, G.D., Wolfmann, J. (eds.) Coding Theory 1988. LNCS, vol. 388, pp. 106-113. Springer, Heidelberg (1989)
30. van Tilburg, J.: On the mceliece public-key cryptosystem. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 119-131. Springer, Heidelberg (1990)
31. Wieschebrink, C.: Two NP-complete problems in coding theory with an application in code based cryptography. In: IEEE International Symposium on Information Theory, July 2006, pp. 1733-1737 (2006)