DKDavid Kohel
David Kohel
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
David Kohel has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Alessandra Sarti
Laboratoire de Mathématiques et Applications, UMR CNRS 7348, Université de Poitiers, POITIERS Cedex 9, France
2 shared publications - Xavier Roulleau
UA - Université d'Angers (Université d'Angers - 40 Rue de Rennes, BP 73532 - 49035 Angers CEDEX 01 - France)
2 shared publications - Chitchanok Chuengsatiansup
Technische Universiteit Eindhoven
1 shared publication - Christophe Petit
Universite Libre de Bruxelles
1 shared publication - Daniel J. Bernstein
University of Illinois at Chicago
1 shared publication - Jean-Pierre Tignol
Université catholique de Louvain
1 shared publication
Latest Publications
- 22 August 2021
- Published by Springer Nature in manuscripta mathematica
- Vol. 169 (3-4) , 369-399
A special configuration of 12 conics and generalized Kummer surfaces
- 22 August 2021
- Published by Springer Nature in manuscripta mathematica
- Vol. 169 (3-4) , 369-399
A special configuration of 12 conics and generalized Kummer surfaces
- Open AccessA special configuration of $12$ conics and generalized Kummer surfacesA generalized Kummer surface $X$ obtained as the quotient of an abelian surface by a symplectic automorphism of order 3 contains a $9\mathbf{A}_{2}$-configuration of $(-2)$-curves. Such a configuration plays the role of the $16\mathbf{A}_{1}$-configurations for usual Kummer surfaces. In this paper we construct $9$ other such $9\mathbf{A}_{2}$-configurations on the generalized Kummer surface associated to the double cover of the plane branched over the sextic dual curve of a cubic curve. The new $9\mathbf{A}_{2}$-configurations are obtained by taking the pullback of a certain configuration of $12$ conics which are in special position with respect to the branch curve, plus some singular quartic curves. We then construct some automorphisms of the K3 surface sending one configuration to another. We also give various models of $X$ and of the generic fiber of its natural elliptic pencil.Open AccessA special configuration of $12$ conics and generalized Kummer surfacesA generalized Kummer surface $X$ obtained as the quotient of an abelian surface by a symplectic automorphism of order 3 contains a $9\mathbf{A}_{2}$-configuration of $(-2)$-curves. Such a configuration plays the role of the $16\mathbf{A}_{1}$-configurations for usual Kummer surfaces. In this paper we construct $9$ other such $9\mathbf{A}_{2}$-configurations on the generalized Kummer surface associated to the double cover of the plane branched over the sextic dual curve of a cubic curve. The new $9\mathbf{A}_{2}$-configurations are obtained by taking the pullback of a certain configuration of $12$ conics which are in special position with respect to the branch curve, plus some singular quartic curves. We then construct some automorphisms of the K3 surface sending one configuration to another. We also give various models of $X$ and of the generic fiber of its natural elliptic pencil.
- Open Access
The geometry of efficient arithmetic on elliptic curves
The arithmetic of elliptic curves, namely polynomial addition and scalar multiplication, can be described in terms of global sections of line bundles on $E\times E$ and $E$, respectively, with respect to a given projective embedding of $E$ in $\mathbb{P}^r$. By means of a study of the finite dimensional vector spaces of global sections, we reduce the problem of constructing and finding efficiently computable polynomial maps defining the addition morphism or isogenies to linear algebra. We demonstrate the effectiveness of the method by improving the best known complexity for doubling and tripling, by considering families of elliptic curves admiting a $2$-torsion or $3$-torsion point.Open AccessThe geometry of efficient arithmetic on elliptic curves
The arithmetic of elliptic curves, namely polynomial addition and scalar multiplication, can be described in terms of global sections of line bundles on $E\times E$ and $E$, respectively, with respect to a given projective embedding of $E$ in $\mathbb{P}^r$. By means of a study of the finite dimensional vector spaces of global sections, we reduce the problem of constructing and finding efficiently computable polynomial maps defining the addition morphism or isogenies to linear algebra. We demonstrate the effectiveness of the method by improving the best known complexity for doubling and tripling, by considering families of elliptic curves admiting a $2$-torsion or $3$-torsion point. - Top Cited PapersOpen Access
- 1 August 2014
- Published by Wiley in LMS Journal of Computation and Mathematics
- Vol. 17 (A) , 418-432
On the quaternion -isogeny path problem
Let $\mathcal{O}$ be a maximal order in a definite quaternion algebra over $\mathbb{Q}$ of prime discriminant $p$ , and $\ell $ a small prime. We describe a probabilistic algorithm which, for a given left $\mathcal{O}$ -ideal, computes a representative in its left ideal class of $\ell $ -power norm. In practice the algorithm is efficient and, subject to heuristics on expected distributions of primes, runs in expected polynomial time. This solves the underlying problem for a quaternion analog of the Charles–Goren–Lauter hash function, and has security implications for the original CGL construction in terms of supersingular elliptic curves.- 1 August 2014
- Published by Wiley in LMS Journal of Computation and Mathematics
- Vol. 17 (A) , 418-432
Top Cited PapersOpen AccessOn the quaternion -isogeny path problem
Let $\mathcal{O}$ be a maximal order in a definite quaternion algebra over $\mathbb{Q}$ of prime discriminant $p$ , and $\ell $ a small prime. We describe a probabilistic algorithm which, for a given left $\mathcal{O}$ -ideal, computes a representative in its left ideal class of $\ell $ -power norm. In practice the algorithm is efficient and, subject to heuristics on expected distributions of primes, runs in expected polynomial time. This solves the underlying problem for a quaternion analog of the Charles–Goren–Lauter hash function, and has security implications for the original CGL construction in terms of supersingular elliptic curves.