On the efficient generation of prime-order elliptic curves

DOI10.1007/S00145-009-9037-2zbMATH Open1195.94063OpenAlexW1992016658MaRDI QIDQ5962222FDOQ5962222

Yannis C. Stamatiou, Elisavet Konstantinou, Christos Zaroliagis, Aristides 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 cryptosystemsWeber polynomialsprime-order

Mathematics Subject Classification ID

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

Cites Work

• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• Factoring Polynomials Over Large Finite Fields
• Reducing elliptic curve logarithms to logarithms in a finite field
• Counting points on elliptic curves over finite fields
• The Probability that the Number of Points on an Elliptic Curve over a Finite Field is Prime
• Weber's class invariants revisited
• Elliptic Curves and Primality Proving
• A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
• Modular curves of composite level
• Generating more MNT elliptic curves
• Computing the cardinality of CM elliptic curves using torsion points
• Progress in Cryptology - INDOCRYPT 2003
• Generating Prime Order Elliptic Curves: Difficulties and Efficiency Considerations
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (4)

• On Random Number Generation for Kernel Applications
• Title not available (Why is that?)
• Generating Prime Order Elliptic Curves: Difficulties and Efficiency Considerations
• Title not available (Why is that?)

Uses Software

• gmp
• LiDIA
• ECPP

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Constructing elliptic curves of prime order 👍 👎
• On the Efficient Generation of Generalized MNT Elliptic Curves 👍 👎
• An algorithmic construction of finite elliptic curves of order divisible by a large prime 👍 👎
• Progress in Cryptology - INDOCRYPT 2003 👍 👎
• Generating Prime Order Elliptic Curves: Difficulties and Efficiency Considerations 👍 👎

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

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