Information-set decoding for linear codes over Fq

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

Volumn 6061 LNCS, Issue , 2010, Pages 81-94

  Peters, Christiane ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Generalized McEliece cryptosystem; information set decoding; linear codes over Fq; security analysis; Stern attack

Indexed keywords

GENERALIZED MCELIECE CRYPTOSYSTEM; LINEAR CODES; MCELIECE CRYPTOSYSTEM; SECURITY ANALYSIS; STERN ATTACK;

ALGORITHMS; QUANTUM CRYPTOGRAPHY; SECURITY SYSTEMS;

DECODING;

EID: 77954391096     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-12929-2_7     Document Type: Conference Paper

References (16)

1. Berger, T.P., Cayrel, P.-L., Gaborit, P., Otmani, A.: Reducing key length of the McEliece cryptosystem. In: Preneel, B. (ed.) Progress in Cryptology - AFRICACRYPT 2009. LNCS, vol. 5580, pp. 77-97. Springer, Heidelberg (2009)
2. Berger, T.P., Loidreau, P.: How to mask the structure of codes for a cryptographic use. Designs, Codes and Cryptography 35(1), 63-79 (2005)
3. Berlekamp, E.R., McEliece, R.J., van Tilborg, H.C.A.: On the inherent intractability of certain coding problems. IEEE Transactions on Information Theory 24, 384-386 (1978)
4. 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)
5. Bernstein, D.J., Lange, T., Peters, C., van Tilborg, H.C.A.: Explicit bounds for generic decoding algorithms for code-based cryptography. In: Pre-Proceedings of WCC 2009, pp. 168-180 (2009)
6. 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)
7. Finiasz, M., Sendrier, N.: Security bounds for the design of code-based cryptosystems. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 88-105. Springer, Heidelberg (2009)
8. Hallgren, S., Vollmer, U.: Quantum computing. In: Bernstein, D.J., Buchmann, J., Dahmen, E. (eds.) Post-Quantum Cryptography, pp. 15-34. Springer, Berlin (2009)
9. Janwa, H., Moreno, O.: McEliece public key cryptosystems using algebraic-geometric codes. Designs, Codes and Cryptography 8(3), 293-307 (1996)
10. 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)
11. 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)
12. McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. Jet Propulsion Laboratory DSN Progress Report 42-44 (1978), http://ipnpr.jpl.nasa.gov/progress-report2/42-44/44N.PDF
13. Misoczki, R., Barreto, P.S.L.M.: Compact McEliece keys from Goppa codes. In: Jacobson Jr., M.J., Rijmen, V., Safavi-Naini, R. (eds.) SAC 2009. LNCS, vol. 5867, pp. 376-392. Springer, Heidelberg (2009)
14. Overbeck, R., Sendrier, N.: Code-based cryptography. In: Bernstein, D.J., Buchmann, J., Dahmen, E. (eds.) Post-Quantum Cryptography, pp. 95-145. Springer, Berlin (2009)
15. Prange, E.: The use of information sets in decoding cyclic codes. IRE Transactions on Information Theory 8(5), 5-9 (1962)
16. Stern, J.: A method for finding codewords of small weight. In:Wolfmann, J., Cohen, G. (eds.) Coding Theory 1988. LNCS, vol. 388, pp. 106-113. Springer, Heidelberg (1989)