Smaller decoding exponents: Ball-collision decoding

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

Volumn 6841 LNCS, Issue , 2011, Pages 743-760

  Bernstein, Daniel J ^a   Lange, Tanja ^b   Peters, Christiane ^b  

^a 1120 Science and Engineering Offices   (United States)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

attacks; collision decoding; information set decoding; McEliece cryptosystem; Niederreiter cryptosystem; post quantum cryptography

Indexed keywords

PUBLIC KEY CRYPTOGRAPHY; QUANTUM COMPUTERS; QUANTUM CRYPTOGRAPHY;

ATTACKS; COLLISION DECODING; INFORMATION SET DECODING; MCELIECE CRYPTOSYSTEM; NIEDERREITER CRYPTOSYSTEM; POST QUANTUM CRYPTOGRAPHY;

DECODING;

EID: 80052013042     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-22792-9_42     Document Type: Conference Paper

References (53)

1. Adams, C.M., Meijer, H.: Security-related comments regarding McEliece's public-key cryptosystem. In: Crypto'87 [46], pp. 224-228 (1987); See also newer version [2]; Citations in this document: §4
2. Adams, C.M., Meijer, H.: Security-related comments regarding McEliece's public-key cryptosystem. IEEE Transactions on Information Theory 35, 454-455 (1988); See also older version [1]; Citations in this document: §1, §4
3. Al Jabri, A.: A statistical decoding algorithm for general linear block codes. In: IMA 2001 [31], pp. 1-8 (2001); Citations in this document: §4
4. Ashikhmin, A.E., Barg, A.: Minimal vectors in linear codes. IEEE Transactions on Information Theory 44, 2010-2017 (1998); Citations in this document: §4
5. Barg, A., Krouk, E.A., van Tilborg, H.C.A.: On the complexity of minimum distance decoding of long linear codes. IEEE Transactions on Information Theory 45, 1392-1405 (1999); Citations in this document: §4, §4, §4, §4, §4, §4
6. Batten, L., Safavi-Naini, R. (eds.): Information security and privacy: 11th Australasian conference, ACISP 2006, Melbourne, Australia, July 3-5, 2006, proceedings. LNCS, vol. 4058. Springer, Heidelberg (2006); See [43]
7. Bernstein, D.J., Buchmann, J., Dahmen, E. (eds.): Post-quantum cryptography. Springer, Heidelberg (2009); See [44]
8. Bernstein, D.J., Lange, T., Peters, C.: Attacking and defending the McEliece cryptosystem. In: PQCrypto 2008 [14], pp. 31-46 (2008), http://eprint.iacr.org/2008/318; Citations in this document: §1, §1, §3, §3, §4, §4, §6
9. Bernstein, D.J., Lange, T., Peters, C.: Smaller decoding exponents: ball-collision decoding (full version) (2010), http://eprint.iacr.org/2010/585; Citations in this document: §7, §7, §8
10. Bernstein, D.J., Lange, T., Peters, C., van Tilborg, H.C.A.: Explicit bounds for generic decoding algorithms for code-based cryptography. In: WCC 2009 (2009); Citations in this document: §5
11. Berson, T.A.: Failure of the McEliece public-key cryptosystem under messageresend and related-message attack. In: Crypto '97 [33], pp. 213-220 (1997); Citations in this document: §1
12. Blaum, M., Farrell, P.G., van Tilborg, H.C.A. (eds.): Information, coding and mathematics. Kluwer International Series in Engineering and Computer Science, vol. 687. Kluwer, Dordrecht (2002); See [53]
13. Brent, R.P., Kung, H.T.: The area-time complexity of binary multiplication. Journal of the ACM 28, 521-534 (1981), http://wwwmaths.anu.edu. au/~brent/pub/pub055.html; Citations in this document: §6
14. Buchmann, J., Ding, J. (eds.): Post-quantum cryptography, second international workshop, PQCrypto 2008, Cincinnati, OH, USA, October 17-19, 2008, proceedings. LNCS, vol. 5299. Springer, Heidelberg (2008); See [8]
15. Camion, P., Charpin, P., Harari, S. (eds.): Eurocode '92: proceedings of the international symposium on coding theory and applications held in Udine, October 23-30, 1992. Springer, Heidelberg (1993); See [20]
16. Canteaut, A., Chabanne, H.: A further improvement of the work factor in an attempt at breaking McEliece's cryptosystem. In: EUROCODE '94 [21] (1994), http://www.inria.fr/rrrt/rr-2227.html; Citations in this document: §4
17. 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, 367-378 (1998), ftp://ftp.inria.fr/INRIA/tech-reports/RR/RR-2685.ps.gz; Citations in this document: §3, §4
18. Canteaut, A., Sendrier, N.: Cryptanalysis of the original McEliece cryptosystem. In: Asiacrypt '98 [42], pp. 187-199 (1998); Citations in this document: §3, §4
19. Chabanne, H., Courteau, B.: Application de la méthode de décodage itérative d'Omura à la cryptanalyse du système de McEliece. Université de Sherbrooke, Rapport de Recherche, number 122 (1993); Citations in this document: §4
20. Chabaud, F.: Asymptotic analysis of probabilistic algorithms for finding short codewords. In: [15], pp. 175-183 (1993); Citations in this document: §4
21. Charpin, P.(ed.): Livre des résumé - EUROCODE '94. Abbaye de la Bussière sur Ouche, France, October 1994 (1994); See [16]
22. Clark Jr., G.C., Bibb Cain, J.: Error-correcting coding for digital communication. Plenum, New York (1981); Citations in this document: §4
23. Coffey, J.T., Goodman, R.M.: The complexity of information set decoding. IEEE Transactions on Information Theory 35, 1031-1037 (1990); Citations in this document: §4
24. Coffey, J.T., Goodman, R.M., Farrell, P.: New approaches to reduced complexity decoding. Discrete and Applied Mathematics 33, 43-60 (1991); Citations in this document: §4, §5
25. Cohen, G.D., Wolfmann, J. (eds.): Coding theory and applications. LNCS, vol. 388. Springer, Heidelberg (1989); See [50]
26. Dumer, I.I.: Two decoding algorithms for linear codes. Problemy Peredachi Informatsii 25, 24-32 (1989); Citations in this document: §4
27. Dumer, I.I.: On minimum distance decoding of linear codes. In: [32], pp. 50-52 (1991); Citations in this document: §4
28. Finiasz, M., Sendrier, N.: Security bounds for the design of code-based cryptosystems. In: Asiacrypt 2009 [40] (2009), http://eprint.iacr.org/2009/414; Citations in this document: §1, §4, §4, §4, §4, §6, §2, §8, §8, §8, §8
29. Goldwasser, S. (ed.): Advances in cryptology - CRYPTO '88, proceedings of the conference on the theory and application of cryptography held at the University of California, Santa Barbara, California, August 21-25, 1988. LNCS, vol. 403. Springer, Heidelberg (1990); See [51]
30. Günther, C.G. (ed.): Advances in cryptology - EUROCRYPT '88, proceedings of the workshop on the theory and application of cryptographic techniques held in Davos, May 25-27, 1988. LNCS, vol. 330. Springer, Heidelberg (1988); See [38]
31. Honary, B. (ed.): Cryptography and coding: proceedings of the 8th IMA international conference held in Cirencester, December 17-19. LNCS, vol. 2260. Springer, Heidelberg (2001); See [3]
32. Kabatianskii, G.A. (ed.): Fifth joint Soviet-Swedish international workshop on information theory, Moscow, 1991 (1991); See [27]
33. Kaliski Jr., B.S. (ed.): Advances in cryptology - CRYPTO '97: 17th annual international cryptology conference, Santa Barbara, California, USA, August 17-21, 1997, proceedings. LNCS, vol. 1294. Springer, Heidelberg (1997); See[11]
34. Kim, K. (ed.): Public key cryptography: proceedings of the 4th international workshop on practice and theory in public key cryptosystems (PKC 2001) held on Cheju Island, February 13-15, 2001. LNCS, vol. 1992. Springer, Heidelberg (2001); See [36]
35. Kleinjung, T., Aoki, K., Franke, J., Lenstra, A.K., Thomé, E., Bos, J.W., Gaudry, P., Kruppa, A., Montgomery, P.L., Osvik, D.A., te Riele, H., Timofeev, A., Zimmermann, P.: Factorization of a 768-bit RSA modulus. In: Crypto 2010 [48], pp. 333-350 (2010), http://eprint.iacr.org/2010/006; Citations in this document: §8
36. Kobara, K., Imai, H.: Semantically secure McEliece public-key cryptosystems - conversions for McEliece PKC. In: PKC 2001 [34], pp. 19-35 (2001); Citations in this document: §1
37. Krouk, E.A.: Decoding complexity bound for linear block codes. Problemy Peredachi Informatsii 25, 103-107 (1989); Citations in this document: §4, §4
38. Lee, P.J., Brickell, E.F.: An observation on the security of McEliece's public-key cryptosystem. In: Eurocrypt '88 [30], pp. 275-280 (1988), http://dsns.csie.nctu.edu.tw/research/crypto/HTML/PDF/E88/275.PDF; Citations in this document: §4
39. Leon, J.S.: A probabilistic algorithm for computing minimum weights of large error-correcting codes. IEEE Transactions on Information Theory 34, 1354-1359 (1988); Citations in this document: §4
40. Matsui, M. (ed.): Advances in cryptology-ASIACRYPT 2009, 15th international conference on the theory and application of cryptology and information security, Tokyo, Japan, December 6-10, 2009, proceedings. LNCS, vol. 5912. Springer, Heidelberg (2009); See [28]
41. McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. JPL DSN Progress Report 114-116 (1978), http://ipnpr.jpl.nasa.gov/ progress-report2/42-44/44N.PDF; Citations in this document: §1, §4
42. Ohta, K., Pei, D. (eds.): Advances in cryptology - ASIACRYPT'98: proceedings of the international conference on the theory and application of cryptology and information security held in Beijing. LNCS, vol. 1514. Springer, Heidelberg (1998); See [18]
43. Overbeck, R.: Statistical decoding revisited. In: ACISP 2006 [6], pp. 283-294 (2006); Citations in this document: §4
44. Overbeck, R., Sendrier, N.: Code-based cryptography. In: [7], pp. 95-145 (2009); Citations in this document: §2, §4
45. Peters, C.: Information-set decoding for linear codes over Fq. In: Post-Quantum Cryptography [49], pp. 81-94 (2010); Citations in this document: §1, §4, §2
46. Pomerance, C. (ed.): Advances in cryptology - CRYPTO '87, proceedings of the conference on the theory and applications of cryptographic techniques held at the University of California, Santa Barbara, California, August 16-20, 1987. LNCS, vol. 293. Springer, Heidelberg (1987), http://dsns.csie.nctu.edu.tw/ research/crypto/HTML/PDF/C87/224.PDF; See [1]
47. Prange, E.: The use of information sets in decoding cyclic codes. IRE Transactions on Information Theory IT-8, S5-S9 (1962); Citations in this document: §4
48. Rabin, T. (ed.): Advances in cryptology-CRYPTO 2010, 30th annual cryptology conference, Santa Barbara, CA, USA, August 15-19, 2010, proceedings. LNCS, vol. 6223. Springer, Heidelberg (2010); See [35]
49. Sendrier, N. (ed.): Post-quantum cryptography, third international workshop, PQCrypto, Darmstadt, Germany, May 25-28, 2010, proceedings. LNCS, vol. 6061. Springer, Heidelberg (2010); See [45]
50. Stern, J.: A method for finding codewords of small weight. In: [25], pp. 106-113 (1989); Citations in this document: §1, §3, §3, §4, §4
51. van Tilburg, J.: On the McEliece public-key cryptosystem. In: Crypto '88 [29], pp. 119-131 (1990); Citations in this document: §4
52. van Tilburg, J.: Security-analysis of a class of cryptosystems based on linear error-correcting codes. Ph.D. thesis, Technische Universiteit Eindhoven (1994); Citations in this document: §4
53. Verheul, E.R., Doumen, J.M., van Tilborg, H.C.A.: Sloppy Alice attacks! Adaptive chosen ciphertext attacks on the McEliece public-key cryptosystem. In: [12], pp. 99-119 (2002); Citations in this document: §1