Journal of Cryptology
Algorithmic algebraic number theory
Algorithmic algebraic number theory
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Examples of genus two CM curves defined over the rationals
Mathematics of Computation
Comparing Real and Imaginary Arithmetics for Divisor Class Groups of Hyperelliptic Curves
ANTS-III Proceedings of the Third International Symposium on Algorithmic Number Theory
Counting Points on Hyperelliptic Curves over Finite Fields
ANTS-IV Proceedings of the 4th International Symposium on Algorithmic Number Theory
Two Topics in Hyperelliptic Cryptography
SAC '01 Revised Papers from the 8th Annual International Workshop on Selected Areas in Cryptography
Generators for the l-Torsion Subgroup of Jacobians of Genus Two Curves
Pairing '08 Proceedings of the 2nd international conference on Pairing-Based Cryptography
Abelian varieties with prescribed embedding degree
ANTS-VIII'08 Proceedings of the 8th international conference on Algorithmic number theory
Algebraic curves and cryptography
Finite Fields and Their Applications
Constructing pairing-friendly genus 2 curves with ordinary Jacobians
Pairing'07 Proceedings of the First international conference on Pairing-Based Cryptography
Generating pairing-friendly parameters for the CM construction of genus 2 curves over prime fields
Designs, Codes and Cryptography
| Hi-index | 0.01 |
In this article we show how to generalize the CM-method for elliptic curves to genus two. We describe the algorithm in detail and discuss the results of our implementation.