On the One-Wayness Against Chosen-Plaintext Attacks of the Loidreau's Modified McEliece PKC

IEEE Transactions on Information Theory

Volumn 49, Issue 12, 2003, Pages 3160-3168+3353

  Kobara, Kazukuni ^a   Imai, Hideki ^a  

^a INSTITUTE OF INDUSTRIAL SCIENCE   (Japan)

Author keywords

Chosen ciphertext attack; Goppa code; IND CCA; McEliece PKC; One wayness; Public key cryptosystem

Indexed keywords

ALGORITHMS; DECODING; PARAMETER ESTIMATION; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; SIGNAL ENCODING; VECTORS;

BINARY WORK FACTORS; GOPPA CODE; INTEGER FACTORING PROBLEMS (IFP);

PUBLIC KEY CRYPTOGRAPHY;

EID: 0347968064     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2003.820016     Document Type: Article

References (27)

1. (1997) RSA Labs' 64bit RC5 Encryption Challenge. [Online]. Avail able: http://stats.distributed.net/
2. (1999) RSA code-breaking contest again won by distributed.net and Electronic Frontier Foundation (EFF). [Online]. Available: http://www.rsasecurity.com/news/pr/990119-1.html
3. C. M. Adams and H. Meijer, "Security-related comments regarding McEliece's public-key cryptosystem," in Proc. CRYPTO '87 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 1988, vol. 293, pp. 224-228.
4. M. Bellare and P. Rogaway, "Random oracles are practical: A paradigm for designing efficient protocols," in Proc. 1st ACM CCCS, 1993, pp. 62-73.
5. E. R. Berlekamp, R. J. McEliece, and H. van Tilborg, "On the inherent intractability of certain coding problems," IEEE Trans. Inform. Theory, vol. IT-24, pp. 384-386, May 1978.
6. T. Berson, "Failure of the McEliece public-key cryptosystem under message-resend and related-message attack," in Proc. CRYPTO '97 (Lecture Notes in Computer Science). Berlin, Germny: Springer-Verlag, 1997, vol. 1294, pp. 213-220.
7. 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.
8. A. Canteaut and N. Sendrier, "Cryptoanalysis of the original McEliece cryptosystem," in Proc. ASIACRYPT '98, 1998, pp. 187-199.
9. W. Diffie and M. Hellman, "New directions in cryptography," IEEE Trans. Inform. Theory, vol. IT-22, pp. 644-654, Nov. 1976.
10. S. Goldwasser and S. Micali, "Probabilistic encryption," J. Comput. Syst. Sci., pp. 270-299, 1984.
11. C. Hall, I. Goldberg, and B. Schneier, "Reaction attacks against several public-key cryptosystems," in Proc. 2nd Int. Conf. Information and Communications Security (ICICS'99) (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 1999, vol. 1726, pp. 2-12.
12. K. Kobara and H. Imai, "Countermeasure against reaction attacks (in Japanese)," presented at the The 2000 Symposium on Cryptography and Information Security, Jan. 2000. Paper A12.
13. _, "Countermeasures against all the known attacks to the McEliece PKC," in Proc. 2000 Int. Symp. Information Theory and Its Applications, Nov. 2000, pp. 661-664.
14. _, "OAEP++-- Another very simple way to fix the bug in OAEP-," in Proc. 2002 Int. Symp. Information Theory and Its Applications, 2002, pp. 563-566. Paper S6-4-5.
15. _, "Semantically secure McEliece public-key cryptosystem," IEICE Trans., vol. E85-A, no. 1, pp. 74-83, Jan. 2002.
16. P. J. Lee and E. F. Brickell, "An observation on the security of McEliece's public-key cryptosystem," in Proc. EUROCRYPT '88 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 1988, vol. 330, pp. 275-280.
17. A. K. Lenstra and E. R. Verheul, "Selecting cryptographic key sizes," J. Cryptology, vol. 14, no. 4, pp. 255-293, 2001.
18. R. Lidl and H. Niederreiter, Finite Fields. Cambridge, U.K.: Cambridge Univ. Press, 1983, p. 13.
19. P. Loidreau, "Strengthening McEliece cryptosystem," in Proc. ASIACRYPT 2000, 2000, pp. 585-598.
20. P. Loidreau and N. Sendrier, "Weak keys in McEliece public-key cryptosystem," IEEE Trans. Inform. Theory, vol. 47, pp. 1207-1212, Mar. 2001.
21. R. J. McEliece, "A public-key cryptosystem based on algebraic coding theory," in Deep Space Network Progress Report, 1978.
22. N. Sendrier, "The Support Splitting Algorithm," report, Rapport de Recherche: ISSN0249-6399, 1999.
23. _, "On the structure of randomly permuted concatenated code," in Proc. EUROCODE 94, Abbeye de la Bussiere sur Ouche, France, Oct. 24-28, 1994, pp. 169-173.
24. P. W. Shor, "Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer," SIAM J. Computing, vol. 26, no. 5, pp. 1484-1509, 1997.
25. V. M. Sidel'nikov and S. O. Shestakov, "On insecurity of cryptosystems based on generalized reed-solomon codes," Discr. Math. Applic., vol. 2, no. 4, pp. 439-444, 1992.
26. J. Stern, "A method for finding codewords of small weight," in Proc. Coding Theory and Applications (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 1989, vol. 388, pp. 106-113.
27. H. M. Sun, "Further cryptanalysis of the McEliece public-key cryptosystem," IEEE Commun. Lett., vol. 4, pp. 18-19, Jan. 2000.