Abstract
We propose a mathematical problem, and show how to solve it elegantly. This problem is related with elliptic curve cryptosystems (ECC). The solving methods can be applied to a new paradigm of key generations of the ECC.
Chapter PDF
References
Koyama, K., Kunihiro, N., Tsuruoka, Y.: Modulus Searching Methods for Secure Elliptic Curve Cryptosystems. In: Proc. of 1999 Symposium on Cryptography and Information Security (SCIS 1999), pp. 863–868 (1999)
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
Koyama, K., Tsuruoka, Y., Kunihiro, N. (1999). Modulus Search for Elliptic Curve Cryptosystems. In: Lam, KY., Okamoto, E., Xing, C. (eds) Advances in Cryptology - ASIACRYPT’99. ASIACRYPT 1999. Lecture Notes in Computer Science, vol 1716. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-48000-6_1
Download citation
DOI: https://doi.org/10.1007/978-3-540-48000-6_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66666-0
Online ISBN: 978-3-540-48000-6
eBook Packages: Springer Book Archive