A cryptosystem based on non-maximal imaginary quadratic orders with fast decryption

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

Volumn 1403, Issue , 1998, Pages 294-307

  Hühnlein, Detlef ^a   Jacobson, Michael J ^b   Paulus, Sachar ^b   Takagi, Tsuyoshi ^c  

^a Westfälische Hochschule und secunet Security Networks AG   (Germany)

^b DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

^c NTT CORPORATION   (Japan)

Author keywords

Factorization; Imaginary quadratic order; Key escrow; Public key cryptosystem; Trapdoor decryption

Indexed keywords

CODES (SYMBOLS); COMPUTATION THEORY; FACTORIZATION; PUBLIC KEY CRYPTOGRAPHY;

CLASS GROUP; DISCRETE LOGARITHMS; IMAGINARY QUADRATIC ORDER; KEY ESCROW; PUBLIC KEY CRYPTOSYSTEMS; QUADRATIC FIELDS; SIGNATURE SCHEME; TRAPDOOR DECRYPTION;

CRYPTOGRAPHY;

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

References (26)

1. I. Biehl, J. Buchmann, and T. Papanikolaou. LiDIA - A library for computational number theory. The LiDIA Group, Universität des Saarlandes, Saarbrücken, Germany, 1995.
2. Z.I. Borevich and I.R. Shafarevich. Number Theory. Academic Press, New York, 1966.
3. J. Buchmann and S. Diillmann. On the computation of discrete logarithms in class groups. In Advances in Cryptology - CRYPTO ’90, volume 537 of Lecture Notes in Computer Science, pages 134-139, 1991.
4. J. Buchmann, S. Düllmann, and H.C. Williams. On the complexity and efficiency of a new key exchange system. In Advances in Cryptology - EUROCRYPT ’89, volume 434 of Lecture Notes in Computer Science, pages 597-616, 1990.
5. J. Buchmann and H.C. Williams. A key-exchange system based on imaginary quadratic fields. Journal of Cryptology, 1:107-118, 1988.
6. J.P. Buhler, H.W. Lenstra, Jr., and C. Pomerance. Factoring integers with the number fields sieve. In A.K. Lenstra and H.W. Lenstra, Jr., editors, The Developement of the Number Field Sieve, volume 1554 of Lecture Notes in Math., pages 50-94. Springer, Berlin, 1993.
7. H. Cohen. A Course in Computational Algebraic Number Theory. Springer-Verlag, Berlin, 1993.
8. 2. John Wiley & Sons, New York, 1989.
9. W. Diffie and M. Heilman. New directions in cryptography. IEEE Transactions on Information Theory, 22:472-492, 1976.
10. S. Düllmann. Ein Algorithmus zur Bestimmung der Klassengruppe positiv definiter binärer quadratischer Formen. PhD thesis, Universität des Saarlandes, Saarbrücken, Germany, 1991.
11. T. El Gamal. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory, 31:469-472, 1985.
12. J.L. Hafner and K.S. McCurley. A rigorous subexpoential algorithm for computation of class groups. J. Amer. Math. Soc., 2:837-850, 1989.
13. L.K. Hua. Introduction to Number Theory. Springer-Verlag, New York, 1982.
14. M.J. Jacobson, Jr. Applying sieving to the computation of quadratic class groups. To appear in Math. Comp., 1997.
15. N. Koblitz. Elliptic curve cryptosystems. Math. Comp., 48:203-209, 1987.
16. N. Koblitz. Hyperelliptic cryptosystems. Journal of Cryptology, 1:139-150, 1989.
17. H.W. Lenstra, Jr. Factoring integers with elliptic curves. Annals of Math. (2), 126:649-673, 1987.
18. K.S. McCurley. Cryptographic key distribution and computation in class groups. In R.A. Mollin, editor, Proc. NATO ASI on Number Theory and Applications, pages 459-479. Kluwer Academic Press, 1989.
19. K.S. McCurley. A key distribution system equivalent to factoring. Journal of Cryptology, 1:95-105, 1989.
20. V. Miller. Use of elliptic curves in cryptography. In Advances in Cryptology - CRYPTO ’85, volume 218 of Lecture Notes in Computer Science, pages 417-426, 1986.
21. J. Neukirch. Algebraische Zahlentheorie. Springer, Berlin, 1992.
22. K. Nyberg and R. Rüppel. A new signature scheme based on the DSA giving message recovery. In 1st ACM Conference on Computer and Communications Security, Fairfax, Virginia, Nov. 3-5, 1993.
23. National Institute of Standards and Technology (NIST). Digital signature standard (DSS). Federal Information Processing Standards Publication, 186, May 19, 1994.
24. C. Pomerance. Analysis and comparison of some integer factoring algorithms. In H.W. Lenstra, Jr. and R. Tijdeman, editors, Computational Methods in Number Theory, pages 89-139. Math. Centre Tracts, Amsterdam, 1983. Number 154, Part I.
25. R.J. Schoof. Quadratic fields and factorization. In H.W. Lenstra, Jr. and R. Tijdeman, editors, Computational Methods in Number Theory, pages 235-286. Math. Centre Tracts, Amsterdam, 1983. Number 155, Part II.
26. D. Shanks. On Gauss and composition I, II. In R.A. Mollin, editor, Proc. NATO ASI on Number Theory and Applications, pages 163-179. Kluwer Academic Press, 1989.