Cryptanalysis of a new instance of McEliece crypto system based on QC-LDPC codes

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2007, Pages 2591-2595

  Baldi, Marco ^a   Chiaraluce, Franco ^a  

^a UNIVERSITÀ POLITECNICA DELLE MARCHE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTO SYSTEMS; TRANSMISSION RATES;

COMPUTER NETWORKS; CONVOLUTIONAL CODES; CYBERNETICS; INFORMATION THEORY; QUANTUM CHEMISTRY; TECHNICAL PRESENTATIONS;

CODES (SYMBOLS);

EID: 51649105649     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2007.4557609     Document Type: Conference Paper

References (25)

1. W. Diffle and M. Hellman, "New directions in cryptography," IEEE Trans. Inform. Theory, vol. 22, pp. 644-654, Nov. 1976.
2. R. J. McEliece, "A public-key cryptosystem based on algebraic coding theory." DSN Progress Report, pp. 114-116, 1978.
3. E. Berlekamp, R. McEliece, and H. van Tilborg, "On the inherent intractability of certain coding problems," IEEE Trans. Inform. Theory, vol. 24, pp. 384-386, May 1978.
4. K. Kobara and H. Imai, "On the one-wayness against chosen-plaintext attacks of the Loidreau's modified McEliece PKC," IEEE Trans. Inform. Theory, vol. 49, pp. 3160-3168, Dec. 2003.
5. H. Niederreiter, "Knapsack-type cryptosystems and algebraic coding theory," Probl. Contr. and Inform. Theory, vol. 15, pp. 159-166, 1986.
6. C. Monico, J. Rosenthal, and A. Shokrollahi, "Using low density parity check codes in the McEliece cryptosystem," in Proc. IEEE ISIT 2000, Sorrento, Italy, Jun. 2000, p. 215.
7. M. Baldi, F. Chiaraluce, R. Garello, and F. Mininni, "Quasi-cyclic lowdensity parity-check codes in the McEliece cryptosystem," in Proc. IEEE ICC 2007, Glasgow, Scotland, Jun. 2007, to be presented.
8. P. Gaborit, "Shorter keys for code based cryptography," in Proc. Workshop on Codes and Cryptography, Bergen, Norway, Mar. 2005, pp. 81-90.
9. R. Townsend and J. Weldon, E., "Self-orthogonal quasi-cyclic codes," IEEE Trans. Inform. Theory, vol. 13, pp. 183-195, Apr. 1967.
10. M. Karlin, "New binary coding results by circulants," IEEE Trans. Inform. Theory, vol. 15, pp. 81-92, Jan. 1969.
11. S. Johnson and S. Weller, "A family of irregular LDPC codes with low encoding complexity," IEEE Commun. Lett., vol. 7, pp. 79-81, Feb. 2003.
12. M. Baldi and F. Chiaraluce, "New quasi cyclic low density parity check codes based on difference families," in Proc. 8th Int. Symp. Commun. Theory and Appl., ISCTA 05, Ambleside, UK, Jul. 2005, pp. 244-249.
13. T. Xia and B. Xia, "Quasi-cyclic codes from extended difference families," in Proc. IEEE Wireless Commun. and Networking Conf., vol. 2, Mar. 2005, pp. 1036-1040.
14. M. Baldi, "Quasi-Cyclic Low-Density Parity-Check Codes and their Application to Cryptography," Ph.D. dissertation, Universit̀ Politecnica delle Marche, Ancona, Italy, Nov. 2006.
15. M. Baldi and F. Chiaraluce, "McEliece cryptosystems based on LDPC codes," In preparation.
16. P. Lee and E. Brickell, "An observation on the security of McEliece's public-key cryptosystem," in Advances in Cryptology - EUROCRYPT 88, Springer-Verlag, Ed., 1988, pp. 275-280.
17. A. Canteaut and F. Chabaud, "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. Inform. Theory, vol. 44, pp. 367-378, Jan. 1998.
18. T. A. Berson, "Failure of the McEliece public-key cryptosystem under message-resend and related-message attack," Advances in Cryptology -CRYPTO '97, Lecture Notes in Computer Science, vol. 1294, pp. 213-220, Aug. 1997.
19. H. M. Sun, "Improving the security of the McEliece public-key cryptosystem." in ASIACRYPT, 1998, pp. 200-213.
20. X.-Y. Hu, M. Fossorier, and E. Eleftheriou, "On the computation of the minimum distance of low-density parity-check codes," in Proc. IEEE ICC 2004, vol. 2, Paris, France, Jun. 2004, pp. 767-771.
21. J. Stern, "A method for finding codewords of small weight," in G. Cohen and J. Wolfmann, Coding Theory and Applications, Springer-Verlag, Ed., no. 388 in Lecture Notes in Computer Science, 1989, pp. 106-113.
22. M. Hirotomo, M. Mohri, and M. Morii, "A probabilistic computation method for the weight distribution of low-density parity-check codes," in Proc. IEEE ISIT 2005, Adelaide, Australia, Sep. 2005, pp. 2166-2170.
23. M. Bodrato, "Towards Optimal Toom-Cook Multiplication for Univariate and Multivariate Polynomials in Characteristic 2 and 0," in Proc. WAIFI'07, ser. Lecture Notes in Computer Science, C. Carlet and B. Sunar, Eds., vol. 4547. Springer, Jun. 2007, pp. 119-136.
24. _, Private Communication, 2007.
25. X.-Y. Hu, E. Eleftheriou, D.-M. Arnold, and A. Dholakia, "Efficient implementations of the sum-product algorithm for decoding LDPC codes," in Proc. IEEE Global Telecommunications Conference GLOBECOM '01, vol. 2, San Antonio, TX, Nov. 2001, pp. 1036-1036E.