On the efficient generation of prime-order elliptic curves
From MaRDI portal
Publication:5962222
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
Cites work
- scientific article; zbMATH DE number 1583945 (Why is no real title available?)
- scientific article; zbMATH DE number 1689862 (Why is no real title available?)
- 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 19079 (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 1947427 (Why is no real title available?)
- scientific article; zbMATH DE number 1955467 (Why is no real title available?)
- scientific article; zbMATH DE number 1979294 (Why is no real title available?)
- scientific article; zbMATH DE number 2081084 (Why is no real title available?)
- scientific article; zbMATH DE number 2086890 (Why is no real title available?)
- scientific article; zbMATH DE number 1857518 (Why is no real title available?)
- scientific article; zbMATH DE number 799785 (Why is no real title available?)
- A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
- An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
- Computing the cardinality of CM elliptic curves using torsion points
- Counting points on elliptic curves over finite fields
- Elliptic Curves and Primality Proving
- Factoring Polynomials Over Large Finite Fields
- Generating Prime Order Elliptic Curves: Difficulties and Efficiency Considerations
- Generating more MNT elliptic curves
- Modular curves of composite level
- Progress in Cryptology - INDOCRYPT 2003
- Reducing elliptic curve logarithms to logarithms in a finite field
- The Probability that the Number of Points on an Elliptic Curve over a Finite Field is Prime
- Weber's class invariants revisited
Cited in
(8)- On Random Number Generation for Kernel Applications
- Ramanujan's class invariants and their use in elliptic curve cryptography
- scientific article; zbMATH DE number 1588468 (Why is no real title available?)
- Progress in Cryptology - INDOCRYPT 2003
- Generating Prime Order Elliptic Curves: Difficulties and Efficiency Considerations
- scientific article; zbMATH DE number 1878329 (Why is no real title available?)
- scientific article; zbMATH DE number 7310076 (Why is no real title available?)
- scientific article; zbMATH DE number 1979294 (Why is no real title available?)
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)
