نشـطات البـحـث

7 دكـاترة 2014 - 2024

إصدارات 2003-2021

• 2021
  • Ch. Bouillaguet, C. Delaplace, A. Joux : “Algorithms for Sparse Random 3XOR: The Low-Density Case”, (2021)
• 2020
  • Th. Espitau, A. Joux, N. Kharchenko : “On a Dual/Hybrid Approach to Small Secret LWE”, Progress in Cryptology – INDOCRYPT 2020, vol. 12578, Lecture Notes in Computer Science, Bangalore, India, pp. 440-462, (Springer), (ISBN: 978-3-030-65277-7) (2020)
  • Th. Espitau, A. Joux : “Certified lattice reduction”, Advances in Mathematics of Communications, vol. 14 (1), pp. 137-159, (AIMS) (2020)
• 2018
  • U. Chabaud, E. Diamanti, D. Markham, E. Kashefi, A. Joux : “Optimal quantum-programmable projective measurement with linear optics”, Physical Review A, (American Physical Society) (2018)
• 2017
  • A. Joux : “Discrete Logarithms in Small Characteristic Finite Fields: a Survey of Recent Advances”, 34^th Symposium on Theoretical Aspects of Computer Science (STACS 2017), Hanover, Germany (2017)
• 2016
  • A. Gélin, A. Joux : “Reducing number field defining polynomials: an application to class group computations”, Algorithmic Number Theory Symposium XII, vol. 19 (A), LMS Journal of Computation and Mathematics, Kaiserslautern, Germany, pp. 315-331 (2016)
  • A. Joux, C. Pierrot : “Technical history of discrete logarithms in small characteristic finite fields : The road from subexponential to quasi-polynomial complexity”, Designs, Codes and Cryptography, vol. 78 (1), pp. 73-85, (Springer Verlag) (2016)
  • A. Joux, C. Pierrot : “Nearly Sparse Linear Algebra and application to Discrete Logarithms Computations”, chapter in Contemporary Developments in Finite Fields and Applications, (ISBN: 978-981-4719-27-8) (2016)
• 2014
  • A. Joux, C. Pierrot : “Improving the Polynomial time Precomputation of Frobenius Representation Discrete Logarithm Algorithms - Simplified Setting for Small Characteristic Finite Fields”, 20^th International Conference on the Theory and Application of Cryptology and Information Security, vol. 8873, Lecture Notes in Computer Science, Kaoshiung, Taiwan, Province of China, pp. 378-397, (Springer Berlin Heidelberg) (2014)
  • A. Joux, P.‑A. Fouque, Ch. Mavromati : “Multi-user collisions: Applications to Discrete Logarithm, Even-Mansour and PRINCE”, 20^th International Conference on the Theory and Application of Cryptology and Information Security, vol. 8873, Lecture Notes in Computer Science, Kaoshiung, Taiwan, Province of China, pp. 420-438, (Springer Berlin Heidelberg) (2014)
  • A. Becker, N. Gama, A. Joux : “A sieve algorithm based on overlattices”, LMS Journal of Computation and Mathematics, vol. 17 (Special Issue A), pp. 49-70, (London Mathematical Society) (2014)
  • J. Gutierrez, I. Alvar, A. Joux : “Recovering a sum of two squares decomposition”, Journal of Symbolic Computation, vol. 64, pp. 16-21, (Elsevier) (2014)
  • A. Joux, F. Bastien : “Coding and Cryptography Days 2014: Coding and Cryptography Days 2014”, (2014)
  • J.‑Ch. Faugère, L. Huot, A. Joux, G. Renault, V. Vitse : “Symmetrized summation polynomials: using small order torsion points to speed up elliptic curve index calculus”, EUROCRYPT 2014 - 33^rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, vol. 8441, Lecture Notes in Computer Science, Copenhagen, Denmark, pp. 40-57, (Springer) (2014)
• 2013
  • A. Joux, C. Pierrot : “The Special Number Field Sieve in $\F _{p^{n}}$, Application to Pairing-Friendly Constructions”, 6^th International Conference on Pairing-based Cryptography, Pairing 2013, vol. 8365, Lecture Notes in Computer Science, Beijing, China, pp. 45-61, (Springer International Publishing) (2013)
• 2010
  • J.‑Ch. Faugère, A. Joux, L. Perret, J. Treger : “Cryptanalysis of the Hidden Matrix Cryptosystem”, Progress in Cryptology - LATINCRYPT 2010, vol. 6212, Lecture Notes in Computer Science, Puebla, Mexico, pp. 241-254, (Springer Berlin / Heidelberg) (2010)
• 2003
  • A. Joux, J.‑Ch. Faugère : “Algebraic Cryptanalysis of Hidden Field Equation (HFE) Cryptosystems Using Grobner Bases”, CRYPTO 2003 - 23^rd Annual International Cryptology Conference, vol. 2729, Lecture Notes in Computer Science, Santa Barbara, California, United States, pp. 44-60, (Springer) (2003)