A new public-key cryptosystem as secure as factoring

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

Volumn 1403, Issue , 1998, Pages 308-318

  Okamoto, Tatsuaki ^a   Uchiyama, Shigenori ^a  

^a NTT CORPORATION   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

PUBLIC KEY CRYPTOGRAPHY; SECURITY OF DATA;

ELLIPTIC CURVE CRYPTOSYSTEMS; ENCRYPTION AND DECRYPTION; HOMOMORPHIC PROPERTY; PASSIVE ADVERSARY; PROBABILISTIC ENCRYPTION; PROVABLY SECURE; PUBLIC KEY CRYPTOSYSTEMS; QUADRATIC RESIDUES;

CRYPTOGRAPHY;

EID: 84956852274     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0054135     Document Type: Conference Paper

References (39)

1. Adleman, L.M. and McCurley, K.S.: Open Problems in Number Theoretic Complexity,II (open problems: C7, 07a and 07b), Proc. Of ANTS-I, LNCS 877, Springer-Verlag, pp.291-322 (1995).
2. Ajtai, M. and Dwork, C.: A Public-Key Cryptosystem with Worst-Case/Average-Case Equivalence, Proc. Of STOC’97, pp. 284-293 (1997).
3. Alexi, W., Chor, B.Z., Goldreich, O. and Schnorr, C.P.: RSA and Rabin Functions: Certain Parts Are as Hard as the Whole, SIAM Journal of Computing, 17, 2, pp.449-457(1988).
4. Bellare, M. and Rogaway, P.: Optimal Asymmetric Encryption, Proc. Of Eurocrypt’94, LNCS 950, Springer-Verlag pp.92-111 (1995).
5. Blum, M. and Goldwasser, S.: An efficient probabilistic public-key encryption scheme which hides all partial information, Proc. Of Crypto’84, LNCS 196, Springer-Verlag, pp.289-299 (1985).
6. Chao, J., Matsuda, N. and Tsujii, S.: Efficient construction of secure hyperelliptic discrete logarithm problems, Proc. Of ICICS’97, LNCS 1334, Springer-Verlag, pp.292-301 (1997).
7. Chor, B. and Rivest, R.L.: A knapsack type public key cryptosystem based on arithmetic in finite fields, Proc. Of Crypto’84, LNCS 196, Springer-Verlag, pp.54-65 (1985).
8. Cohen, J. and Fischer.: A Robust and Verifiable Cryptographically Secure Election Scheme, FOCS, pp.372-382 (1985).
9. Dolev, D., Dwork, C. and Naor, M.: Non-Malleable Cryptography, Proc. Of STOC, pp.542-552 (1991).
10. Demytko, N.: A New Elliptic Curve Based Analogue of RSA, Proc. Of Eurocrypt’93, LNCS 765, Springer-Verlag, pp.40-49 (1994).
11. Diffie, W. and Heilman, M.: New Directions in Cryptography, IEEE Trans, on Information Theory, IT-22, 6, pp.644-654 (1976).
12. ElGamal, T.: A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms, IEEE Trans, on Information Theory, IT-31, 4, pp.469-472 (1985).
13. Goldwasser, S. and Bellare, M: Lecture Notes on Cryptography, http://www. cse.ucsd.edu/users/mihir/ (1997).
14. Goldwasser, S. and Micali, S.: Probabilistic Encryption, JCSS, 28, 2, pp.270-299 (1984).
15. Hastad, J., Schrift, A.W. and Shamir, A.: The Discrete Logarithm Modulo a Composite Hides O(n) Bits, J. of Computer and System Sciences, 47, pp.376-404 (1993).
16. Knuth, D.E.: The Art of Computer Programming, Addison-Wesley Publishing Co.,(1981).
17. Koblitz, N.: Elliptic Curve Cryptosystems, Math. Comp., 48, 177, pp.203-209 (1987).
18. Koyama, K., Maurer, U. M., Okamoto, T. and Vanstone, S. A.,: New Public-key Schemes based on Elliptic Curves over the Ring Zn, Proc. Of Crypto’91, LNCS 576, Springer-Verlag, pp.252-266 (1992).
19. Kurosawa, K., Ito, T. and Takeuchi, M.: Public Key Cryptosystem using a Reciprocal Number with the same Intractability as Factoring a Large Number, Cryptologia, 12, 4, pp.225-233 (1988).
20. Loxton, J.H., Khoo, D.S.P., Bird, G.J. and Seberry, J.: A Cubic RSA Code Equivalent to Factorization, Journal of Cryptology, 5, 2, pp.139-150 (1992).
21. Matsumoto, T. and Imai, H.: Public Quadratic Polynomial-Tuples for Efficient Signature-Verification and Message-Encryption, Proc. Of Eurocrypt’88, LNCS 330, Springer-Verlag, pp.419-453 (1988).
22. McEliece, R.J.: A Public-Key Cryptosystem Based on Algebraic Coding Theory, DSN progress report 42-44, Jet Propulsion Laboratories, Pasadena (1978).
23. Merkle, R.C. and Heilman, M.E.: Hiding Information and Signatures in Trapdoor Knapsacks, IEEE Trans, on Inform. Theory, 24, pp.525-530 (1978).
24. Micali, S., Rackoff, C. and Sloan, B.: The notion of security for probabilistic cryptosystems, SIAM Journal on Computing, 17, 2, pp.412-426 (1988).
25. Miller, V.S.: Use of Elliptic Curves in Cryptography, Proc. Of Crypto’85, LNCS 218, Springer-Verlag, pp.417-426 (1985).
26. Naccache, D. and Stern, J.: A New Public-Key Cryptosystem, Proc. Of Eurocrypt’97, LNCS 1233, Springer-Verlag, pp.27-436 (1997).
27. Okamoto, T. and Uchiyama, S.: Individual Bit Security of a New Public-Key Cryptosystem, Manuscript (1998).
28. Patarin, J. and Goubin, L.: Trapdoor one-way permutations and multivariate polynomials, Proc. Of ICICS’97, LNCS 1334, Springer-Verlag, pp.356-368 (1997).
29. Patarin, J. and Goubin, L.: Asymmetric cryptography with S-Boxes, Proc. Of ICICS’97, LNCS 1334, Springer-Verlag, pp.369-380 (1997).
30. 2 (private communication) (1997).
31. Peralta, R. and Okamoto, E.: Faster Factoring of Integers of a Special Form, IEICE Trans. Fundamentals, E79-A, 4, pp.489-493 (1996).
32. Pointcheval, D. and Stern, J.: Security Proofs for Signature Schemes, Proc. Of Eurocrypt’96, LNCS 1070, Springer-Verlag, pp.387-398 (1996).
33. Pollard, J.L.: Manuscript (1997).
34. Rabin, M.O.: Digital Signatures and Public-Key Encryptions as Intractable as Factorization, MIT, Technical Report, MIT/LCS/TR-212 (1979).
35. Rivest, R., Shamir, A. and Adleman, L.: A Method for Obtaining Digital Signatures and Public-Key Cryptosystems, Communications of the ACM, Vol.21, No.2, pp.120-126 (1978).
36. Smith, P. and Lennon, M.: LUC: A New Public Key System, Proc. Of IFIP/SEC’93, pp. 103-117, North-Holland (1993).
37. Tsiounis, Y. and Yung, M.: On the Security of ElGamal-based encryption, to appear in Proc. Of PKC’98, LNCS, Springer-Verlag.
38. Williams, H.C.: A Modification of the RSA Public Key Encryption Procedure, IEEE Trans, on Inform. Theory, IT-26, 6, pp.726-729 (1980).
39. Williams, H.C.: Some Public-Key Crypto-Functions as Intractable as Factorization, Proc. Of Crypto’84, LNCS 196, Springer-Verlag, pp.66-70 (1985).