Bibliography

Publications of the year

Doctoral Dissertations and Habilitation Theses

• 1H. Labrande.
  Explicit computation of the Abel-Jacobi map and its inverse, Université de Lorraine ; University of Calgary, November 2016.
  https://tel.archives-ouvertes.fr/tel-01403849

Articles in International Peer-Reviewed Journals

• 2C. Chen, S. Covanov, F. Mansouri, R. H. C. Moir, M. Moreno Maza, N. Xie, Y. Xie.
  The Basic Polynomial Algebra Subprograms, in: ACM Communications in Computer Algebra, November 2016. [ DOI : 10.1145/3015306.3015312 ]
  https://hal.archives-ouvertes.fr/hal-01404718
• 3S. Galbraith, P. Gaudry.
  Recent progress on the elliptic curve discrete logarithm problem, in: Designs, Codes and Cryptography, 2016, vol. 78, n^o 1, pp. 51-72. [ DOI : 10.1007/s10623-015-0146-7 ]
  https://hal.inria.fr/hal-01215623
• 4P. Gaudry, L. Grémy, M. Videau.
  Collecting relations for the number field sieve in $GF\left(p^6\right)$, in: LMS Journal of Computation and Mathematics, 2016, vol. 19, pp. 332 - 350. [ DOI : 10.1112/S1461157016000164 ]
  https://hal.inria.fr/hal-01273045
• 5H. Labrande.
  Computing Jacobi's $\theta$ in quasi-linear time, in: Mathematics of Computation, November 2016.
  https://hal.inria.fr/hal-01227699
• 6H. Labrande, E. Thomé.
  Computing theta functions in quasi-linear time in genus 2 and above, in: LMS Journal of Computation and Mathematics, August 2016, vol. 19, n^o A, pp. 163-177. [ DOI : 10.1112/S1461157016000309 ]
  https://hal.inria.fr/hal-01277169
• 7J.-P. Échard, P. Gaudry.
  An harmonious encoding of instrument values by a 19th century Parisian violin dealer, in: Cryptologia, 2016, À paraître, forthcoming.
  https://hal.inria.fr/hal-01393625

International Conferences with Proceedings

• 8J.-G. Dumas, E. Kaltofen, E. Thomé, G. Villard.
  Linear Time Interactive Certificates for the Minimal Polynomial and the Determinant of a Sparse Matrix, in: International Symposium on Symbolic and Algebraic Computation, Waterloo, Canada, X.-S. Gao (editor), ISSAC’2016, Proceedings of the 2016 ACM International Symposium on Symbolic and Algebraic Computation, ACM, July 2016.
  https://hal.archives-ouvertes.fr/hal-01266041
• 9N. Eyrolles, L. Goubin, M. Videau.
  Defeating MBA-based Obfuscation, in: 2nd International Workshop on Software PROtection, Vienna, Austria, ACM (editor), October 2016. [ DOI : 10.1145/2995306.2995308 ]
  https://hal.archives-ouvertes.fr/hal-01388109
• 10J.-C. Faugère, P.-J. Spaenlehauer, J. Svartz.
  Computing Small Certificates of Inconsistency of Quadratic Fewnomial Systems, in: International Symposium on Symbolic and Algebraic Computation (ISSAC 2016), Waterloo, Canada, ACM, July 2016, pp. 223-230. [ DOI : 10.1145/2930889.2930927 ]
  https://hal.inria.fr/hal-01314651
• 11A. Guillevic, F. Morain, E. Thomé.
  Solving discrete logarithms on a 170-bit MNT curve by pairing reduction, in: Selected Areas in Cryptography 2016, St. John's, Canada, R. Avanzi, H. Heys (editors), Selected Areas in Cryptography 2016, Springer, August 2016, to appear in the Lecture Notes in Computer Science (LNCS).
  https://hal.inria.fr/hal-01320496
• 12A. Guinet, N. Eyrolles, M. Videau.
  Arybo: Manipulation, Canonicalization and Identification of Mixed Boolean-Arithmetic Symbolic Expressions, in: GreHack 2016, Grenoble, France, Proceedings of GreHack 2016, November 2016.
  https://hal.archives-ouvertes.fr/hal-01390528
• 13M. Safey El Din, P.-J. Spaenlehauer.
  Critical Point Computations on Smooth Varieties: Degree and Complexity bounds, in: International Symposium on Symbolic and Algebraic Computation (ISSAC), Waterloo, Canada, July 2016, pp. 183–190. [ DOI : 10.1145/2930889.2930929 ]
  https://hal.inria.fr/hal-01312750

Scientific Books (or Scientific Book chapters)

• 14E. Thomé.
  A modified block Lanczos algorithm with fewer vectors, in: Topics in Computational Number Theory inspired by Peter L. Montgomery, Cambridge University Press, 2016.
  https://hal.inria.fr/hal-01293351

Other Publications

• 15S. Bai, P. Gaudry, A. Kruppa, E. Thomé, P. Zimmermann.
  Factorisation of RSA-220 with CADO-NFS, May 2016, working paper or preprint.
  https://hal.inria.fr/hal-01315738
• 16R. P. Brent, P. Zimmermann.
  Twelve new primitive binary trinomials, October 2016, working paper or preprint.
  https://hal.inria.fr/hal-01378493
• 17S. Covanov, E. Thomé.
  Fast integer multiplication using generalized Fermat primes, January 2016, working paper or preprint.
  https://hal.inria.fr/hal-01108166
