Generating Prime Order Elliptic Curves: Difficulties and Efficiency Considerations

DOI10.1007/11496618_20MaRDI QIDQ5450906zbMATH OpenOpenAlexFDO

Authors Elisavet Konstantinou, Yannis C. Stamatiou, Aristides Kontogeorgis, Christos Zaroliagis

Publication date 17 March 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11496618_20

zbMATH Keywords

class field polynomialscomplex multiplicationelliptic curve cryptosystemsgeneration of prime order elliptic curves

Mathematics Subject Classification ID

Modular and automorphic functions (11F03) Complex multiplication and moduli of abelian varieties (11G15) Class numbers, class groups, discriminants (11R29) Class field theory (11R37) Algebraic number theory computations (11Y40) Applications to coding theory and cryptography of arithmetic geometry (14G50) Cryptography (94A60)

Recommendations

• On the efficient generation of prime-order elliptic curves
• scientific article; zbMATH DE number 1979294
• scientific article; zbMATH DE number 1878329
• Constructing elliptic curves of prime order
• Progress in Cryptology - INDOCRYPT 2003
• Primes generated by elliptic curves
• On the efficient generation of generalized MNT elliptic curves
• Primality proofs with elliptic curves: heuristic on the expected number of curve orders
• scientific article; zbMATH DE number 1857518

Cited in

(6)

• scientific article; zbMATH DE number 1588468 (Why is no real title available?)
• scientific article; zbMATH DE number 1979294 (Why is no real title available?)
• Constructing class invariants
• Progress in Cryptology - INDOCRYPT 2003
• On the efficient generation of prime-order elliptic curves
• Ramanujan's class invariants and their use in elliptic curve cryptography

This page was built for publication: Generating Prime Order Elliptic Curves: Difficulties and Efficiency Considerations

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