Nombre de documents

28

CV de Antoine Joux


Communication dans un congrès17 documents

  • Razvan Barbulescu, Pierrick Gaudry, Antoine Joux, Emmanuel Thomé. A heuristic quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic. Phong Q. Nguyen and Elisabeth Oswald. Eurocrypt 2014, May 2014, Copenhagen, Denmark. Springer, 8441, pp.1-16, 2014, Advances in Cryptology - EUROCRYPT 2014; Lecture Notes in Computer Science. <10.1007/978-3-642-55220-5_1>. <hal-00835446v2>
  • Pierre-Alain Fouque, Antoine Joux, Chrysanthi Mavromati. Multi-user collisions: Applications to Discrete Logarithm, Even-Mansour and PRINCE (Full version * ). Advances in Cryptology - ASIACRYPT 2014 - 20th International Conference on the Theory and Application of Cryptology and Information Security, Dec 2014, Kaoshiung, Taiwan. Springer, LNCS 8873, pp.20, ASIACRYPT 2014. <http://des.cse.nsysu.edu.tw/asiacrypt2014/>. <hal-01094051>
  • Pierre-Alain Fouque, Antoine Joux, Mehdi Tibouchi. Injective Encodings to Elliptic Curves. Information Security and Privacy - 18th Australasian Conference, Jul 2013, Brisbane, Australia. Springer, LNCS 7959, pp.16, 2013, ACISP 2013. <10.1007/978-3-642-39059-3_14>. <hal-01094294>
  • Anja Becker, Jean-Sébastien Coron, Antoine Joux. Improved Generic Algorithms for Hard Knapsacks. Eurocrypt 2011, May 2011, Tallinn, Estonia. 6632/2011, pp.364-385, 2011, Lecture Notes in Computer Science. <10.1007/978-3-642-20465-4_21>. <hal-00664332>
  • Antoine Joux, Vanessa Vitse. A Variant of the F4 Algorithm. CT-RSA 2011, Feb 2011, San Francisco, United States. Springer, 6558/2011, pp.356-375, 2011, Lecture Notes in Computer Science. <10.1007/978-3-642-19074-2_23>. <hal-00665022>
  • Jean-Sébastien Coron, Antoine Joux, Avradip Mandal, David Naccache, Mehdi Tibouchi. Cryptanalysis of the RSA Subgroup Assumption from TCC 2005. Dario Catalano; Nelly Fazio; Rosario Gennaro; Antonio Nicolosi. PKC 2011 - Proceedings of the 2011 International Conference on Practice and Theory in Public Key Cryptography, Mar 2011, Taormina, Italy. Springer, 6571, pp.147-155, 2011, LNCS - Lecture Notes in Computer Science. <10.1007/978-3-642-19379-8_9>. <hal-01110234>
  • Guilhem Castagnos, Antoine Joux, Fabien Laguillaumie, Phong Q. Nguyen. Factoring pq 2 with Quadratic Forms: Nice Cryptanalyses. 15th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2009, Dec 2009, Tokyo, Japan. Lecture Notes in Computer Science, pp.469 - 486, 2009, <10.1007/978-3-642-10366-7_28>. <hal-01082340>
  • Guilhem Castagnos, Antoine Joux, Fabien Laguillaumie, Phong Q. Nguyen. Factoring pq² with Quadratic Forms: Nice Cryptanalyses. Springer Berlin Heidelberg. ASIACRYPT'2009 - 15th Annual International Conference on the Theory and Application of Cryptology and Information Security, A, Dec 2009, Tokyo, Japan. pp.469-486, 2009, Lecture Notes in Computer Science. <10.1007/978-3-642-10366-7>. <hal-01022756>
  • Antoine Joux, Reynald Lercier, David Naccache, Emmanuel Thomé. Oracle-Assisted Static Diffie-Hellman Is Easier Than Discrete Logarithms. Matthew G. Parker. Twelfth IMA International Conference on Cryptography and Coding, Dec 2009, Cirencester, United Kingdom. Springer Berlin / Heidelberg, 5921, pp.351-367, 2009, Lecture Notes in Computer Science; Cryptography and Coding 12th IMA International Conference, Cryptography and Coding 2009, Cirencester, UK, December 15-17, 2009. Proceedings. <http://www.springerlink.com/content/28420214666n3715/fulltext.pdf>. <10.1007/978-3-642-10868-6_21>. <inria-00337753v2>
  • Antoine Joux, Reynald Lercier. Algorithmes pour résoudre le problème du logarithme discret dans les corps finis. Jean-Marc Couveignes, Reynald Lercier, Robert Rolland. Nouvelles méthodes mathématiques en cryptographie, Jun 2007, Marseille, France. Société Mathématique de France, pp.23-53, 2007. <hal-00603804>
  • Antoine Joux, David Naccache, Emmanuel Thomé. When e-th Roots Become Easier Than Factoring. Kaoru Kurosawa. 13th International Conference on the Theory and Application of Cryptology and Information Security - ASIACRYPT 2007, Dec 2007, Kuching, Malaysia. Springer Berlin / Heidelberg, 4833, pp.13-28, 2007, Lecture Notes in Computer Science; Advances in Cryptology -- ASIACRYPT 2007 13th International Conference on the Theory and Application of Cryptology and Information Security, Kuching, Malaysia, December 2-6, 2007. Proceedings. <10.1007/978-3-540-76900-2_2>. <inria-00187782>
  • Antoine Joux, Reynald Lercier. The Function Field Sieve in the Medium Prime Case. Serge Vaudenay. EUROCRYPT 2006, May 2006, Saint Petersbourg, Russia. Springer, Advances in Cryptology - 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques, 4004, pp.254-270, 2006, Lecture Notes in Computer Science. <10.1007/11761679_16>. <hal-00456191>
  • Antoine Joux, Reynald Lercier, Nigel Smart, Frederik Vercauteren. The Number Field Sieve in the Medium Prime Case. C. Dwork. CRYPTO 2006, Aug 2006, Santa Barbara, United States. Springer, Advances in Cryptology - 26th Annual International Cryptology Conference, 4117, Lecture Notes in Computer Science. <10.1007/11818175_19>. <hal-01102034>
  • Pierre-Alain Fouque, Antoine Joux, Guillaume Poupard. Blockwise Adversarial Model for On-line Ciphers and Symmetric Encryption Schemes. Helena Handschuh and M. Anwar Hasan. Selected Areas in Cryptography, 11th International Workshop, SAC 2004, 2004, Waterloo, Canada. Springer, 3357, pp.212-226, 2004, Lecture Notes in Computer Science. <10.1007/978-3-540-30564-4_15>. <inria-00563962>
  • Pierre-Alain Fouque, Antoine Joux, Gwenaëlle Martinet, Frédéric Valette. Authenticated On-Line Encryption. Mitsuru Matsui and Robert J. Zuccherato. Selected Areas in Cryptography, 10th Annual International Workshop, SAC 2003, 2004, Ottawa, Canada. Springer, 3006, pp.145-159, 2004, Lecture Notes in Computer Science. <10.1007/978-3-540-24654-1_11>. <inria-00563967>
  • Jean-Charles Faugère, Antoine Joux. Algebraic cryptanalysis of hidden field equation (HFE) cryptosystems using Groebner bases. Dan Boneh. 23rd Annual International Cryptology Conference - CRYPTO 03, 2003, Santa Barbara USA, Springer, 2729, pp.44-60, 2003, Lecture Notes in Computer Science. <inria-00099731>
  • Antoine Joux, Reynald Lercier. The Function Field Sieve is quite special. ANTS-V, Jul 2002, Sydney, Australia. Springer, Algorithmic Number Theory: 5th International Symposium, 2369, pp.431-445, Lecture Notes in Computer Science. <10.1007/3-540-45455-1_34>. <hal-01102040>

