Ramanujan's class invariants and their use in elliptic curve cryptography
From MaRDI portal
Publication:988264
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)
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, and polynomials and show that they clearly outweigh all of them in the generation of prime order elliptic curves.
Recommendations
Cites Work
- scientific article; zbMATH DE number 435565 (Why is no real title available?)
- scientific article; zbMATH DE number 3937328 (Why is no real title available?)
- scientific article; zbMATH DE number 4083758 (Why is no real title available?)
- scientific article; zbMATH DE number 1186963 (Why is no real title available?)
- scientific article; zbMATH DE number 45834 (Why is no real title available?)
- scientific article; zbMATH DE number 1221897 (Why is no real title available?)
- scientific article; zbMATH DE number 1349933 (Why is no real title available?)
- scientific article; zbMATH DE number 1955467 (Why is no real title available?)
- scientific article; zbMATH DE number 1466163 (Why is no real title available?)
- scientific article; zbMATH DE number 2086890 (Why is no real title available?)
- scientific article; zbMATH DE number 799785 (Why is no real title available?)
- scientific article; zbMATH DE number 3224518 (Why is no real title available?)
- A Method for Distinguishing the Two Candidate Elliptic Curves in CM Method
- A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
- A comparison of MNT curves and supersingular curves
- An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
- Choosing the correct elliptic curve in the CM method
- Class invariants by Shimura's reciprocity law
- Computing Polynomials of the Ramanujan tn Class Invariants
- Constructing elliptic curves of prime order
- Constructing elliptic curves over finite fields using double eta-quotients
- Counting points on elliptic curves over finite fields
- Elliptic Curves and Primality Proving
- Factoring Polynomials Over Large Finite Fields
- Generating more MNT elliptic curves
- Handbook of Elliptic and Hyperelliptic Curve Cryptography
- Modular curves of composite level
- Ramanujan and the Modular j-Invariant
- Reducing elliptic curve logarithms to logarithms in a finite field
- Selberg's eigenvalue conjecture.
- Weber's class invariants revisited
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 no real title available?)
- A rapid procedure of creating elliptic curves applying to cryptography
- Constructing class invariants
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)