Results 11  20
of
39
Annegret, Construction of CM Picard curves
 Math. Comp
"... Abstract. In this article we generalize the CM method for elliptic and hyperelliptic curves to Picard curves. We describe the algorithm in detail and discuss the results of our implementation. 1. ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
(Show Context)
Abstract. In this article we generalize the CM method for elliptic and hyperelliptic curves to Picard curves. We describe the algorithm in detail and discuss the results of our implementation. 1.
E.: Primes in the denominators of Igusa class polynomials
, 2003
"... The purpose of this note is to suggest an analogue for genus 2 curves of part of Gross and Zagier’s work on elliptic curves [GZ84]. Experimentally, for genus 2 curves with CM by a quartic CM field K, it appears that primes dividing the denominators of the discriminants of the Igusa class polynomials ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
(Show Context)
The purpose of this note is to suggest an analogue for genus 2 curves of part of Gross and Zagier’s work on elliptic curves [GZ84]. Experimentally, for genus 2 curves with CM by a quartic CM field K, it appears that primes dividing the denominators of the discriminants of the Igusa class polynomials all have the property
Improved CRT algorithm for class polynomials in genus 2
 MATHEMATICAL SCIENCE PUBLISHERS
"... We present a generalization to genus 2 of the probabilistic algorithm in Sutherland [28] for computing Hilbert class polynomials. The improvement over the algorithm presented in [5] for the genus 2 case, is that we do not need to find a curve in the isogeny class with endomorphism ring which is th ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
We present a generalization to genus 2 of the probabilistic algorithm in Sutherland [28] for computing Hilbert class polynomials. The improvement over the algorithm presented in [5] for the genus 2 case, is that we do not need to find a curve in the isogeny class with endomorphism ring which is the maximal order: rather we present a probabilistic algorithm for “going up” to a maximal curve (a curve with maximal endomorphism ring), once we find any curve in the right isogeny class. Then we use the structure of the Shimura class group and the computation of (ℓ, ℓ)isogenies to compute all isogenous maximal curves from an initial one. This article is an extended version of the version published at ANTS X.
Limitations of Constructive Weil Descent
"... Weil restriction of scalars can be used to construct curves suitable for cryptography whose Jacobian has known group order. The description given by Hess, Seroussi and Smart shows how to construct hyperelliptic curves of genus two or three over finite fields of characteristic two. One drawback of th ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Weil restriction of scalars can be used to construct curves suitable for cryptography whose Jacobian has known group order. The description given by Hess, Seroussi and Smart shows how to construct hyperelliptic curves of genus two or three over finite fields of characteristic two. One drawback of their method is discussed, namely that only a small proportion of the set of all curves can be constructed in this way. We also indicate that the method cannot be generalised to overcome this drawback.
Igusa class polynomials, embeddings of quartic CM fields, and arithmetic intersection theory
"... Bruinier and Yang conjectured a formula for an intersection number on the arithmetic Hilbert modular surface, CM(K).Tm, where CM(K) is the zerocycle of points corresponding to abelian surfaces with CM by a primitive quartic CM field K, and Tm is the HirzebruchZagier divisors parameterizing produc ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
Bruinier and Yang conjectured a formula for an intersection number on the arithmetic Hilbert modular surface, CM(K).Tm, where CM(K) is the zerocycle of points corresponding to abelian surfaces with CM by a primitive quartic CM field K, and Tm is the HirzebruchZagier divisors parameterizing products of elliptic curves with an misogeny between them. In this paper, we examine fields not covered by Yang’s proof of the conjecture. We give numerical evidence to support the conjecture and point to some interesting anomalies. We compare the conjecture to both the denominators of Igusa class polynomials and the number of solutions to the embedding problem stated by Goren and Lauter.
Pairingbased algorithms for jacobians of genus 2 curves with maximal endomorphism
"... ring ..."
(Show Context)
Computing genus 2 curves from invariants on the Hilbert moduli space
 J. Number Theory
"... Abstract. We give a new method for generating genus 2 curves over a finite field with a given number of points on the Jacobian of the curve. We define two new invariants for genus 2 curves as values of modular functions on the Hilbert moduli space and show how to compute them. We relate them to the ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
(Show Context)
Abstract. We give a new method for generating genus 2 curves over a finite field with a given number of points on the Jacobian of the curve. We define two new invariants for genus 2 curves as values of modular functions on the Hilbert moduli space and show how to compute them. We relate them to the usual three Igusa invariants on the Siegel moduli space and give an algorithm to construct curves using these new invariants. Our approach simplifies the complex analytic method for computing genus 2 curves for cryptography and reduces the amount of computation required. 1.
PAIRINGS ON HYPERELLIPTIC CURVES
, 2009
"... We assemble and reorganize the recent work in the area of hyperelliptic pairings: We survey the research on constructing hyperelliptic curves suitable for pairingbased cryptography. We also showcase the hyperelliptic pairings proposed to date, and develop a unifying framework. We discuss the techni ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We assemble and reorganize the recent work in the area of hyperelliptic pairings: We survey the research on constructing hyperelliptic curves suitable for pairingbased cryptography. We also showcase the hyperelliptic pairings proposed to date, and develop a unifying framework. We discuss the techniques used to optimize the pairing computation on hyperelliptic curves, and present many directions for further research.
EXPLICIT CMTHEORY IN DIMENSION 2
"... Abstract. For a complex abelian surface A with endomorphism ring isomorphic to the maximal order in a quartic CMfield K, the Igusa invariants j1(A), j2(A), j3(A) generate an abelian extension of the reflex field of K. In this paper we give an explicit description of the Galois action of the class g ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
Abstract. For a complex abelian surface A with endomorphism ring isomorphic to the maximal order in a quartic CMfield K, the Igusa invariants j1(A), j2(A), j3(A) generate an abelian extension of the reflex field of K. In this paper we give an explicit description of the Galois action of the class group of this reflex field on j1(A), j2(A), j3(A). We give a geometric description which can be expressed by maps between various Siegel modular varieties. We can explicitly compute this action for ideals of small norm, and this allows us to improve the CRT method for computing Igusa class polynomials. Furthermore, we find cycles in isogeny graphs for abelian surfaces, thereby implying that the ‘isogeny volcano ’ algorithm to compute endomorphism rings of ordinary elliptic curves over finite fields does not have a straightforward generalization to computing endomorphism rings of abelian surfaces over finite fields. 1.
A CM CONSTRUCTION FOR CURVES OF GENUS 2 WITH pRANK 1
"... We construct Weil numbers corresponding to genus2 curves with prank 1 over the finite field Fp2 of p2 elements. The corresponding curves can be constructed using explicit CM constructions. In one of our algorithms, the group of Fp2valued points of the Jacobian has prime order, while another allo ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
We construct Weil numbers corresponding to genus2 curves with prank 1 over the finite field Fp2 of p2 elements. The corresponding curves can be constructed using explicit CM constructions. In one of our algorithms, the group of Fp2valued points of the Jacobian has prime order, while another allows for a prescribed embedding degree with respect to a subgroup of prescribed order. The curves are defined over Fp2 out of necessity: we show that curves of prank 1 over Fp for large p cannot be efficiently constructed using explicit CM constructions.