Bibliography

1E. Thomé.

Théorie algorithmique des nombres et applications à la cryptanalyse de primitives cryptographiques, Université de Lorraine, December 2012, Habilitation à Diriger des Recherches.

http://hal.inria.fr/tel-00765982

2S. Chevillard.

The functions erf and erfc computed with arbitrary precision and explicit error bounds, in: Information and Computation, 2012, vol. 216, p. 72 – 95, The version available on the HAL server is slightly different from the published version because it contains full proofs..

http://hal.inria.fr/ensl-00356709
3P. Gaudry, É. Schost.

Genus 2 point counting over prime fields, in: Journal of Symbolic Computation, 2012, vol. 47, n^o 4, p. 368-400. [ DOI : 10.1016/j.jsc.2011.09.003 ]

http://hal.inria.fr/inria-00542650
4T. Kleinjung, J. Bos, A. Lenstra, D. A. Osvik, K. Aoki, S. Contini, J. Franke, E. Thomé, P. Jermini, M. Thiémard, P. Leyland, P. Montgomery, A. Timofeev, H. Stockinger.

A Heterogeneous Computing Environment to Solve the 768-bit RSA Challenge, in: Cluster Computing, 2012, vol. 15, n^o 1, p. 53-68. [ DOI : 10.1007/s10586-010-0149-0 ]

http://hal.inria.fr/inria-00535765
5D. Lubicz, D. Robert.

Computing isogenies between Abelian Varieties, in: Compositio Mathematica, September 2012, vol. 148, n^o 05, p. 1483–1515, 47 pages. [ DOI : 10.1112/S0010437X12000243 ]

http://hal.inria.fr/hal-00446062

6D. Aranha, J.-L. Beuchat, J. Detrey, N. Estibals.

Optimal Eta pairing on supersingular genus-2 binary hyperelliptic curves, in: Cryptographer's Track at the RSA Conference 2012 (CT-RSA 2012), San Francisco, United States, O. Dunkelman (editor), Springer, February 2012, 19 p.

http://hal.inria.fr/inria-00540002
7R. Barbulescu, J. Bos, C. Bouvier, T. Kleinjung, P. Montgomery.

Finding ECM-friendly curves through a study of Galois properties, in: ANTS-X 10th Algorithmic Number Theory Symposium - 2012, San Diego, United States, University of California, February 2012.

http://hal.inria.fr/hal-00671948
8R. Barbulescu, J. Detrey, N. Estibals, P. Zimmermann.

Finding Optimal Formulae for Bilinear Maps, in: 4th International Workshop on Arithmetic in Finite Fields - WAIFI 2012, Bochum, Germany, F. Özbudak, F. Rodríguez-Henríquez (editors), Lecture Notes in Computer Science, Ruhr Universitat Bochum, July 2012, vol. 7369.

http://hal.inria.fr/hal-00640165
9E. Thomé.

Square root algorithms for the number field sieve, in: 4th International Workshop on Arithmetic in Finite Fields - WAIFI 2012, Bochum, Germany, F. Özbudak, F. Rodríguez-Henríquez (editors), Lecture Notes in Computer Science, Springer, July 2012, vol. 7369, p. 208-224, The original publication is available at www.springerlink.com. [ DOI : 10.1007/978-3-642-31662-3_15 ]

http://hal.inria.fr/hal-00756838

10S. Bai, E. Thomé, P. Zimmermann.

Factorisation of RSA-704 with CADO-NFS, 2012.

http://hal.inria.fr/hal-00760322
11S. Bai, P. Zimmermann.

Size Optimization of Sextic Polynomials in the Number Field Sieve, 2012.

http://hal.inria.fr/hal-00760331
12C. Bouvier.

Improvement in the filtering step of integer factorization algorithms, 2012.

http://hal.inria.fr/hal-00734654
13J. Detrey, P. Gaudry, M. Videau.

Relation collection for the Function Field Sieve, 2012.

http://hal.inria.fr/hal-00736123
14J.-C. Faugère, P. Gaudry, L. Huot, G. Renault.

Using Symmetries in the Index Calculus for Elliptic Curves Discrete Logarithm, 2012, 31 pages.

http://hal.inria.fr/hal-00700555
15S. Ionica.

Pairing-based algorithms for jacobians of genus 2 curves with maximal endomorphism ring, 2012.

http://hal.inria.fr/hal-00675045
16H. Jeljeli.

Accelerating Iterative SpMV for Discrete Logarithm Problem using GPUs, 2012.

http://hal.inria.fr/hal-00734975

17N. Koblitz.

Hyperelliptic cryptosystems, in: J. Cryptology, 1989, vol. 1, p. 139–150.
18M. 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.

Home