Cryptanalysis of two McEliece cryptosystems based on Quasi-Cyclic codes

Mathematics in Computer Science

Volumn 3, Issue 2, 2010, Pages 129-140

  Otmani, Ayoub ^a   Tillich, Jean Pierre ^b   Dallot, Léonard ^a  

^a UNIVERSITÉ DE CAEN   (France)

^b INRIA   (France)

Author keywords

BCH codes; Cryptanalysis; LDPC codes; McEliece cryptosystem; Quasi cyclic codes

Indexed keywords

EID: 77952289695     PISSN: 16618270     EISSN: 16618289     Source Type: Journal    
DOI: 10.1007/s11786-009-0015-8     Document Type: Article

References (27)

1. Baldi, M., Chiaraluce, G. F.: Cryptanalysis of a new instance of McEliece cryptosystem based on QC-LDPC codes. In: IEEE International Symposium on Information Theory, pp. 2591-2595, Nice, France, March 2007.
2. Berger T. P., Loidreau P.: How to mask the structure of codes for a cryptographic use. Des. Codes Cryptography 35(1), 63-79 (2005).
3. Berlekamp E. R., McEliece R. J., van Tilborg H. C. A.: On the intractability of certain coding problems. IEEE Trans. Inf. Theory 24(3), 384-386 (1978).
4. Berstein, D. J., Lange, T., Peters, C.: Attacking and defending the McEliece cryptosystem. PQCrypto, pp. 31-46 (2008).
5. Bosma W., Cannon J. J., Playoust C.: The Magma algebra system I: the user language. J. Symb. Comput. 24(3/4), 235-265 (1997).
6. Canteaut, A., Chabanne, H.: A further improvement of the work factor in an attempt at breaking McEliece's cryptosystem. In: EUROCODE 94, 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 Trans. Inf. Theory 44(1), 367-378 (1998).
9. Cayrel, P. L., Otmani, A., Vergnaud, D.: On Kabatianskii-Krouk-Smeets signatures. In: Proceedings of the First International Workshop on the Arithmetic of Finite Fields (WAIFI 2007). Springer Verlag Lecture Notes, pp. 237-251, Madrid, Spain, 21-22 June 2007.
10. Engelbert D., Overbeck R., Schmidt A.: A summary of McEliece-type cryptosystems and their security. J. Math. Cryptol. 1, 151-199 (2007).
11. Gabidulin, E. M.: Public-Key Cryptosystems Based on Linear Codes. 1995.
12. Gaborit, P.: Shorter keys for code based cryptography. In: Proceedings of the 2005 International Workshop on Coding and Cryptography (WCC 2005), pp. 81-91, Bergen, Norway, March 2005.
13. Gaborit, P., Girault, M.: Lightweight code-based authentication and signature. In: IEEE International Symposium on Information Theory (ISIT 2007), pp. 191-195, Nice, France, March 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), pp. 186-190, Nice, France, March 2007.
15. Lee, P. J., Brickell, E. F.: An observation on the security of McEliece's public-key cryptosystem. In: Advances in Cryptology-EUROCRYPT'88, volume 330/1988 of Lecture Notes in Computer Science, pp. 275-280. Springer, New York (1988).
16. Leon J. S.: A probabilistic algorithm for computing minimum weights of large error-correcting codes. IEEE Trans. Inf. Theory 34(5), 1354-1359 (1988).
17. Li Y. X., Deng R. H., Wang X.-M.: On the equivalence of McEliece's and Niederreiter's public-key cryptosystems. IEEE Trans. Inf. Theory 40(1), 271-273 (1994).
18. McEliece, R. J.: A Public-Key System Based on Algebraic Coding Theory, pp. 114-116. DSN Progress Report 44. Jet Propulsion Lab (1978).
19. Minder, L., Shokrollahi, A.: Cryptanalysis of the Sidelnikov cryptosystem. In: Eurocrypt 2007, Lecture Notes in Computer Science, vol. 4515, pp. 347-360, Barcelona, Spain (2007).
20. Niederreiter H.: Knapsack-type cryptosystems and algebraic coding theory. Probl. Control Inf. Theory 15(2), 159-166 (1986).
21. Pless, V. S., Huffman, W. C. (eds.): Handbook of Coding Theory. North Holland (1998).
22. Sendrier N.: On the concatenated structure of a linear code. AAECC 9(3), 221-242 (1998).
23. 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), p. 215, Sorrento, Italy (2000).
24. Sidelnikov V. M.: A public-key cryptosystem based on binary Reed-Muller codes. Discrete Math. Appl. 4(3), 191-207 (1994).
25. Sidelnikov V. M., Shestakov S. O.: On the insecurity of cryptosystems based on generalized Reed-Solomon codes. Discrete Math. Appl. 1(4), 439-444 (1992).
26. Stern, J.: A method for finding codewords of small weight. In: Cohen, G. D., Wolfmann, J. (eds.) Coding Theory and Applications, volume 388 of Lecture Notes in Computer Science, pp. 106-113. Springer, New York (1988).
27. Wieschebrink, C.: An Attack on a Modified Niederreiter Encryption Scheme. Public Key Cryptography-PKC 2006, Lecture Notes in Computer Science, vol. 3958/2006, pp. 14-26. Springer, New York (2006).