Bibliography

Major publications by the team in recent years

[1]: R. P. Brent, P. Zimmermann.
Modern Computer Arithmetic, Version 0.4, 2009
http://wwwmaths.anu.edu.au/~brent/pub/pub226.html, In preparation.

[2]: R. P. Brent, P. Zimmermann.
Ten new primitive binary trinomials, in: Mathematics of Computation, 2009, vol. 78, n^o 266, p. 1197-1199
http://hal.inria.fr/inria-00337525/en/.
[3]: R. Cosset.
Factorization with genus 2 curves, in: Mathematics of Computation, 2009
http://hal.inria.fr/inria-00384128/en/.
[4]: M. Deléglise, J.-L. Nicolas, P. Zimmermann.
Landau's function for one million billions, in: Journal de Théorie des Nombres de Bordeaux, 2009, à paraître p
http://hal.archives-ouvertes.fr/hal-00264057/en/.
[5]: P. Gaudry.
Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem, in: Journal of Symbolic Computation, 2009, vol. 44, n^o 12, p. 1690-1702
http://hal.inria.fr/inria-00337631/en/.
[6]: P. Gaudry, D. Lubicz.
The arithmetic of characteristic 2 Kummer surfaces and of elliptic Kummer lines, in: Finite Fields and Their Applications, 2009, vol. 15, n^o 2, p. 246-260
http://hal.inria.fr/inria-00266565/en/.
[7]: S. Rump, P. Zimmermann, S. Boldo, G. Melquiond.
Computing predecessor and successor in rounding to nearest, in: BIT Numerical Mathematics, 2009, vol. 49, n^o 2, p. 419-431
http://hal.inria.fr/inria-00337537/en/.

[8]: J.-L. Beuchat, J. Detrey, N. Estibals, E. Okamoto, F. Rodríguez-Henríquez.
Hardware Accelerator for the Tate Pairing in Characteristic Three Based on Karatsuba-Ofman Multipliers, in: 11th International Workshop on Cryptographic Hardware and Embedded Systems - CHES 2009, Suisse Lausanne, C. Clavier, K. Gaj (editors), Springer, 2009, vol. 5747, p. 225-239
http://hal.inria.fr/inria-00424011/en/.
[9]: E. Gioan, S. Burckel, E. Thomé.
Mapping Computation with No Memory, in: 8th International Conference on Unconventional Computation - UC09, Ponta Delgada, Portugal, Springer, 2009, 15 p
http://hal-lirmm.ccsd.cnrs.fr/lirmm-00395080/en/.
[10]: A. Joux, R. Lercier, D. Naccache, E. Thomé.
Oracle-Assisted Static Diffie-Hellman Is Easier Than Discrete Logarithms, in: Twelfth IMA International Conference on Cryptography and Coding, Cirencester Royaume-Uni, Lecture Notes in Computer Science, Springer, 2009
http://hal.inria.fr/inria-00337753/en/.

[11]: M. Videau.
Aspects techniques de la preuve reposant sur l'écrit électronique, in: La preuve des actes juridiques électroniques privés : mosaïque des droits européens ou trait d'Union ?, France Lille, Lamy, 2009, p. 15-18 (RLDI 1743)
http://hal.archives-ouvertes.fr/hal-00432625/en/.

[12]: P. Dumas, C. Gomez, B. Salvy, P. Zimmermann.
Calcul formel : mode d'emploi. Exemples en Maple, Version électronique, 2009
http://hal.inria.fr/inria-00371192/en/.

[13]: E. Bresson, A. Canteaut, B. Chevallier-Mames, C. Clavier, T. Fuhr, A. Gouget, T. Icart, J.-F. Misarsky, M. Naya-Plasencia, P. Paillier, T. Pornin, J.-R. Reinhard, C. Thuillet, M. Videau.
Indifferentiability with Distinguishers: Why Shabal Does Not Require Ideal Ciphers, Cryptology ePrint Archive, 2009
http://eprint.iacr.org/2009/199, Technical report.
[14]: I. Chelli.
Fully deterministic ECM, INRIA, 2009
http://hal.inria.fr/inria-00419083/en/, RR-7040.
[15]: A. Kruppa.
A Software Implementation of ECM for NFS, INRIA, 2009
http://hal.inria.fr/inria-00419094/en/, RR-7041.

[16]: R. Barbulescu.
Familles de courbes adaptées à la factorisation des entiers, 2009
http://hal.inria.fr/inria-00419218/en/, Internship report.
[17]: J.-L. Beuchat, J. Detrey, N. Estibals, E. Okamoto, F. Rodríguez-Henríquez.
Fast Architectures for the $\eta$ _T Pairing over Small-Characteristic Supersingular Elliptic Curves, 2009
http://hal.inria.fr/inria-00424016/en/, Submitted at IEEE Transactions on Computers.
[18]: G. Bisson, A. V. Sutherland.
Computing the endomorphism ring of an ordinary elliptic curve over a finite field, 2009
http://hal.inria.fr/inria-00383155/en/, Accepted for publication in Journal of Number Theory.
[19]: A. Enge, P. Gaudry, E. Thomé.
An L(1/3) Discrete Logarithm Algorithm for Low Degree Curves, 2009
http://hal.inria.fr/inria-00383941/en/, Accepted for publication in Journal of Cryptology.
[20]: N. Estibals.
Génération automatique de circuits pour le calcul de couplages cryptographiques en matériel, ENS Lyon, 2009, Masters thesis.
[21]: J.-C. Faugere, D. Lubicz, D. Robert.
Computing modular correspondences for abelian varieties, 2009
http://hal.archives-ouvertes.fr/hal-00426338/fr/.

[22]: E. Bresson, A. Canteaut, B. Chevallier-Mames, C. Clavier, T. Fuhr, A. Gouget, T. Icart, J.-F. Misarsky, M. Naya-Plasencia, P. Paillier, T. Pornin, J.-R. Reinhard, C. Thuillet, M. Videau.
Shabal, a Submission to NIST's Cryptographic Hash Algorithm Competition, 2008
http://www.shabal.com/.
[23]: C. Hermite.
Extraits de lettres de M. Hermite à M. Jacobi sur différents objets de la théorie des nombres, deuxième lettre, in: Journal für die reine und angewandte Mathematik, 1850, vol. 40, p. 279–290.
[24]: IEEE.
P1363: Standard specifications for public key cryptography.
[25]: N. Koblitz.
Elliptic curve cryptosystems, in: Math. Comp., 1987, n^o 48, p. 203–209.
[26]: A. K. Lenstra, H. W. Lenstra, L. Lovász.
Factoring Polynomials with Rational Coefficients, in: Mathematische Annalen, 1982, vol. 261, p. 515–534.
[27]: V. S. Miller.
Use of Elliptic Curves in Cryptography, in: Advances in cryptology—CRYPTO 85, New York, USA, Lecture notes in computer science, Springer-Verlag, 1986, vol. 218, p. 417–426.
[28]: C. P. Schnorr.
A Hierarchy of Polynomial Lattice Basis Reduction Algorithms, in: Theoretical Computer Science, 1987, vol. 53, p. 201–224.
[29]: M. Scott.
New record breaking implementations of ECC on quadratic extensions using endomorphisms, September 2008, Invited talk at the ECC 2008 Conference. Utrecht, the Netherlands, Sep. 22-24, 2008..