On the efficient generation of prime-order elliptic curves

DOI10.1007/s00145-009-9037-2zbMath1195.94063OpenAlexW1992016658MaRDI QIDQ5962222

Yannis C. Stamatiou, Elisavet Konstantinou, Christos D. Zaroliagis, Aristides I. Kontogeorgis

Publication date: 21 September 2010

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-009-9037-2

zbMATH Keywords

complex multiplicationpublic key cryptographyelliptic curve cryptosystemsprime-orderWeber polynomials

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Elliptic curves (14H52)

Related Items (2)

On Random Number Generation for Kernel Applications ⋮ Unnamed Item

Uses Software

• gmp
• LiDIA
• ECPP

Cites Work

• Computing the cardinality of CM elliptic curves using torsion points
• Weber's class invariants revisited
• Counting points on elliptic curves over finite fields
• Generating more MNT elliptic curves
• Elliptic Curves and Primality Proving
• The Probability that the Number of Points on an Elliptic Curve over a Finite Field is Prime
• 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
• Modular curves of composite level
• Progress in Cryptology - INDOCRYPT 2003
• Generating Prime Order Elliptic Curves: Difficulties and Efficiency Considerations
• Factoring Polynomials Over Large Finite Fields
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the efficient generation of prime-order elliptic curves