Nice – New ideal coset encryption

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

Volumn 1717, Issue , 1999, Pages 328-339

  Hartmann, Michael ^a   Paulus, Sachar ^b   Takagi, Tsuyoshi ^c  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

^b SECUDE Sicherheitstechnologie Informationssysteme GmbH   (Germany)

^c NTT Information Sharing Platform Laboratories   (Germany)

Author keywords

Fast decryption; Public key cryptosystem; Quadratic order; Smart card implementation

Indexed keywords

PUBLIC KEY CRYPTOGRAPHY; SMART CARDS;

ARITHMETICAL OPERATIONS; FAST DECRYPTION; FAST IMPLEMENTATION; PUBLIC KEY CRYPTOSYSTEMS; QUADRATIC ORDER; RSA CRYPTOSYSTEMS; SMART CARD IMPLEMENTATION; SOFTWARE IMPLEMENTATION;

EMBEDDED SYSTEMS;

EID: 84949508476     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48059-5_28     Document Type: Conference Paper

References (21)

1. L. M. Adleman and K. S. McCurley, "Open problems in number theoretic complexity, II" proceedings of ANTS-I, LNCS 877, (1994), pp.291-322.
2. I. Biehl, J. Buchmann, and T. Papanikolaou. LiDIA - A library for computational number theory. The LiDIA Group, Universitat des Saarlandes, Saarbrucken, Germany, 1995.
3. I. Biehl and J. Buchmann; "An analysis of the reduction algorithms for binary quadratic forms," Technical Report No. TI-26/97, Technische Universitat Darmstadt, (1997).
4. I. Biehl and S. Paulus and T. Takagi, "Efficient Undeniable Signature Schemes based on Ideal Arithmetic in Quadratic Orders," in preparation.
5. J. Buchmann and H. C. Williams; "A key-exchange system based on imaginary quadratic fields," Journal of Cryptology, 1, (1988), pp.107-118.
6. J. Buchmann and H. C. Williams; "Quadratic fields and cryptography," London Math. Soc. Lecture Note Series 154, (1990), pp.9-26.
7. 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.
8. J. Cowie, B. Dodson, R. Elkenbracht-Huizing, A. K. Lenstra, P. L. Montgomery, J. Zayer; "A world wide number field sieve factoring record: on to 512 bits," Advances in Cryptology - ASIACRYPT '96, LNCS 1163, (1996), pp.382-394.
9. 2, John Wiley & Sons, New York, 1989
10. W. Dime and M. Hellman, "New direction in cryptography," IEEE Transactions on Information Theory, 22, (1976), pp.472-492.
11. ECMNET Project; http://www.loria.fr/~zimmerma/records/ecmnet.html
12. T. ElGamal, "A public key cryptosystem and a signature scheme based on discrete logarithm in GF(p)," IEEE Transactions on Information Theory, 31, (1985), pp.469-472.
13. D. Huhnlein, 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, (1998), pp.294-307.
14. H. W. Lenstra, Jr., "Factoring integers with elliptic curves", Annals of Mathematics, 126, (1987), pp.649-673.
15. A. K. Lenstra and H. W. Lenstra Jr. (Eds.), The development of the number field sieve. Lecture Notes in Mathematics, 1554, Springer, (1991).
16. A. J. Menezes, P. van Oorschot, S. Vastone: Handbook of applied crytpography. CRC Press, 1996.
17. T. Okamoto and S. Uchiyama, "A new public-key cryptosystem as secure as factoring," Advances in Cryptology - EUROCRYPT '98, LNCS 1403, (1998), pp.308-318.
18. S. Paulus and T. Takagi, "A new public-key cryptosystem over the quadratic order with quadratic decryption time," to appear in Journal of Cryptology.
19. S. Paulus and T. Takagi, "A generalization of the Diffie-Hellman problem based on the coset problem allowing fast decryption," Proceedings of ICISC'98, Seoul, Korea, 1998.
20. R. Peralta and E. Okamoto, "Faster factoring of integers of a special form," IEICE Trans. Fundamentals, Vol.E79-A, No.4, (1996), pp.489-493.
21. R. J. Schoof: Quadratic Fields and Factorization. In: H.W. Lenstra, R. Tijdeman, (eds.): Computational Methods in Number Theory. Math. Centrum Tracts 155. Part II. Amsterdam, 1983. pp. 235-286.