Enhancing the security of the McEliece public-key cryptosystem

Journal of Information Science and Engineering

Volumn 16, Issue 6, 2000, Pages 799-812

  Sun, Hung Min ^a  

^a NATIONAL CHENG KUNG UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); DATA HANDLING; ERROR CORRECTION; INFORMATION RETRIEVAL;

BINARY MATRICES; GOPPA CODES; MCELIECE SCHEMES; PUBLIC-KEY CRYPTOSYSTEMS;

CRYPTOGRAPHY;

EID: 0034318399     PISSN: 10162364     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (30)

1. R. J. McEliece, "A public-key cryptosystem based on algebraic coding theory," DSN Progress Report, 42-44, 1978, pp. 114-116.
2. E. R. Berlekamp, R. J. McEliece, and H. C. A. van Tilborg, "On the inherent intractability of certain coding problems," IEEE Transactions on Information Theory, Vol. 24, No. 5, 1978, pp. 384-386.
3. T. ElGamal, "A public-key cryptosystem and a signature scheme based on discrete logarithms," IEEE Transactions on Information Theory, Vol. 31, No. 4, 1985, pp. 469-472.
4. R. L. Rivest, A. Shamir, and L. M. Adleman, "A method for obtaining digital signatures and public-key cryptosystems," Communications of the ACM, Vol. 21, No. 2, 1978, pp. 120-126.
5. M. Blum and S. Goldwasser, "An efficient probabilistic public-key encryption scheme which hides all partial information," Advances in Cryptology-CRYPTO '84, Lecture notes in computer science (Springer-Verlag), 1985, pp. 289-299.
6. S. Goldwasser and S. Micali, "Probabilistic encryption and how to play mental poker keeping secret all partial information," in Proceedings of the 14th ACM Symposium on the Theory of Computing, 1982, pp. 270-299.
7. M. O. Rabin, "Digital signatures and public-key functions as intractable as factorization," MIT Lab. for Computer Science, Technical Report, MIT/LCS/TR-212, 1979.
8. M. C. Lin and H. L. Fu, "Information rate of McEliece's public-key cryptosystem," Electronics Letters, Vol. 26, No. 1, 1990, pp. 16-18.
9. C. S. Park, "Improving code rate of McEliece's public-key cryptosystem," Electronics Letters, Vol. 25, No. 21, 1989, pp. 1466-1467.
10. N. Sendrier, "Efficient generation of binary words of given weight," Cryptography and Coding: 5th IMA Conference, 1995, pp. 184-187.
11. H. M. Sun and T. Hwang, "Key generation of algebraic-code cryptosystems," Computers and Mathematics with Applications, Vol. 27, No. 2, 1994, pp. 99-106.
12. C. Adams and H. Meijer, "Security-related comments regarding McEliece's public-key cryptosystem," Advances in Cryptology-CRYPTO '87, Lecture notes in computer science, 1988, pp. 224-228.
13. C. Adams and H. Meijer, "Security-related comments regarding McEliece's public-key cryptosystem," IEEE Transactions on Information Theory, Vol. 35, No. 2, 1989, pp. 454-455.
14. E. F. Brickell and A. Odlyzko, "Cryptanalysis: a survey of recent results," in Proceedings of IEEE, Vol. 76, No. 5, 1988, pp. 153-165.
15. V. I. Korzhik and A. I. Turkin, "Cryptanalysis of McEliece's public-key cryptosystem," Advances in Cryptology-EUROCRYPT '91, Lecture notes in computer science, 1991, pp. 68-70.
16. P. J. Lee and E. F. Brickell, "An observation on the security of McEliece's public-key cryptosystem," Advances in Cryptology-EUROCRYPT '88, Lecture notes in computer science, 1988, pp. 275-280.
17. J. van Tilburg, "On the McEliece public-key cryptosystem," Advances in Cryptology-CRYPTO '88, Lecture notes in computer science, 1990, pp. 119-131.
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, 1997, pp. 213-220.
19. M. Bellare, A. Desai, D. Pointcheval, and P. Rogaway, "Relations among notions of security for public-key encryption schemes," Advances in Cryptology-CRYPTO '98, Lecture Notes in Computer Science, Vol. 1462, 1998, pp. 26-45.
20. P. J. M. Hin, "Channel-error-correcting privacy cryptosystems," M.Sc. Thesis, Delft University of Technology, 1986.
21. F. Jorissen, "A security evaluation of the public-key cipher system proposed by McEliece, used as a combined scheme," Technical Report, Dept. of Elektrotechniek, Katholieke University Leuven, 1986.
22. M. Bellare and P. Rogaway, "Optimal asymmetric encryption," Advances in Cryptology-CRYPTO '94, Lecture notes in computer science, 1997, pp. 232-249.
23. S. Goldwasser and S. Micali, "Probabilistic encryption," Journal of Computer and System Science, Vol. 28, No. 2, 1984, pp. 270-199.
24. D. Dolev, C. Dwork, and M. Naor, "Non-malleable cryptography," in Proceedings of the 23rd Annual Symposium on Theory of Computing, ACM, 1991, pp. 542-552.
25. M. Naor and M. Yung, "Public-key cryptosystems provably secure against chosen ciphertext attacks," in Proceedings of the 22nd Annual Symposium on Theory of Computing, ACM, 1990, pp. 427-437.
26. C. Rackoff and D. Simon, "Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack," Advances in Cryptology-CRYPTO '91, Lecture notes in computer science, Vol. 576, 1992, pp. 433-444.
27. R. L. Rivest, "The MD5 message digest algorithm," RFC 1321, 1992.
28. B. Schneier, Applied Cryptography, John Wiley & Sons, 1996.
29. National Bureau of Standards, NBS FIPS PUB 46, "Data Encryption Standard," National Bureau of Standards, U.S. Department of Commerce, 1977.
30. J. Daeman, "Cipher and hash function design," Ph.D. Thesis, Dept. of Elektrotechniek, Katholieke Universiteit Leuven, 1995.