A new public-key cryptosystem over a quadratic order with quadratic decryption time

Journal of Cryptology

Volumn 13, Issue 2, 2000, Pages 263-272

  Paulus, Sachar ^a   Takagi, Tsuyoshi ^b  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

^b NTT CORPORATION   (Japan)

Author keywords

Chosen ciphertext attack; Factoring algorithm; Fast decryption; Public key cryptosystem; Quadratic order

Indexed keywords

EID: 0842327115     PISSN: 09332790     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001459910010     Document Type: Article

References (26)

1. L. M. Adleman and K. S. McCurley; Open problems in number theoretic complexity, II Proceedings of ANTS-I, LNCS 877, Springer-Verlag, Berlin (1994), pp. 291-322.
2. I. Biehl and J. Buchmann; An analysis of the reduction algorithms for binary quadratic forms, Technical Report No. TI-26/97, Technische Universität Darmstadt, Darmstadt (1997).
3. I. Biehl, J. Buchmann, and T. Papanikolaou; LiDIA-A Library for Computational Number Theory, The LiDIA Group, Universität des Saarlandes, Saarbrücken (1995).
4. J. Buchmann, S. Düllmann, and H. C. Williams; On the complexity and efficiency of a new key exchange system, Ad vances in Cryptology-EUROCRYPT '89, LNCS 434, Springer-Verlag, Berlin (1990), pp. 597-616.
5. J. Buchmann and H. C. Williams; A key-exchange system based on imaginary quadratic fields, Journal ofCryptology, 1 (1988), 107-118.
6. J. Buchmann and H. C. Williams; Quadratic fields and cryptography, London Mathematical Society Lecture Note Series 154, Cambridge University Press, Cambridge (1990), pp. 9-26.
7. J. Cowie, B. Dodson, R. Elkenbracht-Huizing, A. K. Lenstra, P. L. Montgomery, and J. Zayer; A world wide number field sieve factoring record on to 512 bits. Advances in Cryptology - ASIACRYPT '96, LNCS 1163, Springer-Verlag, Berlin (1996), pp. 382-394.
8. D. A. Cox; Primes of the Form x2 + ny2, Wiley, New York (1989).
9. W. Diffie and M. Hellman; New directions in cryptography, IEEE Transactions on Information Tlieory, 22 (1976), 472-492.
10. ECMNET Project; http//www.loria.fr/-zimmerma/records/ecninet.html.
11. T. ElGamal; A public key cryptosystem and a signature scheme based on discrete logarithm in GF(p), IEEE Transactions on Information Theory, 31 (1985), 469-472.
12. H. Gilbert, D. Gupta, A. M. Odlyzko, and J.-J. Quisquater; Attacks on Shamir's RSA for paranoids, Preprint, http //www. research.att.com/-amo/doc/recent.html.
13. J. L. Hafner and K. S. McCurley; A rigorous subexponential algorithm for computation of class groups, Journal of the American Mathematical Society, 2 (1989), 837-850.
14. D. Hühnlein, M. J. Jacobson, Jr., S. Paulus, and T. Takagi; A cryptosystem based on non-maximal imaginary quadratic orders with fast decryption. Advances in Cryptology - EUROCRYPT '98, LNCS 1403, Springer-Verlag, Berlin (1998), pp. 294-307.
15. H. W. Lenstra, Jr.; Factoring integers with elliptic curves, Annals of Mathematics, 126 (1987), 649-673.
16. A. K. Lenstra and H. W. Lenstra, Jr. (eds.); The Development of the Number Field Sieve, Lecture Notes in Mathematics 1554, Springer-Verlag, Berlin (1991).
17. K. S. McCurley; A key distribution system equivalent to factoring. Journal of Cryptology, 1 (1988), 95-105.
18. A. J. Menezes, P. C. van Oorschot, and S. A. Vanstone; Handbook of Applied Cryptography, CRC Press, Boca Raton, FL (1996).
19. T. Okamoto; A fast signature scheme based on congruential polynomial operations, IEEE Transactions on Information Tlieory, IT-36 (1990), 47-53.
20. T. Okamoto and S. Uchiyama; A new public key cryptosystem as secure as factoring. Advances in Cryptology-EUROCRYPT '98, LNCS 1403, Springer-Verlag, Berlin (1998), pp. 308-318.
21. R. Peralta and E. Okamoto; Faster factoring of integers of a special form, IEICE Transactions Fundamentals, E79-A(4) (1996), 489-493.
22. R. Rivest, A. Shamir, and L. M. Adleman; A method for obtaining digital signatures and public key cryptosystems, Communications of the ACM, 21(2) (1978), 120-126.
23. R. Rivest and R. D. Silverman; Are strong primes needed for RSA, The 1997 RSA Laboratories Seminar Series, Seminars Proceedings (1997).
24. R. J. Schoof; Quadratic fields and factorization, in H. W. Lenstra and R. Tljdeman (eds.) Computational Methods in Number Theory, Math. Centrum Tracts 155, Part II, Amsterdam, (1983), pp. 235-286.
25. A. Shamir; RSA for paranoids, CiyptoBytes, 1(3) (1995).
26. D. Shanks; On Gauss and composition I, II, in R. A. Mollin, (ed.), Proc. NATO ASI on Number Theory and Applications, Kluwer Academic, Dordrecht (1989), pp. 163-179.