Ramanujan's class invariants and their use in elliptic curve cryptography

DOI10.1016/J.CAMWA.2010.02.008zbMATH Open1193.14033arXiv0804.1652OpenAlexW2070274599MaRDI QIDQ988264FDOQ988264

Authors: Elisavet Konstantinou, Aristides Kontogeorgis 

Publication date: 26 August 2010

Published in: Computers & Mathematics with Applications (Search for Journal in Brave)

Abstract: In this paper, we propose the use of Ramanujan class of polynomials for the construction of prime order elliptic curves using the CM-method. We compare (theoretically and experimentally) the efficiency of using this new class against the use of the Weber, $M_{D,l}(x)$ and $M_{D,p_1,p_2}(x)$ polynomials and show that they clearly outweigh all of them in the generation of prime order elliptic curves.

Full work available at URL: https://arxiv.org/abs/0804.1652

Recommendations

• On the efficient generation of prime-order elliptic curves
• Revisiting the complex multiplication method for the construction of elliptic curves
• Accelerating the CM method
• Progress in Cryptology - INDOCRYPT 2003
• Generating Prime Order Elliptic Curves: Difficulties and Efficiency Considerations

zbMATH Keywords

complex multiplicationclass polynomialsgeneration of elliptic curves

Mathematics Subject Classification ID

Cryptography (94A60) Complex multiplication and moduli of abelian varieties (11G15) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Class numbers, class groups, discriminants (11R29) Applications to coding theory and cryptography of arithmetic geometry (14G50) Elliptic curves (14H52)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• Handbook of Elliptic and Hyperelliptic Curve Cryptography
• Factoring Polynomials Over Large Finite Fields
• Title not available (Why is that?)
• Reducing elliptic curve logarithms to logarithms in a finite field
• Title not available (Why is that?)
• Title not available (Why is that?)
• Counting points on elliptic curves over finite fields
• Selberg's eigenvalue conjecture.
• Weber's class invariants revisited
• Class invariants by Shimura's reciprocity law
• Elliptic Curves and Primality Proving
• Title not available (Why is that?)
• A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
• Title not available (Why is that?)
• Ramanujan and the Modular j-Invariant
• Constructing elliptic curves of prime order
• Constructing elliptic curves over finite fields using double eta-quotients
• Modular curves of composite level
• Title not available (Why is that?)
• Generating more MNT elliptic curves
• Computing Polynomials of the Ramanujan t_n Class Invariants
• Title not available (Why is that?)
• A comparison of MNT curves and supersingular curves
• Title not available (Why is that?)
• Choosing the correct elliptic curve in the CM method
• A Method for Distinguishing the Two Candidate Elliptic Curves in CM Method

Cited In (7)

• Class invariants by the CRT method
• RAMANUJAN INVARIANTS FOR DISCRIMINANTS CONGRUENT TO 5 (mod 24)
• Revisiting the complex multiplication method for the construction of elliptic curves
• ON DISCRIMINANTS OF MINIMAL POLYNOMIALS OF THE RAMANUJAN CLASS INVARIANTS
• Title not available (Why is that?)
• A rapid procedure of creating elliptic curves applying to cryptography
• Constructing class invariants

Uses Software

• PARI/GP
• ECPP

This page was built for publication: Ramanujan's class invariants and their use in elliptic curve cryptography

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q988264)