Quantum public-key cryptosystems

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

Volumn 1880, Issue , 2000, Pages 147-165

  Okamoto, Tatsuaki ^a   Tanaka, Keisuke ^a   Uchiyama, Shigenori ^a  

^a NTT CORPORATION   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION CHANNELS (INFORMATION THEORY); PUBLIC KEY CRYPTOGRAPHY;

COMPUTATIONAL ASSUMPTIONS; DISCRETE LOGARITHMS; HIGH PROBABILITY; QUANTUM MACHINES; QUANTUM PUBLIC KEYS; SUBSET SUM PROBLEMS; TRAPDOOR ONE WAY FUNCTION;

QUANTUM EFFICIENCY;

EID: 84983157038     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44598-6_9     Document Type: Conference Paper

References (39)

1. Barenco, A., Bennett, C. H., Cleve, R., DiVincenzo, D. P., Margolus, N., Shor, P., Sleator, T., Smolin, J., and Weinfurter, H. Elementary Gates for Quantum Computation. Physical Review A 52, 5 (Nov. 1995), 3457-3467.
2. Bellare, M., and Rogaway, P. Entity authentication and key distribution. In Advances in Cryptology-CRYPTO ’93 (22-26 Aug. 1993), D. R. Stinson, Ed., vol. 773 of Lecture Notes in Computer Science, Springer-Verlag, pp. 232-249.
3. Bellare, M., and Rogaway, P. Optimal Asymmetric Encryption-How to Encrypt with RSA. In Advances in Cryptology-EUROCRYPT’94 (1994), pp. 92-111.
4. Bellare, M., Desai, A., Pointcheval, D., and Rogaway, P. Relations among Notions of Security for Public-Key Encryption Schemes. In Advances in Cryptology-CRYPTO’98 (1998), pp. 26-45.
5. Bennett, C. H., Bernstein, E., Brassard, G., and Vazirani, U. Strengths and weaknesses of quantum computing. SIAM J. Comput. 26, 5 (Oct. 1997), 1510-1523.
6. Bennett, C. H., Bessette, F., Brassard, G., Salvail, L., and Smolin, J. Experimental quantum cryptography. Journal of Cryptology 5, 1 (1992), 3-28.
7. Bennett, C. H., and Brassard, G. An update on quantum cryptography. In Advances in Cryptology: Proceedings of CRYPTO 84 (19-22 Aug. 1984), G. R. Blakley and D. Chaum, Eds., vol. 196 of Lecture Notes in Computer Science, Springer-Verlag, 1985, pp. 475-480.
8. Bennett, C. H., Brassard, G., Crépeau, C., and Skubiszewska, M.-H. Practical quantum oblivious transfer. In Advances in Cryptology-CRYPTO ’91 (11-15 Aug. 1991), J. Feigenbaum, Ed., vol. 576 of Lecture Notes in Computer Science, Springer-Verlag, 1992, pp. 351-366.
9. Bennett, C. H., Brassard, G., and Ekert, A. K. Quantum cryptography. Scientific America 262, 10 (Oct. 1992), 26-33.
10. Bennett, C. H., Brassard, G., and Mermin, N. D. Quantum cryptography without Bell’s theorem. Physical Review Letters 68, 5 (Feb. 1992), 557-559.
11. Brassard, G., Lütkenhaus, N., Tal, M., and Sanders, B. C. Security Aspects of Practical Quantum Cryptography. In Advances in Cryptology- EUROCRYPT2000 (2000), pp. 289-299.
12. Brassard, G., and Crépeau, C. Quantum bit commitment and coin tossing protocols. In Advances in Cryptology-CRYPTO ’90 (11-15 Aug. 1990), A. J. Menezes and S. A. Vanstone, Eds., vol. 537 of Lecture Notes in Computer Science, Springer-Verlag, 1991, pp. 49-61.
13. Chor, B., and Rivest, R. L. A knapsack-type public key cryptosystem based on arithmetic in finite fields. IEEE Trans. on Information Theory 34 (1988), 901-909.
14. Cohen, H. A Course in Computational Algebraic Number Theory. Springer, 1993.
15. Cover, T. M. Enumerative source encoding. IEEE Trans. on Information Theory IT-19 (1973), 901-909.
16. Crépeau, C., and Salvail, L. Quantum oblivious mutual identification. In Guillou and Quisquater [26], pp. 133-146.
17. Deutsch, D., and Jozsa, R. Rapid solution of problems by quantum computation. Proc. R. Soc. Lond. A 439 (1992), 553-558.
18. Diffie, W., and Hellman, M. New directions in cryptography. IEEE Trans. on Information Theory IT-22, 6 (1976), 644-654.
19. Dumais, P., Mayers, D., and Savail, L. Perfectly Concealing Quantum Bit Commitment from any Quantum One-Way Permutation. In Advances in Cryptology-EUROCRYPT2000 (2000), pp. 300-315.
20. Fujisaki, E. and Okamoto, T. How to Enhance the Security of Public-Key Encryption at Minimum Cost. In PKC’99 (1999), pp. 53-68.
21. Fujisaki, E. and Okamoto, T. Secure Integration of Asymmetric and Symmetric Encryption Schemes. In Advances in Cryptology-CRYPTO’99 (1999), pp. 537-554.
22. Goldreich, O. On the foundations of modern cryptography. In Advances in Cryptology-CRYPTO ’97 (17-21 Aug. 1997), B. S. Kaliski Jr., Ed., vol. 1294 of Lecture Notes in Computer Science, Springer-Verlag, pp. 46-74.
23. Goldwasser, S., and Micali, S. Probabilistic encryption. J. Comput. Syst. Sci. 28, 2 (Apr. 1984), 270-299.
24. Goldwasser, S., Micali, S., and Rivest, R. L. A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. Comput. 17, 2 (Apr. 1988), 281-308.
25. Grover, L. K. A fast quantum mechanical algorithm for database search. In Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing (Philadelphia, Pennsylvania, 22-24 May 1996), pp. 212-219.
26. Guillou, L. C., and Quisquater, J.-J., Eds. Advances in Cryptology- EUROCRYPT 95 (21-25 May 1995), vol. 921 of Lecture Notes in Computer Science, Springer-Verlag.
27. Lang, S. Algebraic Number Theory, Second Edition, Springer, 1994.
28. Marcus, D. A. Number Fields, Springer, 1977.
29. Mayers, D. Quantum key distribution and string oblivious transfer in noisy channels. In Advances in Cryptology-CRYPTO ’96 (18-22 Aug. 1996), N. Koblitz, Ed., vol. 1109 of Lecture Notes in Computer Science, Springer-Verlag, pp. 343-357.
30. Merkle, R. C., and Hellman, M. E. Hiding information and signatures in trapdoor knapsacks. IEEE Trans. on Information Theory 24 (1978), 525-530.
31. Morii, M., and Kasahara, M. New Public Key Cryptosystem Using Discrete Logarithms over GF(p). Trans. of the IEICE J71-D, 2 (Feb. 1988), 448-453 (In Japanese).
32. Naccache, D., and Stern, J. A New Public-Key Cryptosystem. In Advances in Cryptology-EUROCRYPT’97 (1997), pp. 27-36.
33. Odlyzko, A. M. Cryptanalytic attacks on the multiplicative knapsack cryptosystem and on Shamir’s fast signature scheme. IEEE Trans. on Information Theory IT-30 (1984), 594-601.
34. Okamoto, T., and Tanaka, K. A New Approach to Knapsack Cryptosystems. manuscript (2000).
35. Orton, G. A Multiple-Iterated Trapdoor for Dense Compact Knapsacks. In Advances in Cryptology-EUROCRYPT’94 (1994), pp. 112-130.
36. Schnorr, C. P., and Hörner, H. H. Attacking the Chor-Rivest cryptosystem by improved lattice reduction. In Guillou and Quisquater [26], pp. 1-12.
37. Shor, P. W. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26, 5 (Oct. 1997), 1484-1509.
38. Simon, D. R. On the power of quantum computation. SIAM J. Comput. 26, 5 (Oct. 1997), 1474-1483.
39. Vaudenay, S. Cryptanalysis of the Chor-Rivest cryptosystem. In Advances in Cryptology-CRYPTO’98 (1998), pp. 243-256.