AbstractWe 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
International audienceWe present an accelerated Schoof-type point-counting algorithm for curves of g...
International audienceWe present an accelerated Schoof-type point-counting algorithm for curves of g...
International audienceSchoof's classic algorithm allows point-counting for elliptic curves over fini...
AbstractWe give a new method for generating genus 2 curves over a finite field with a given number o...
Abstract. Genus 2 curves have been an object of much mathematical interest since eighteenth century ...
The complex multiplication (CM) method for genus 2 is currently the most efficient way of generating...
The complex multiplication (CM) method for genus 2 is currently the most efficient way of generating...
The complex multiplication (CM) method for genus 2 is currently the most efficient way of generating...
Abstract. We present a new method for constructing genus 2 curves over a finite field Fn with a give...
The complex multiplication (CM) method for genus 2 is currently the most efficient way of generating...
International audienceWe present an accelerated Schoof-type point-counting algorithm for curves of g...
International audienceWe present an accelerated Schoof-type point-counting algorithm for curves of g...
International audienceWe present an accelerated Schoof-type point-counting algorithm for curves of g...
International audienceWe present an accelerated Schoof-type point-counting algorithm for curves of g...
International audienceWe present an accelerated Schoof-type point-counting algorithm for curves of g...
International audienceWe present an accelerated Schoof-type point-counting algorithm for curves of g...
International audienceWe present an accelerated Schoof-type point-counting algorithm for curves of g...
International audienceSchoof's classic algorithm allows point-counting for elliptic curves over fini...
AbstractWe give a new method for generating genus 2 curves over a finite field with a given number o...
Abstract. Genus 2 curves have been an object of much mathematical interest since eighteenth century ...
The complex multiplication (CM) method for genus 2 is currently the most efficient way of generating...
The complex multiplication (CM) method for genus 2 is currently the most efficient way of generating...
The complex multiplication (CM) method for genus 2 is currently the most efficient way of generating...
Abstract. We present a new method for constructing genus 2 curves over a finite field Fn with a give...
The complex multiplication (CM) method for genus 2 is currently the most efficient way of generating...
International audienceWe present an accelerated Schoof-type point-counting algorithm for curves of g...
International audienceWe present an accelerated Schoof-type point-counting algorithm for curves of g...
International audienceWe present an accelerated Schoof-type point-counting algorithm for curves of g...
International audienceWe present an accelerated Schoof-type point-counting algorithm for curves of g...
International audienceWe present an accelerated Schoof-type point-counting algorithm for curves of g...
International audienceWe present an accelerated Schoof-type point-counting algorithm for curves of g...
International audienceWe present an accelerated Schoof-type point-counting algorithm for curves of g...
International audienceSchoof's classic algorithm allows point-counting for elliptic curves over fini...