Abstract. In this paper we classify curves of genus two over a perfect field k of characteristic two. We find rational models of curves with a given arithmetic structure for the ramification divisor and we give necessary and sufficient conditions for two models of the same type to be k-isomorphic. As a consequence, we obtain an explicit formula for the number of k-isomorphism classes of curves of genus two over a finite field. Moreover, we prove that the field of moduli of any curve coincides with its field of definition, by exhibiting rational models of curves with any prescribed value of their Igusa invariants. Finally, we use cohomological methods to find, for each rational model, an explicit description of its twists. In this way, we obtain a parameterization of all k-isomorphism classes of curves of genus two in terms of geometric and arithmetic invariants.

Abstract. Hyperelliptic curves of small genus have the advantage of providing a group of comparable size as that of elliptic curves, while working over a field of smaller size. Pairing-friendly hyperelliptic curves are those whose order of the Jacobian is divisible by a large prime, whose embedding degree is small enough for computations to be feasible, and whose minimal embedding field is large enough for the discrete logarithm problem in it to be difficult. We give a sequence of Fq-isogeny classes for a family of Jacobians of genus two curves over Fq, for q = 2 m, and their corresponding small embedding degrees. We give examples of the parameters for such curves with

Abstract. A pairing-friendly curve is a curve over a finite field whose Jacobian has small embedding degree with respect to a large prime-order subgroup. In this paper we construct pairing-friendly genus 2 curves over finite fields Fq whose Jacobians are ordinary and simple, but not absolutely simple. We show that constructing such curves is equivalent to constructing elliptic curves over Fq that become pairing-friendly over a finite extension of Fq. Our main proof technique is Weil restriction of elliptic curves. We describe adaptations of the Cocks-Pinch and Brezing-Weng methods that produce genus 2 curves with the desired properties. Our examples include a parametric family of genus 2 curves whose Jacobians have the smallest recorded ρ-value for simple, nonsupersingular abelian surfaces. 1.

Abstract. We construct Weil numbers corresponding to genus-2 curves with p-rank 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 Fp2-valued 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 p-rank 1 over Fp for large p cannot be efficiently constructed using explicit CM constructions. 1.

Zeta functions of supersingular curves of genus 2

Abstract. Genus 2 curves with simple but not absolutely simple jacobians can be used to construct pairing-based cryptosystems more efficient than for a generic genus 2 curve. We show that there is a full analogy between methods for constructing ordinary pairing-friendly elliptic curves and simple abelian varieties, which are iogenous over some extension to a product of elliptic curves. We extend the notion of complete, complete with variable discriminant, and sparse families introduced in by Freeman, Scott and Teske [11] for elliptic curves, and we generalize the Cocks-Pinch method and the Brezing-Weng method to construct families of each type. To realize abelian surfaces as jacobians we use of genus 2 curves of the form y 2 = x 5 + ax 3 + bx or y 2 = x 6 + ax 3 + b, and apply the method of Freeman and Satoh [10]. As applications we find some families of abelian surfaces with recorded ρ-value ρ = 2 for embedding degrees k = 3, 4, 6, 12, or ρ = 2.1 for k = 27, 54. We also give variable-discriminant families with best ρ-values. Keywords: Pairing-friendly hyperelliptic curves, abelian varieties, Weil numbers, CM method.