Generating Prime Order Elliptic Curves: Difficulties and Efficiency Considerations
DOI10.1007/11496618_20zbMath1133.94325OpenAlexW2153276900MaRDI QIDQ5450906
Yannis C. Stamatiou, Elisavet Konstantinou, Christos D. Zaroliagis, Aristides I. Kontogeorgis
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
complex multiplicationelliptic curve cryptosystemsclass field polynomialsgeneration of prime order elliptic curves
Cryptography (94A60) Modular and automorphic functions (11F03) Complex multiplication and moduli of abelian varieties (11G15) Algebraic number theory computations (11Y40) Class field theory (11R37) Class numbers, class groups, discriminants (11R29) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Related Items