Decoding random binary linear codes in 2 n/20: How 1+1=0 improves information set decoding

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

Volumn 7237 LNCS, Issue , 2012, Pages 520-536

  Becker, Anja ^a   Joux, Antoine ^a,b   May, Alexander ^c,d   Meurer, Alexander ^c  

^a UNIVERSITY OF VERSAILLES   (France)

^b DGA   (France)

^c RUHR UNIVERSITY BOCHUM   (Germany)

^d DFG Project MA 2536/7   (Germany)

Author keywords

Information Set Decoding; Representation Technique

Indexed keywords

BALL COLLISIONS; BINARY LINEAR CODES; COMPLEXITY THEORY; DECODING ALGORITHM; INFORMATION SET; RANDOM CODES; RANDOM LINEAR CODES; REPRESENTATION TECHNIQUES; RUNNING TIME;

ALGORITHMS; CRYPTOGRAPHY;

DECODING;

EID: 84860003018     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-29011-4_31     Document Type: Conference Paper

References (31)

1. Alekhnovich, M.: More on Average Case vs Approximation Complexity. In: 44th Symposium on Foundations of Computer Science (FOCS), pp. 298-307 (2003)
2. Becker, A., Coron, J.-S., Joux, A.: Improved Generic Algorithms for Hard Knapsacks. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 364-385. Springer, Heidelberg (2011)
3. Becker, A., Joux, A., May, A., Meurer, A.: Decoding Random Binary Linear Codes in 2n/20: How 1 + 1 = 0 Improves Information Set Decoding. Full Version, http://eprint.iacr.org
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.: Smaller Decoding Exponents: Ball-Collision Decoding. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 743-760. Springer, Heidelberg (2011)
6. Elwyn, R.J.M., Berlekamp, R., van Tilborg, H.C.: On the inherent intractability of certain coding problems. IEEE Transactions on Information Theory 24, 384-386 (1978)
7. Blinovskii, V.M.: Lower asymptotic bound on the number of linear code words in a sphere of given radius in Fnq . Probl. Peredach. Inform. 23, 50-53 (1987)
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. Coffey, J.T., Goodman, R.M.: The complexity of information set decoding. IEEE Transactions on Information Theory 36, 1031-1037 (1990)
10. Coffey, J.T., Goodman, R.M.: Any code of which we cannot think is good. IEEE Transactions on Information Theory 36 (1990)
11. Faug̀ere, J.-C., Otmani, A., Perret, L., Tillich, J.-P.: A Distinguisher for High Rate McEliece Cryptosystems. In: YACC 2010, full version available as eprint Report 2010/331 (2010)
12. 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)
13. Goblick Jr., T.J.: Coding for a discrete information source with a distortion measure. Ph.D. dissertation, Dept. of Elect. Eng. M.I.T., Cambridge, MA (1962)
14. Hopper, N.J., Blum, M.: Secure Human Identification Protocols. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 52-66. Springer, Heidelberg (2001)
15. 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)
16. Jordan, J.P.: A variant of a public key cryptosystem based on goppa codes. SIGACTNews 15, 61-66 (1983)
17. Kiltz, E., Pietrzak, K., Cash, D., Jain, A., Venturi, D.: Efficient Authentication from Hard Learning Problems. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 7-26. Springer, Heidelberg (2011)
18. Knuth, D.: Art of Computer Programming: Sorting and Searching, 2nd edn., vol. 3. Addison-Wesley Professional (1998)
19. Lee, P.J.,Brickell, E.F.:An Observation on the Security of McEliece's Public-Key Cryptosystem. In: G̈unther, C.G. (ed.) EUROCRYPT 1988. LNCS, vol. 330, pp. 275-280. Springer, Heidelberg (1988)
20. Leon, J.S.: A probabilistic algorithm for computing minimum weights of large errorcorrecting codes. IEEE Transactions on Information Theory 34(5), 1354-1359 (1988)
21. Levitin, L.B.: Covering radius of almost all linear codes satisfies the Goblick bound. In: IEEE Internat. Symp. on Information Theory, Kobe, Japan (1988)
22. McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. In: Jet Propulsion Laboratory DSN Progress Report 42-44, pp. 114-116 (1978)
23. May, A., Meurer, A., Thomae, E.: Decoding Random Linear Codes in Õ(20.054n). In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 107-124. Springer, Heidelberg (2011)
24. Nguyen, P.Q., Shparlinski, I.E., Stern, J.: Distribution of modular sums and the security of the server aided exponentiation. In: Progress in Computer Science and Applied Logic. Final Proceedings of Cryptography and Computational Number Theory Workshop, Singapore 1999, vol. 20, pp. 331-224 (2001)
25. Prange, E.: The Use of Information Sets in Decoding Cyclic Codes. IRE Transaction on Information Theory 8(5), 5-9 (1962)
26. Peters, C.: Information-Set Decoding for Linear Codes over Fq. In: Sendrier, N. (ed.) PQCrypto 2010. LNCS, vol. 6061, pp. 81-94. Springer, Heidelberg (2010)
27. Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC), pp. 84-93 (2005)
28. Sendrier, N.: Finding the permutation between equivalent linear codes: The support splitting algorithm. IEEE Transactions on Information Theory 46, 1193-1203 (2000)
29. Sendrier, N.: On the security of the McEliece public-key cryptosystem. In: Blaum, M., Farrell, P., van Tilborg, H. (eds.) Information, Coding andMathematics, pp. 141-163. Kluwer (2002); Proceedings of Workshop honoring Prof. Bob McEliece on his 60th birthday
30. 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)
31. Wagner, D.: A Generalized Birthday Problem. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 288-303. Springer, Heidelberg (2002)