Pré-publication, Document de travail2 documents

  • Antoine Joux, Cécile Pierrot. Nearly Sparse Linear Algebra. 2015. <hal-01154879>
  • Antoine Joux, Vanessa Vitse. Cover and Decomposition Index Calculus on Elliptic Curves made practical: Application to a previously unreachable curve over Fp6. IF_PREPUB. 2015. <hal-01121942>

Article dans une revue5 documents

  • Antoine Joux, Cécile Pierrot. Technical history of discrete logarithms in small characteristic finite fields : The road from subexponential to quasi-polynomial complexity. Designs, Codes and Cryptography, Springer Verlag, 2016, 78 (1), pp.73-85. <10.1007/s10623-015-0147-6>. <hal-01243676>
  • Alexandre Gélin, Antoine Joux. Reducing number field defining polynomials: an application to class group computations. LMS Journal of Computation and Mathematics, London Mathematical Society, 2016, Algorithmic Number Theory Symposium XII, 19 (A), <10.1112/S1461157016000255>. <hal-01362144>
  • Antoine Joux, Cécile Pierrot. Nearly Sparse Linear Algebra and application to Discrete Logarithms Computations. Review Volume « Contemporary Developments in Finite Fields and Applications » , 2016. <hal-01301496>
  • Antoine Joux, Reynald Lercier. Improvements to the general number field sieve for discrete logarithms in prime fields: A comparison with the Gaussian integer method. Mathematics of Computation / Mathematics of Computation, American Mathematical Society, 2003, 72, pp.953-967. <10.1090/S0025-5718-02-01482-5>. <hal-01102016>
  • Antoine Joux, Reynald Lercier. “Chinese & Match”, an alternative to Atkin's “Match and Sort” method used in the SEA algorithm. Mathematics of Computation, American Mathematical Society, 2001, 70 (234), pp.827-836. <10.1090/S0025-5718-00-01200-X>. <hal-01102024>

Vidéo1 document

  • Antoine Joux, Fanny Bastien. Antoine Joux - Revisiting discrete logarithms in small/medium characteristic finite fields . 2014. <medihal-01346252>

Chapitre d'ouvrage1 document

Autre publication1 document

  • Anja Becker, Jean-Sébastien Coron, Antoine Joux. Improved Generic Algorithms for Hard Knapsacks. IACR Cryptology ePrint Archive 2011. 2011, pp.474. <hal-00666059>

Rapport1 document