Abstract
Recently, a novel public-key cryptosystem constructed on number fields is presented. The prominent theoretical property of the public-key cryptosystem is a quadratic decryption bit complexity of the public key, which consists of only simple fast arithmetical operations. We call the cryptosystem NICE (New Ideal Coset Encryption). In this paper, we consider practical aspects of the NICE cryptosystem. Our implementation in software shows that the decryption time of NICE is comparably as fast as the encryption time of the RSA cryptosystem with e = 216+1. To show if existing smart cards can be used, we implemented the NICE cryptosystem using a smart card designed for the RSA cryptosystem. Our result shows that the decryption time of NICE is comparably as fast as the decryption time of RSA cryptosystem but not so fast as in software implementation. We discuss the reasons for this and indicate requirements for smartcard designers to achieve fast implementation on smartcards.
Acknowledgements
We thank Deutsche Telekom AG, Produktzentrum Telesec for letting us testing NICE on the hardware simulator and Siemens AG/Infineon GmbH for their valuable help concerning the use of the development kit as well as running our code on their hardware simulator.
Chapter PDF
References
L. M. Adleman and K. S. McCurley, “Open problems in number theoretic complexity, II” proceedings of ANTS-I, LNCS 877, (1994), pp.291–322.
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.
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, (1997).
I. Biehl and S. Paulus and T. Takagi, “Efficient Undeniable Signature Schemes based on Ideal Arithmetic in Quadratic Orders,” in preparation.
J. Buchmann and H. C. Williams; “A key-exchange system based on imaginary quadratic fields,” Journal of Cryptology, 1, (1988), pp.107–118.
J. Buchmann and H. C. Williams; “Quadratic fields and cryptography,” London Math. Soc. Lecture Note Series 154, (1990), pp.9–26.
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.
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.
D. A. Cox: Primes of the form x 2 + ny2, John Wiley & Sons, New York, 1989
W. Diffie and M. Hellman, “New direction in cryptography,” IEEE Transactions on Information Theory, 22, (1976), pp.472–492.
ECMNET Project; http://www.loria.fr/çzimmerma/records/ecmnet.html
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.
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, (1998), pp.294–307.
H. W. Lenstra, Jr., “Factoring integers with elliptic curves”, Annals of Mathematics, 126, (1987), pp.649–673.
A. K. Lenstra and H. W. Lenstra, Jr. (Eds.), The development of the number field sieve. Lecture Notes in Mathematics, 1554, Springer, (1991).
A. J. Menezes, P. van Oorschot, S. Vastone: Handbook of applied crytpography. CRC Press, 1996.
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.
S. Paulus and T. Takagi, “A new public-key cryptosystem over the quadratic order with quadratic decryption time,” to appear in Journal of Cryptology.
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.
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.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hartmann, M., Paulus, S., Takagi, T. (1999). NICE - New Ideal Coset Encryption -. In: Koç, Ç.K., Paar, C. (eds) Cryptographic Hardware and Embedded Systems. CHES 1999. Lecture Notes in Computer Science, vol 1717. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48059-5_28
Download citation
DOI: https://doi.org/10.1007/3-540-48059-5_28
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66646-2
Online ISBN: 978-3-540-48059-4
eBook Packages: Springer Book Archive