Semantically secure mceliece public-key cryptosystems –conversions for McEliece PKC

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

Volumn 1992, Issue , 2001, Pages 19-35

  Kobara, Kazukuni ^a   Imai, Hideki ^a  

^a INSTITUTE OF INDUSTRIAL SCIENCE   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

CHROMIUM COMPOUNDS; COMPUTER PROGRAMMING; NUMBER THEORY; POLYNOMIAL APPROXIMATION; QUANTUM COMPUTERS; SECURITY OF DATA;

CHOSEN CIPHERTEXT ATTACK; DISCRETE LOGARITHM PROBLEMS; FACTORING PROBLEM; PARTIAL KNOWLEDGE; POLYNOMIAL-TIME; POLYNOMIAL-TIME ALGORITHMS; PUBLIC KEY CRYPTOSYSTEMS; RANDOM ORACLE MODEL;

PUBLIC KEY CRYPTOGRAPHY;

EID: 84937393537     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44586-2_2     Document Type: Conference Paper

References (29)

1. C. M. Adams and H. Meijer. “Security-Related Comments Regarding McEliece’s Public-Key Cryptosystem”. In Proc. of CRYPTO’87, LNCS 293, pages 224–228. Springer–Verlag, 1988.
2. M. Bellare and P. Rogaway. “Optimal Asymmetric Encryption”. In Proc. of EUROCRYPT’94, LNCS 950, pages 92–111, 1995.
3. T. Berson. “Failure of the McEliece Public-Key Cryptosystem Under Message- Resend and Related-Message Attack”. In Proc. of CRYPTO’97, LNCS 1294, pages 213–220. Springer–Verlag, 1997.
4. A. Canteaut and N. Sendrier. “Cryptoanalysis of the Original McEliece Cryptosystem”. In Proc. of ASIACRYPT’98, pages 187–199, 1998.
5. W. Diffie and M. Hellman. “New directions in cryptography”. IEEE Trans. IT, 22(6):644–654, 1976.
6. D. Dolve, C. Dwork, and M. Naor. “Non-Malleable Cryptography”. In Proc. of the 23rd STOC. ACM Press, 1991.
7. T. ElGamal. “A public-key cryptosystem and a signature scheme bsed on discrete logarithms”. In Proc. of CRYPTO’84, pages 10–18, 1985.
8. E. Fujisaki and T. Okamoto. “How to Enhance the Security of Public-Key Encryption at Minimum Cost”. In Proc. of PKC’99, LNCS 1560, pages 53–68, 1999.
9. E. Fujisaki and T. Okamoto. “Secure Integration of Asymmetric and Symmetric Encryption Schemes”. In Proc. of CRYPTO’99, LNCS 1666, pages 535–554, 1999.
10. J. K. Gibson. “Equivalent Goppa Codes and Trapdoors to McEliece’s Public Key Cryptosystem”. In Proc. of EUROCRYPT’91, LNCS 547, pages 517–521. Springer–Verlag, 1991.
11. S. Goldwasser and S. Micali. “Probabilistic encryption”. Journal of Computer and System Sciences, pages 270–299, 1984.
12. C. Hall, I. Goldberg, and B. Schneier. “Reaction Attacks Against Several Public- Key Cryptosystems”. In Proc. of the 2nd International Conference on Information and CommunicationsSe curity (ICICS’99), LNCS 1726, pages 2–12, 1999.
13. K. Kobara and H. Imai. “Countermeasure against Reaction Attacks (in Japanese)”. In The 2000 Symposium on Cryptography and Information Security: A12, January 2000.
14. V.I. Korzhik and A.I. Turkin. “Cryptanalysis of McEliece’s Public-Key Cryptosystem”. In Proc. of EUROCRYPT’91, LNCS 547, pages 68–70. Springer–Verlag, 1991.
15. P. J. Lee and E. F. Brickell. “An Observation on the Security of McEliece’s Public- Key Cryptosystem”. In Proc. of EUROCRYPT’88, LNCS 330, pages 275–280. Springer–Verlag, 1988.
16. P. Loidreau. “Strengthening McEliece Cryptosystem”. In Proc. of ASIACRYPT 2000. Springer–Verlag, 2000.
17. P. Loidreau and N. Sendrier. “Some weak keys in McEliece public-key cryptosystem”. In Proc. of IEEE International Symposium on Information Theory, ISIT’98, page 382, 1998.
18. R. J. McEliece. “A Public-Key Cryptosystem Based on Algebraic Coding Theory”. In Deep Space Network Progress Report, 1978.
19. A. J. Menezes, P. C. Oorschot, and S. A. Vanstone. “McEliece public-key encryption”. In “Handbook of Applied Cryptography”, page 299. CRC Press, 1997.
20. D. Naccache and J. Stern. “A New Cryptosystem based on Higher Residues”. In Proc. of the 5th CCS, pages 59–66. ACM Press, 1998.
21. T. Okamoto, K. Tanaka, and S. Uchiyama. “Quantum Public-Key Cryptosystems”. In Proc. of CRYPTO 2000, LNCS 1880, pages 147–165. Springer–Verlag, 2000.
22. T. Okamoto and S. Uchiyama. “A New Public Key Cryptosystem as Secure as Factoring”. In Proc. of EUROCRYPT’98, LNCS 1403, pages 129–146, 1999.
23. P. Paillier. “Public-Key Cryptosystems Based on Discrete Logarithms Residues”. In Proc. of EUROCRYPT’99, LNCS 1592, pages 223–238. Springer–Verlag, 1999.
24. D. Pointcheval. “Chosen-Ciphertext Security for Any One-Way Cryptosystem”. In Proc. of PKC 2000, LNCS 1751, pages 129–146. Springer–Verlag, 2000.
25. P.W. Shor. “Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer”. SIAM Journal on Computing, 26:1484–1509, 1997.
26. J. Stern. “A method for finding codewords of small weight”. In Proc. of Coding Theory and Applications, LNCS 388, pages 106–113. Springer–Verlag, 1989.
27. H. M. Sun. “Improving the Security of the McEliece Public-Key Cryptosystem”. In Proc. of ASIACRYPT’98, pages 200–213, 1998.
28. H. M. Sun. “Further Cryptanalysis of the McEliece Public-Key Cryptosystem”. IEEE Trans. on communication letters, 4:18–19, 2000.
29. A. Vardy. “The Intractability of Computing the Minimum Distance of a Code”. IEEE Trans. on IT, 43:1757–1766, 1997.