• 18J. Fried, P. Gaudry, N. Heninger, E. Thomé.
  A kilobit hidden SNFS discrete logarithm computation, September 2016, working paper or preprint.
  https://hal.inria.fr/hal-01376934
• 19M. Ishii, J. Detrey, P. Gaudry, A. Inomata, K. Fujikawa.
  Fast Modular Arithmetic on the Kalray MPPA-256 Processor for an Energy-Efficient Implementation of ECM, April 2016, working paper or preprint.
  https://hal.inria.fr/hal-01299697
• 20S. Perdrix, L. Sanselme.
  Determinism and Computational Power of Real Measurement-based Quantum Computation, October 2016, working paper or preprint.
  https://hal.archives-ouvertes.fr/hal-01377339
• 21P. Zimmermann, F. Bastien.
  Paul Zimmermann - CADO-NFS: Atelier PARI/GP 2016, January 2016.
  https://hal.archives-ouvertes.fr/medihal-01346718

References in notes

• 22D. Adrian, K. Bhargavan, Z. Durumeric, P. Gaudry, M. Green, J. Alex Halderman, N. Heninger, D. Springall, E. Thomé, L. Valenta, B. VanderSloot, E. Wustrow, S. Zanella-Béguelin, P. Zimmermann.
  Imperfect Forward Secrecy: How Diffie-Hellman fails in practice, in: CCS'15, ACM, 2015, pp. 5–17.
  http://dl.acm.org/citation.cfm?doid=2810103.2813707
• 23Agence nationale de la sécurité des systèmes d'information.
  Référentiel général de sécurité, annexe B1, 2014, Version 2.03.
  http://www.ssi.gouv.fr/uploads/2014/11/RGS_v-2-0_B1.pdf
• 24R. Barbulescu, P. Gaudry, A. Joux, E. Thomé.
  A heuristic quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic, in: Eurocrypt 2014, Copenhagen, Denmark, P. Q. Nguyen, E. Oswald (editors), Springer, May 2014, vol. 8441, pp. 1-16. [ DOI : 10.1007/978-3-642-55220-5_1 ]
  https://hal.inria.fr/hal-00835446
• 25F. Bihan, P.-J. Spaenlehauer.
  Sparse polynomial systems with many positive solutions from bipartite simplicial complexes, 2015, arXiv preprint arXiv:1510.05622.
• 26J.-C. Faugère, P.-J. Spaenlehauer, J. Svartz.
  Sparse Gröbner bases: the unmixed case, in: ISSAC 2014, K. Nabeshima (editor), ACM, 2014, pp. 178–185, Proceedings.
• 27J.-C. Faugère, M. Safey El Din, P.-J. Spaenlehauer.
  Gröbner Bases of Bihomogeneous Ideals generated by Polynomials of Bidegree $(1,1)$: Algorithms and Complexity, in: J. Symbolic Comput., 2011, vol. 46, n^o 4, pp. 406–437.
• 28P. Gaudry, É. Schost.
  Genus 2 point counting over prime fields, in: J. Symbolic Comput., 2011, vol. 47, n^o 4, pp. 368–400.
• 29R. Granger, T. Kleinjung, J. Zumbrägel.
  On the Powers of 2, 2014, Cryptology ePrint Archive report.
  http://eprint.iacr.org/2014/300
• 30F. Göloglu, R. Granger, J. McGuire.
  On the Function Field Sieve and the Impact of Higher Splitting Probabilities, in: CRYPTO 2013, R. Canetti, J. A. Garay (editors), Lecture Notes in Comput. Sci., Springer–Verlag, 2013, vol. 8043, pp. 109–128, Proceedings, Part II.
• 31A. Joux.
  A New Index Calculus Algorithm with Complexity $L(1/4+o(1\left)\right)$ in Small Characteristic, in: Selected Areas in Cryptography – SAC 2013, T. Lange, K. Lauter, P. Lisoněk (editors), Lecture Notes in Comput. Sci., Springer–Verlag, 2014, vol. 8282, pp. 355–379, Proceedings.
  http://dx.doi.org/10.1007/978-3-662-43414-7_18
• 32T. Kleinjung, K. Aoki, J. Franke, A. K. Lenstra, E. Thomé, J. Bos, P. Gaudry, A. Kruppa, P. L. Montgomery, D. A. Osvik, H. te Riele, A. Timofeev, P. Zimmermann.
  Factorization of a 768-bit RSA modulus, in: CRYPTO 2010, T. Rabin (editor), Lecture Notes in Comput. Sci., Springer–Verlag, 2010, vol. 6223, pp. 333–350, Proceedings.
• 33N. Koblitz, A. J. Menezes.
  A Riddle Wrapped in an Enigma, 2015, Cryptology ePrint Archive report.
  http://eprint.iacr.org/2015/1018
• 34A. Langley, M. Hamburg, S. Turner.
  Elliptic Curves for Security, 2016, RFC 7748.
  https://tools.ietf.org/html/rfc7748
• 35P. L. Montgomery.
  A block Lanczos algorithm for finding dependencies over $\mathrm{GF}\left(2\right)$, in: EUROCRYPT '95, L. C. Guillou, J.-J. Quisquater (editors), Lecture Notes in Comput. Sci., 1995, vol. 921, pp. 106–120, Proceedings.
• 36National Institute of Standards and Technology.
  Transitions: Recommendation for Transitioning the Use of Cryptographic Algorithms and Key Lengths, 2011, First revision.
  http://dx.doi.org/10.6028/NIST.SP.800-131A
• 37National Security Agency.
  Cryptography Today, 2015.
  https://www.nsa.gov/ia/programs/suiteb_cryptography/index.shtml