AbstractWe 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
This survey discusses algorithms and explicit calculations for curves of genus at least 2 and their...
In this chapter we present a method for finding a curve and the group order of its Jacobian which ca...
Abstract. We extend a result of Spearman which provides a sufficient condition for elliptic curves o...
Abstract. We construct Weil numbers corresponding to genus-2 curves with p-rank 1 over the finite fi...
We construct Weil numbers corresponding to genus-2 curves with p-rank 1 over the finite field F_p^2 ...
AbstractWe construct Weil numbers corresponding to genus-2 curves with p-rank 1 over the finite fiel...
Abstract. We present a new method for constructing genus 2 curves over a finite field Fn with a give...
AbstractA pairing-friendly curve is a curve over a finite field whose Jacobian has small embedding d...
Given number fields L⊃K, smooth projective curves C defined over L and B defined over K, and a non-c...
Abstract. Given number fields L ⊃ K, smooth projective curves C defined over L and B defined over K,...
We push further the classical proof of Weil upper bound for the number of rational points of an abso...
The CM class number one problem for elliptic curves asked to find all elliptic curves defined over t...
AbstractWe consider curves defined over small finite fields with points of large prime order over an...
The main subject of this thesis is the CM class number one problem for curves of genus g, in the c...
Computing the order of the Jacobian group of a hyperelliptic curve over a finite field is very impo...
This survey discusses algorithms and explicit calculations for curves of genus at least 2 and their...
In this chapter we present a method for finding a curve and the group order of its Jacobian which ca...
Abstract. We extend a result of Spearman which provides a sufficient condition for elliptic curves o...
Abstract. We construct Weil numbers corresponding to genus-2 curves with p-rank 1 over the finite fi...
We construct Weil numbers corresponding to genus-2 curves with p-rank 1 over the finite field F_p^2 ...
AbstractWe construct Weil numbers corresponding to genus-2 curves with p-rank 1 over the finite fiel...
Abstract. We present a new method for constructing genus 2 curves over a finite field Fn with a give...
AbstractA pairing-friendly curve is a curve over a finite field whose Jacobian has small embedding d...
Given number fields L⊃K, smooth projective curves C defined over L and B defined over K, and a non-c...
Abstract. Given number fields L ⊃ K, smooth projective curves C defined over L and B defined over K,...
We push further the classical proof of Weil upper bound for the number of rational points of an abso...
The CM class number one problem for elliptic curves asked to find all elliptic curves defined over t...
AbstractWe consider curves defined over small finite fields with points of large prime order over an...
The main subject of this thesis is the CM class number one problem for curves of genus g, in the c...
Computing the order of the Jacobian group of a hyperelliptic curve over a finite field is very impo...
This survey discusses algorithms and explicit calculations for curves of genus at least 2 and their...
In this chapter we present a method for finding a curve and the group order of its Jacobian which ca...
Abstract. We extend a result of Spearman which provides a sufficient condition for elliptic curves o...