On the efficient generation of prime-order elliptic curves
From MaRDI portal
Publication:5962222
DOI10.1007/s00145-009-9037-2zbMath1195.94063MaRDI QIDQ5962222
Yannis C. Stamatiou, Elisavet Konstantinou, Christos D. Zaroliagis, Aristides I. 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
complex multiplication; public key cryptography; elliptic curve cryptosystems; prime-order; Weber polynomials
11T71: Algebraic coding theory; cryptography (number-theoretic aspects)
94A60: Cryptography
14H52: Elliptic curves
Uses Software