On the efficient generation of prime-order elliptic curves
DOI10.1007/S00145-009-9037-2zbMATH Open1195.94063OpenAlexW1992016658MaRDI QIDQ5962222FDOQ5962222
Authors: Elisavet Konstantinou, Aristides Kontogeorgis, Yannis C. Stamatiou, Christos Zaroliagis 
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
Recommendations
- scientific article; zbMATH DE number 1979294
- Generating Prime Order Elliptic Curves: Difficulties and Efficiency Considerations
- scientific article; zbMATH DE number 1878329
- Progress in Cryptology - INDOCRYPT 2003
- On the efficient generation of generalized MNT elliptic curves
- scientific article; zbMATH DE number 1857518
- An efficient method of generating rational points on elliptic curves
- Constructing elliptic curves of prime order
- An algorithmic construction of finite elliptic curves of order divisible by a large prime
complex multiplicationpublic key cryptographyelliptic curve cryptosystemsWeber polynomialsprime-order
Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Elliptic curves (14H52)
Cites Work
- 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.)
- Title not available (Why is that?)
- Factoring Polynomials Over Large Finite Fields
- Title not available (Why is that?)
- Title not available (Why is that?)
- Reducing elliptic curve logarithms to logarithms in a finite field
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Modular curves of composite level
- Title not available (Why is that?)
- Generating more MNT elliptic curves
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computing the cardinality of CM elliptic curves using torsion points
- Title not available (Why is that?)
- Title not available (Why is that?)
- Progress in Cryptology - INDOCRYPT 2003
- Generating Prime Order Elliptic Curves: Difficulties and Efficiency Considerations
Cited In (8)
- On Random Number Generation for Kernel Applications
- Ramanujan's class invariants and their use in elliptic curve cryptography
- Title not available (Why is that?)
- 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?)
Uses Software
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)
