Bibliography
Major publications by the team in recent years
-
1J.-L. Beuchat, J. Detrey, N. Estibals, E. Okamoto, F. Rodríguez-Henríquez.
Fast architectures for the pairing over small-characteristic supersingular elliptic curves, in: IEEE Transactions on Computers, February 2011, vol. 60, no 2, pp. 266-281. [ DOI : 10.1109/TC.2010.163 ]
http://hal.inria.fr/inria-00424016 -
2R. Brent, P. Zimmermann.
Modern Computer Arithmetic, Cambridge Monographs on Applied and Computational Mathematics, Cambridge University Press, 2010, vol. 18, 221 p.
http://hal.inria.fr/inria-00424347 -
3R. Cosset, D. Robert.
Computing (l,l)-isogenies in polynomial time on Jacobians of genus 2 curves, 2013, Accepté pour publication à Mathematics of Computations.
http://hal.inria.fr/hal-00578991 -
4A. Enge, P. Gaudry, E. Thomé.
An Discrete Logarithm Algorithm for Low Degree Curves, in: Journal of Cryptology, 2011, vol. 24, pp. 24-41. [ DOI : 10.1007/s00145-010-9057-y ]
http://hal.inria.fr/inria-00383941 -
5P. Gaudry, É. Schost.
Genus 2 point counting over prime fields, in: Journal of Symbolic Computation, 2012, vol. 47, no 4, pp. 368-400. [ DOI : 10.1016/j.jsc.2011.09.003 ]
http://hal.inria.fr/inria-00542650 -
6T. Kleinjung, K. Aoki, J. Franke, A. Lenstra, E. Thomé, J. Bos, P. Gaudry, A. Kruppa, P. Montgomery, D. A. Osvik, H. Te Riele, A. Timofeev, P. Zimmermann.
Factorization of a 768-bit RSA modulus, in: CRYPTO 2010, Santa Barbara, United States, T. Rabin (editor), Lecture Notes in Computer Science, Springer Verlag, 2010, vol. 6223, pp. 333-350.
http://link.springer.com/chapter/10.1007/978-3-642-14623-7_18, http://hal.inria.fr/inria-00444693 -
7D. Lubicz, D. Robert.
Computing isogenies between Abelian Varieties, in: Compositio Mathematica, September 2012, vol. 148, no 05, pp. 1483–1515. [ DOI : 10.1112/S0010437X12000243 ]
http://hal.inria.fr/hal-00446062
Doctoral Dissertations and Habilitation Theses
-
8R. Barbulescu.
Algorithmes de logarithmes discrets dans les corps finis, Université de Lorraine, December 2013.
http://hal.inria.fr/tel-00925228 -
9N. Estibals.
Algorithmes et arithmétique pour l'implémentation de couplages cryptographiques, Université de Lorraine, October 2013.
http://hal.inria.fr/tel-00924743
Articles in International Peer-Reviewed Journals
-
10S. Bai, R. Brent, E. Thomé.
Root optimization of polynomials in the number field sieve, in: Mathematics of Computation, 2014, Accepted for publication.
http://hal.inria.fr/hal-00919367 -
11A. Enge, E. Thomé.
Computing class polynomials for abelian surfaces, in: Experimental Mathematics, 2014, Accepted for publication.
http://hal.inria.fr/hal-00823745 -
12J.-C. Faugère, P. Gaudry, L. Huot, G. Renault.
Using Symmetries in the Index Calculus for Elliptic Curves Discrete Logarithm, in: Journal of Cryptology, May 2013, pp. 1-40. [ DOI : 10.1007/s00145-013-9158-5 ]
http://hal.inria.fr/hal-00700555 -
13S. Ionica.
Pairing-based algorithms for Jacobians of genus 2 curves with maximal endomorphism ring, in: Journal of Number Theory, July 2013, vol. 133, pp. 3755-3770. [ DOI : 10.1016/j.jnt.2013.04.023 ]
http://hal.inria.fr/hal-00675045 -
14G. Melquiond, W. G. Nowak, P. Zimmermann.
Numerical Approximation of the Masser-Gramain Constant to Four Decimal Digits: delta=1.819..., in: Mathematics of Computation, 2013, vol. 82, pp. 1235-1246. [ DOI : 10.1090/S0025-5718-2012-02635-4 ]
http://hal.inria.fr/hal-00644166
International Conferences with Proceedings
-
15R. Barbulescu, C. Bouvier, J. Detrey, P. Gaudry, H. Jeljeli, E. Thomé, M. Videau, P. Zimmermann.
Discrete logarithm in GF(2⌃809) with FFS, in: PKC 2014 - International Conference on Practice and Theory of Public-Key Cryptography, Buenos Aires, Argentina, H. Krawczyk (editor), LNCS, Springer, 2014.
http://hal.inria.fr/hal-00818124 -
16V. Cortier, D. Galindo, S. Glondu, M. Izabachène.
Distributed ElGamal à la Pedersen - Application to Helios, in: WPES 2013 - Proceedings of the 12th ACM workshop on privacy in the electronic society - 2013, Berlin, Germany, ACM, 2013, pp. 131-142. [ DOI : 10.1145/2517840.2517852 ]
http://hal.inria.fr/hal-00881076 -
17J. Detrey, P. Gaudry, M. Videau.
Relation collection for the Function Field Sieve, in: ARITH 21 - 21st IEEE International Symposium on Computer Arithmetic, Austin, Texas, United States, A. Nannarelli, P.-M. Seidel, P. T. P. Tang (editors), IEEE, 2013, pp. 201-210. [ DOI : 10.1109/ARITH.2013.28 ]
http://hal.inria.fr/hal-00736123
Scientific Books (or Scientific Book chapters)
-
18A. Casamayou, G. Connan, T. Dumont, L. Fousse, F. Maltey, M. Meulien, M. Mezzarobba, C. Pernet, N. M. Thiéry, P. Zimmermann.
Calcul mathématique avec Sage, Amazon, 2013, 468 p, electronic version available under Creative Commons license.
http://hal.inria.fr/inria-00540485 -
19P. Gaudry.
Algorithmes de comptage de points d'une courbe définie sur un corps fini, in: Explicit Methods in Number Theory Rational Points and Diophantine Equations, K. Belabas (editor), Panoramas et synthèses, SMF, 2013, vol. 36.
http://hal.inria.fr/hal-00840136 -
20A. Lenstra, T. Kleinjung, E. Thomé.
Universal Security; From bits and mips to pools, lakes - and beyond, in: Number Theory and Cryptography, M. Fischlin, S. Katzenbeisser (editors), Lecture Notes in Computer Science, Springer, 2013, vol. 8260, pp. 121-124, Humoristic. [ DOI : 10.1007/978-3-642-42001-6_9 ]
http://hal.inria.fr/hal-00925622
Other Publications
-
21R. Barbulescu.
Selecting polynomials for the Function Field Sieve, March 2013.
http://hal.inria.fr/hal-00798386 -
22R. Barbulescu, P. Gaudry, A. Joux, E. Thomé.
A quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic, 2013.
http://hal.inria.fr/hal-00835446 -
23C. Bouvier.
The filtering step of discrete logarithm and integer factorization algorithms, June 2013.
http://hal.inria.fr/hal-00734654 -
24C. Bouvier, P. Zimmermann.
Division-Free Binary-to-Decimal Conversion, 2014.
http://hal.inria.fr/hal-00864293 -
25V. Cortier, D. Galindo, S. Glondu, M. Izabachène.
A generic construction for voting correctness at minimum cost - Application to Helios, 2013, Cryptology ePrint Archive, Report 2013/177.
http://hal.inria.fr/hal-00881079 -
26R. Cosset, D. Robert.
Computing (l,l)-isogenies in polynomial time on Jacobians of genus 2 curves, 2013, Accepté pour publication à Mathematics of Computations.
http://hal.inria.fr/hal-00578991 -
27J.-C. Faugère, P. Gaudry, L. Huot, G. Renault.
Polynomial Systems Solving by Fast Linear Algebra, 2013, 27 pages.
http://hal.inria.fr/hal-00816724 -
28H. Jeljeli.
Accelerating Iterative SpMV for Discrete Logarithm Problem using GPUs, 2013.
http://hal.inria.fr/hal-00734975
-
29Agence nationale de la sécurité des systèmes d'information.
Référentiel général de sécurité, annexe B1, 2013.
http://www.ssi.gouv.fr/fr/reglementation-ssi/referentiel-general-de-securite/ -
30N. Koblitz.
Hyperelliptic cryptosystems, in: J. Cryptology, 1989, vol. 1, pp. 139–150.