Decoding random linear codes in Õ (20.054n

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

Volumn 7073 LNCS, Issue , 2011, Pages 107-124

  May, Alexander ^a   Meurer, Alexander ^a   Thomae, Enrico ^a  

^a RUHR UNIVERSITY BOCHUM   (Germany)

Author keywords

Information set decoding; representation technique

Indexed keywords

CODE-BASED CRYPTOGRAPHY; COMPLEXITY ANALYSIS; COMPLEXITY THEORY; DECODING ALGORITHM; FUNDAMENTAL PROBLEM; LINEAR CODES; MCELIECE; RANDOM LINEAR CODES; REPRESENTATION TECHNIQUES; RUNNING TIME; RUNNING-IN; SUBSET-SUM ALGORITHM; TIME COMPLEXITY;

ALGORITHMS; CRYPTOGRAPHY; SECURITY OF DATA;

DECODING;

EID: 82955177030     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-25385-0_6     Document Type: Conference Paper

References (13)

1. Alon, N., Spencer, J.: The Probabilistic Method. Wiley (2008)
2. Berlekamp, E., McEliece, R., van Tilborg, H.: On the inherent intractability of certain coding problems (Corresp.). IEEE Transactions on Information Theory 24(3), 384-386(1978) (Pubitemid 8607605)
3. 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)
4. Bernstein, D. J., Lange, T., Peters, C.: Smaller Decoding Exponents: Ball-Collision Decoding. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 743-760. Springer, Heidelberg (2011)
5. 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)
6. Guruswami, V.: Introduction to Coding Theory. Lecture Notes (2010)
7. Hopper, N. J., Blum, M.: Secure Human Identification Protocols. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 52-66. Springer, Heidelberg (2001) (Pubitemid 33371178)
8. Howgrave-Graham, N., Joux, A.: New Generic Algorithms for Hard Knapsacks. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 235-256. Springer, Heidelberg (2010)
9. 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)
10. Leon, J. S.: A probabilistic algorithm for computing minimum weights of large errorcorrecting codes. IEEE Transactions on Information Theory 34(5), 1354(1988)
11. McEliece, R. J.: A public-key cryptosystem based on algebraic coding theory. In: DSN Progress Report 42-44(1978)
12. Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: Gabow, H. N., Fagin, R. (eds.) STOC, pp. 84-93. ACM (2005) (Pubitemid 43098575)
13. Stern, J.: A method for finding codewords of small weight. In: Wolfmann, J., Cohen, G. D. (eds.) Coding Theory 1988. LNCS, vol. 388, pp. 106-113. Springer, Heidelberg (1989)