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

DOI10.1016/j.camwa.2010.02.008zbMath1193.14033arXiv0804.1652OpenAlexW2070274599MaRDI QIDQ988264

Elisavet Konstantinou, Aristides I. Kontogeorgis

Publication date: 26 August 2010

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

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

zbMATH Keywords

complex multiplicationclass polynomialsgeneration of elliptic curves

Mathematics Subject Classification ID

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

Related Items (4)

ON DISCRIMINANTS OF MINIMAL POLYNOMIALS OF THE RAMANUJAN CLASS INVARIANTS ⋮ Constructing class invariants ⋮ Revisiting the Complex Multiplication Method for the Construction of Elliptic Curves ⋮ RAMANUJAN INVARIANTS FOR DISCRIMINANTS CONGRUENT TO 5 (mod 24)

Uses Software

• PARI/GP
• ECPP

Cites Work

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

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