Progress in Cryptology - INDOCRYPT 2003

DOI10.1007/b94593zbMath1123.14300OpenAlexW753701005MaRDI QIDQ5429137

Elisavet Konstantinou, Yannis C. Stamatiou, Christos D. Zaroliagis

Publication date: 29 November 2007

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

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

zbMATH Keywords

rootsWeber polynomialsHilbert polynomialsCM variant

Mathematics Subject Classification ID

Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (3)

Efficient CM-constructions of elliptic curves over finite fields ⋮ Evaluating Large Degree Isogenies and Applications to Pairing Based Cryptography ⋮ On the efficient generation of prime-order elliptic curves

This page was built for publication: Progress in Cryptology - INDOCRYPT 2003