Reynald Lercier

[fr]  [en]

Welcome  





Adresse DGA MI

Route de Laillé

35170 Bruz

Adresse

Université de Rennes 1

IRMAR

Équipe Géométrie Algébrique Réelle, Calcul Formel et Cryptographie

Room 612

 

Fax33 2 99 42 64 50
Melreynald.lercier (at) m4x.org
  • open
    close
    Publications
    • • Papers
    • → Talks
  • open
    close
    Software
    • • Magma
  • open
    close
    Computations
    • • Discrete logarithms
    • • Counting points on elliptic curves
    • • Elliptic curves of prescribed order
    • • Counting points on hyperelliptic curves
    • • Integer factorization
Links
ZEN IRMAR
Publications - Talks


[Ler10] R. Lercier. Fast p-adic arithmetic for (hyper)elliptic AGM point counting algorithms. Talk at the Counting Points: Theory, Algorithms and Practice conference, Montréal, April 2010. [ preprint | publication ]
[Ler09a] R. Lercier. An elliptic variant of the AKS primality test. Talk at Cryptography Seminar of Rennes, June 2009. [ preprint | publication ]
[Ler09b] R. Lercier. Elliptic Periods for Finite Fields - Applications to the AKS primality test. Talk at AGCT12 (Arithmétique, Géométrie, Cryptographie et Théorie des codes), April 2009. [ preprint | publication ]
[JL99] A. Joux and R. Lercier. State-of-the-art in implementing algorithms for the (ordinary) discrete logarithms problem. Talk at ECC 99 (Elliptic Curve Cryptography), November 1999. [ preprint | publication ]

Modification date :   Saturday 10 of January, 2015   [19:34:00 UTC]

Display without the side boxDisplay without the side box

Top


  Site powered by GuppY v4.5.14 © 2004-2005 - CeCILL Free License