In this paper, we compute l-isogenies between abelian varieties over a field of characteristic different from 2 in polynomial time in l, when l is an odd prime which is coprime to the characteristic. We use level n symmetric theta structure where n = 2 or n = 4. In a second part of this paper we explain how to convert between Mumford coordinates of Jacobians of genus 2 hyperelliptic curves to theta coordinates of level 2 or 4. Combined with the preceding algorithm, this gives a method to compute (l,l)-isogenies in polynomial time on Jacobians of genus 2 curves.Courbes Hyperelliptiques : Isogénies et ComptageAlgorithmic Number Theory in Computer Scienc
Since the mid 1980's, abelian varieties have been widely used in cryptography: the discrete logarith...
Since the mid 1980's, abelian varieties have been widely used in cryptography: the discrete logarith...
International audienceLet ell be a prime, and H a curve of genus 2 over a field k of characteristic ...
Accepté pour publication à Mathematics of ComputationsInternational audienceIn this paper, we comput...
Let $p$ be an odd prime number and be an integer coprime to $p$. We survey an algorithm for computin...
We show how to efficiently evaluate functions on jacobian varieties and their quo-tients. We deduce ...
We present a quasi-linear algorithm to compute isogenies between Jacobians of curvesof genus 2 and 3...
Let k be a field of large enough characteristic. We present an algorithm solving the following probl...
We present an algorithm solving the following problem: given two genus 2 curves over a field k with...
International audienceLet ell be a prime, and H a curve of genus 2 over a field k of characteristic ...
Let p be an odd prime number and g ≥ 2 be an integer. We present an algorithm for computing explicit...
Since the mid 1980's, abelian varieties have been widely used in cryptography: the discrete logarith...
International audienceLet ell be a prime, and H a curve of genus 2 over a field k of characteristic ...
International audienceLet ell be a prime, and H a curve of genus 2 over a field k of characteristic ...
Since the mid 1980's, abelian varieties have been widely used in cryptography: the discrete logarith...
Since the mid 1980's, abelian varieties have been widely used in cryptography: the discrete logarith...
Since the mid 1980's, abelian varieties have been widely used in cryptography: the discrete logarith...
International audienceLet ell be a prime, and H a curve of genus 2 over a field k of characteristic ...
Accepté pour publication à Mathematics of ComputationsInternational audienceIn this paper, we comput...
Let $p$ be an odd prime number and be an integer coprime to $p$. We survey an algorithm for computin...
We show how to efficiently evaluate functions on jacobian varieties and their quo-tients. We deduce ...
We present a quasi-linear algorithm to compute isogenies between Jacobians of curvesof genus 2 and 3...
Let k be a field of large enough characteristic. We present an algorithm solving the following probl...
We present an algorithm solving the following problem: given two genus 2 curves over a field k with...
International audienceLet ell be a prime, and H a curve of genus 2 over a field k of characteristic ...
Let p be an odd prime number and g ≥ 2 be an integer. We present an algorithm for computing explicit...
Since the mid 1980's, abelian varieties have been widely used in cryptography: the discrete logarith...
International audienceLet ell be a prime, and H a curve of genus 2 over a field k of characteristic ...
International audienceLet ell be a prime, and H a curve of genus 2 over a field k of characteristic ...
Since the mid 1980's, abelian varieties have been widely used in cryptography: the discrete logarith...
Since the mid 1980's, abelian varieties have been widely used in cryptography: the discrete logarith...
Since the mid 1980's, abelian varieties have been widely used in cryptography: the discrete logarith...
International audienceLet ell be a prime, and H a curve of genus 2 over a field k of characteristic ...