Abstract
We present an implementation that turns out to be most efficient in practice to compute singular moduli within a fixed floating point precision. First, we show how to efficiently determine the Fourier coefficients of the modular function j and related functions γ2, f2, and η. Comparing several alternative methods for computing singular moduli, we show that in practice the computation via the η-function turns out to be the most efficient one. An important application with respect to cryptography is that we can speed up the generation of cryptographically strong elliptic curves using the Complex Multiplication Approach.
supported by FairPay, a project funded by the German Department of Trade and Industry
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
A.O.L. Atkin and F. Morain. Elliptic curves and primality proving. Mathematics of Computation, 61:29–67, 1993.
H. Baier. Efficient Computation of Fourier Series and Singular Moduli with Application in Cryptography. Technical Report, Darmstadt University of Technology, 2001.
H. Baier and J. Buchmann. Efficient Construction of Cryptographically Strong Elliptic Curves. In Progress in Cryptology-INDOCRYPT2000, LNCS 1977, pages 191–202, Berlin, 2000. Springer-Verlag.
Geeignete Kryptoalgorithmen gemäß §17(2) SigV, April 2000. Bundesamt für Sicherheit in der Informationstechnik.
D. Cox. Primes of the form x 2 + ny 2. John Wiley & Sons, 1989.
M. Kaneko. Traces of singular moduli and the Fourier coefficients of the elliptic modular function j(τ). private communicated.
N. Koblitz. Introduction to Elliptic Curves and Modular Forms. Springer-Verlag, 1993.
LiDIA. A library for computational number theory. Darmstadt University of Technology. URL: http://www.informatik.tu-darmstadt.de/TI/LiDIA/Welcome.html.
G.-J. Lay and H.G. Zimmer. Constructing elliptic curves with given group order over large finite fields. In Proceedings of ANTS I, LNCS 877, pages 250–263, 1994.
K. Mahler. On a class of non-linear functional equations connected with modular functions. Journal of the Australian Mathematical Society, 22, Series A:65–120, 1976.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baier, H. (2001). Efficient Computation of Singular Moduli with Application in Cryptography. In: Freivalds, R. (eds) Fundamentals of Computation Theory. FCT 2001. Lecture Notes in Computer Science, vol 2138. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44669-9_9
Download citation
DOI: https://doi.org/10.1007/3-540-44669-9_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42487-1
Online ISBN: 978-3-540-44669-9
eBook Packages: Springer Book Archive