publications

publications in reversed chronological order

2024

  1. Fast Secure Computations on Shared Polynomials and Applications to Private Set Operations
    Pascal Giorgi, Fabien Laguillaumie, Lucas Ottow, and Damien Vergnaud
    In 5th Conference on Information-Theoretic Cryptography, ITC 2024, August 14-16, 2024, Stanford, CA, USA (Divesh Aggarwal, ed), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Leibniz International Proceedings in Informatics (LIPIcs), vol. to appear, (2024).
    open access
  2. Preliminary Cryptanalysis of the Biscuit Signature Scheme
    Charles Bouillaguet, and Julia Sauvage
    IACR Comm. in Cryptology. 1, 1, (2024).
    open access doi
  3. Towards the Impossibility of Quantum Public Key Encryption with Classical Keys from One-Way Functions
    Samuel Bouaziz-Ermann, Alex B. Grilo, Damien Vergnaud, and Quoc-Huy Vu
    IACR Comm. in Cryptology. 1, 1, (2024).
    open access doi
  4. Secure Multi-Party Linear Algebra with Perfect Correctness
    Jules Maire, and Damien Vergnaud
    IACR Comm. in Cryptology. 1, 1, (2024).
    open access doi
  5. Lattice attacks on pairing-based signatures
    Thierry Mefenza, and Damien Vergnaud
    Inf. Secur. J. A Glob. Perspect. 33, 2, pp. 138-157 (2024).
    open access doi

2023

  1. Mathematical studies of arithmetical pseudo-random numbers generators. (Étude de générateurs pseudo aléatoires en cryptographie mathématique)
    Florette Martinez
    Thèse de doctorat. Sorbonne Université (2023).
    open access
  2. Fault Attacks Sensitivity of Public Parameters in the Dilithium Verification
    Andersson Calle Viera, Alexandre Berzati, and Karine Heydemann
    In Smart Card Research and Advanced Applications - 22nd International Conference, CARDIS 2023, Amsterdam, The Netherlands, November 14-16, 2023, Revised Selected Papers (Shivam Bhasin, and Thomas Roche, eds), Springer, Lecture Notes in Computer Science, vol. 14530, pp. 62–83 (2023).
    open access doi
  3. We are on the Same Side. Alternative Sieving Strategies for the Number Field Sieve
    Charles Bouillaguet, Ambroise Fleury, Pierre-Alain Fouque, and Paul Kirchner
    In Advances in Cryptology - ASIACRYPT 2023 - 29th International Conference on the Theory and Application of Cryptology and Information Security, Guangzhou, China, December 4-8, 2023, Proceedings, Part IV (Jian Guo, and Ron Steinfeld, eds), Springer, Lecture Notes in Computer Science, vol. 14441, pp. 138–166 (2023).
    open access doi
  4. Cryptanalysis of an Outsourced Modular Inversion Protocol
    Charles Bouillaguet
    Math. Cryptol. 3, 1, pp. 29–43 (2023).
    open access doi
  5. Exploiting Intermediate Value Leakage in Dilithium: A Template-Based Approach
    Alexandre Berzati, Andersson Calle Viera, Maya Chartouny, Steven Madec, Damien Vergnaud, and David Vigilant
    IACR Trans. Cryptogr. Hardw. Embed. Syst. 2023, 4, pp. 188–210 (2023).
    open access doi
  6. Cryptanalysis of a Generalized Subset-Sum Pseudorandom Generator
    Charles Bouillaguet, Florette Martinez, and Damien Vergnaud
    In 48th International Symposium on Mathematical Foundations of Computer Science, MFCS 2023, August 28 to September 1, 2023, Bordeaux, France (Jérôme Leroux, Sylvain Lombardy, and David Peleg, eds), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, LIPIcs, vol. 272, pp. 23:1–23:15 (2023).
    open access doi
  7. Reciprocal space temperature-dependent phonons method from ab-initio dynamics
    Ibrahim Buba Garba, Tommaso Morresi, Charles Bouillaguet, Michele Casula, and Lorenzo Paulatto
    Journal of Physics: Condensed Matter 35, 39, pp. 395402 (2023).
    open access doi
  8. VerifMSI: Practical Verification of Hardware and Software Masking Schemes Implementations
    Quentin L. Meunier, and Abdul Rahman Taleb
    In Proceedings of the 20th International Conference on Security and Cryptography, SECRYPT 2023, Rome, Italy, July 10-12, 2023 (Sabrina De Capitani Vimercati, and Pierangela Samarati, eds), SCITEPRESS, pp. 520–527 (2023).
    open access doi
  9. Unifying Freedom and Separation for Tight Probing-Secure Composition
    Sonia Belaı̈d, Gaëtan Cassiers, Matthieu Rivain, and Abdul Rahman Taleb
    In Advances in Cryptology - CRYPTO 2023 - 43rd Annual International Cryptology Conference, CRYPTO 2023, Santa Barbara, CA, USA, August 20-24, 2023, Proceedings, Part III (Helena Handschuh, and Anna Lysyanskaya, eds), Springer, Lecture Notes in Computer Science, vol. 14083, pp. 440–472 (2023).
    open access doi
  10. Quantum security of subset cover problems
    Samuel Bouaziz-Ermann, Alex B. Grilo, and Damien Vergnaud
    In 4th Conference on Information-Theoretic Cryptography, ITC 2023, June 6-8, 2023, Aarhus, Denmark (Kai-Min Chung, ed), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Leibniz International Proceedings in Informatics (LIPIcs), vol. 267, pp. 9:1–9:17 (2023).
    open access doi
  11. Commitments with Efficient Zero-Knowledge Arguments from Subset Sum Problems
    Jules Maire, and Damien Vergnaud
    In Computer Security - ESORICS 2023 - 28th European Symposium on Research in Computer Security, The Hague, The Netherlands, September 25-29, 2023, Proceedings, Part I (Gene Tsudik, Mauro Conti, Kaitai Liang, and Georgios Smaragdakis, eds), Springer, Lecture Notes in Computer Science, vol. 14344, pp. 189–208 (2023).
    open access doi
  12. Efficient Zero-Knowledge Arguments and Digital Signatures via Sharing Conversion in the Head
    Jules Maire, and Damien Vergnaud
    In Computer Security - ESORICS 2023 - 28th European Symposium on Research in Computer Security, The Hague, The Netherlands, September 25-29, 2023, Proceedings, Part I (Gene Tsudik, Mauro Conti, Kaitai Liang, and Georgios Smaragdakis, eds), Springer, Lecture Notes in Computer Science, vol. 14344, pp. 435–454 (2023).
    open access doi

2022

  1. Les attaques cryptographiques sont-elles toujours meilleures que la force brute ?
    Charles Bouillaguet
    Habilitation à diriger des recherches. Sorbonne Université (2022).
    open access
  2. Zero-Knowledge Protocols for the Subset Sum Problem from MPC-in-the-Head with Rejection
    Thibauld Feneuil, Jules Maire, Matthieu Rivain, and Damien Vergnaud
    In Advances in Cryptology - ASIACRYPT 2022 - 28th International Conference on the Theory and Application of Cryptology and Information Security, Taipei, Taiwan, December 5-9, 2022, Proceedings (Shweta Agrawal, and Dongdai Lin, eds), Springer, Lecture Notes in Computer Science, vol. 13792, pp. 371–402 (2022).
    open access doi
  3. On Polynomial Modular Number Systems over Z/pZ
    Jean-Claude Bajard, Jérémy Marrez, Thomas Plantard, and Pascal Véron
    Adv. in Math. of Comm. to appear, (2022).
    open access doi
  4. Practical Seed-Recovery of Fast Cryptographic Pseudo-Random Number Generators
    Florette Martinez
    In Applied Cryptography and Network Security - 20th International Conference, ACNS 2022, Rome, Italy, June 20-23, 2022, Proceedings (Giuseppe Ateniese, and Daniele Venturi, eds), Springer, Lecture Notes in Computer Science, vol. 13269, pp. 212–229 (2022).
    open access doi
  5. Secure storage - Confidentiality and Authentication
    Ryad Benadjila, Louiza Khati, and Damien Vergnaud
    Comput. Sci. Rev. 44, pp. 100465 (2022).
    open access doi
  6. IronMask: Versatile Verification of Masking Security
    Sonia Belaı̈d, Darius Mercadier, Matthieu Rivain, and Abdul Rahman Taleb
    In 43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022 IEEE, pp. 142–160 (2022).
    open access doi
  7. Attacks on Pseudo Random Number Generators Hiding a Linear Structure
    Florette Martinez
    In Topics in Cryptology - CT-RSA 2022 - Cryptographers’ Track at the RSA Conference 2022, Virtual Event, March 1-2, 2022, Proceedings (Steven D. Galbraith, ed), Springer, Lecture Notes in Computer Science, vol. 13161, pp. 145–168 (2022).
    open access doi
  8. Cryptanalysis of Modular Exponentiation Outsourcing Protocols
    Charles Bouillaguet, Florette Martinez, and Damien Vergnaud
    Comput. J. 65, 9, pp. 2299-2314 (2022).
    open access doi
  9. A Simple Deterministic Algorithm for Systems of Quadratic Polynomials over F2
    Charles Bouillaguet, Claire Delaplace, and Monika Trimoska
    In 5th SIAM symposium on simplicity in algorithms, SOSA 2022, co-located with SODA 2022, virtual, in January 10–11, 2022. Proceedings. pp. 285-296 (2022).
    open access doi

2021

  1. Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields
    Javad Doliskani, Anand Kumar Narayanan, and Schost
    J. Symb. Comput. 105, pp. 199–213 (2021).
    open access doi
  2. Computational records with aging hardware: Controlling half the output of SHA-256
    Mellila Bouam, Charles Bouillaguet, Claire Delaplace, and Camille Noûs
    Parallel Comput. 106, pp. 102804 (2021).
    open access doi
  3. Privately Outsourcing Exponentiation to a Single Server: Cryptanalysis and Optimal Constructions
    Céline Chevalier, Fabien Laguillaumie, and Damien Vergnaud
    Algorithmica 83, 1, pp. 72–115 (2021).
    open access doi
  4. Speeding-up verification of digital signatures
    Abdul Rahman Taleb, and Damien Vergnaud
    J. Comput. Syst. Sci. 116, pp. 22–39 (2021).
    open access doi
  5. Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND
    Eyal Kushilevitz, Rafail Ostrovsky, Emmanuel Prouff, Adi Rosén, Adrian Thillard, and Damien Vergnaud
    SIAM J. Discret. Math. 35, 1, pp. 465–484 (2021).
    open access doi
  6. Probing Security through Input-Output Separation and Revisited Quasilinear Masking
    Dahmun Goudarzi, Thomas Prest, Matthieu Rivain, and Damien Vergnaud
    IACR Trans. Cryptogr. Hardw. Embed. Syst. 2021, 3, pp. 599–640 (2021).
    open access doi
  7. Hardware security without secure hardware: How to decrypt with a password and a server
    Olivier Blazy, Laura Brouilhet, Céline Chevalier, Patrick Towa, Ida Tucker, and Damien Vergnaud
    Theor. Comput. Sci. 895, pp. 178–211 (2021).
    open access doi
  8. Dynamic Random Probing Expansion with Quasi Linear Asymptotic Complexity
    Sonia Belaı̈d, Matthieu Rivain, Abdul Rahman Taleb, and Damien Vergnaud
    In Advances in Cryptology - ASIACRYPT 2021 - 27th International Conference on the Theory and Application of Cryptology and Information Security, Singapore, December 6-10, 2021, Proceedings, Part II (Mehdi Tibouchi, and Huaxiong Wang, eds), Springer, Lecture Notes in Computer Science, vol. 13091, pp. 157–188 (2021).
    open access doi
  9. On the Power of Expansion: More Efficient Constructions in the Random Probing Model
    Sonia Belaı̈d, Matthieu Rivain, and Abdul Rahman Taleb
    In Advances in Cryptology - EUROCRYPT 2021 - 40th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia, October 17-21, 2021, Proceedings, Part II (Anne Canteaut, and François-Xavier Standaert, eds), Springer, Lecture Notes in Computer Science, vol. 12697, pp. 313–343 (2021).
    open access doi
  10. The Key-Dependent Message Security of Key-Alternating Feistel Ciphers
    Pooya Farshim, Louiza Khati, Yannick Seurin, and Damien Vergnaud
    In Topics in Cryptology - CT-RSA 2021 - Cryptographers’ Track at the RSA Conference 2021, Virtual Event, May 17-20, 2021, Proceedings (Kenneth G. Paterson, ed), Springer, Lecture Notes in Computer Science, vol. 12704, pp. 351–374 (2021).
    open access doi

2020

  1. Leak study of cryptosystem implementations in randomized RNS arithmetic. (Étude des fuites d’implémentations de cryptosystème en arithmétique RNS randomisée)
    Jérôme Courtois
    Thèse de doctorat. Sorbonne Université (2020).
    open access
  2. Lattice algorithms and lattice-based cryptography. (Algorithmes de réseaux et cryptographie basée sur les réseaux)
    Natalia Kharchenko
    Thèse de doctorat. Sorbonne Université (2020).
    open access
  3. A First Approach To Asymmetric White-Box Cryptography and a Study of Permutation Polynomials Modulo 2n in Obfuscation
    Lucas Barthélémy
    Thèse de doctorat. Sorbonne Université (2020).
  4. Aspects algorithmique des réseaux algébriques
    Thomas Espitau
    Thèse de doctorat. Sorbonne Université (2020).
  5. On a Dual/Hybrid Approach to Small Secret LWE - A Dual/Enumeration Technique for Learning with Errors and Application to Security Estimates of FHE Schemes
    Thomas Espitau, Antoine Joux, and Natalia Kharchenko
    In Progress in Cryptology - INDOCRYPT 2020 - 21st International Conference on Cryptology in India, Bangalore, India, December 13-16, 2020, Proceedings (Karthikeyan Bhargavan, Elisabeth Oswald, and Manoj Prabhakaran, eds), Springer, Lecture Notes in Computer Science, vol. 12578, pp. 440–462 (2020).
    open access doi
  6. Practical seed-recovery for the PCG Pseudo-Random Number Generator
    Charles Bouillaguet, Florette Martinez, and Julia Sauvage
    IACR Trans. Symmetric Cryptol. 2020, 3, pp. 175–196 (2020).
    open access doi
  7. Comment on "Efficient and Secure Outsourcing Scheme for RSA Decryption in Internet of Things"
    Damien Vergnaud
    IEEE Internet Things J. 7, 11, pp. 11327–11329 (2020).
    open access doi
  8. Inferring sequences produced by elliptic curve generators using Coppersmith’s methods
    Thierry Mefenza, and Damien Vergnaud
    Theor. Comput. Sci. 830-831, pp. 20-42 (2020).
    open access doi
  9. Public-Key Generation with Verifiable Randomness
    Olivier Blazy, Patrick Towa, and Damien Vergnaud
    In Advances in Cryptology - ASIACRYPT 2020 - 26th International Conference on the Theory and Application of Cryptology and Information Security, Daejeon, South Korea, December 7-11, 2020, Proceedings, Part I (Shiho Moriai, and Huaxiong Wang, eds), Springer, Lecture Notes in Computer Science, vol. 12491, pp. 97–127 (2020).
    open access doi
  10. Succinct Diophantine-Satisfiability Arguments
    Patrick Towa, and Damien Vergnaud
    In Advances in Cryptology - ASIACRYPT 2020 - 26th International Conference on the Theory and Application of Cryptology and Information Security, Daejeon, South Korea, December 7-11, 2020, Proceedings, Part III (Shiho Moriai, and Huaxiong Wang, eds), Springer, Lecture Notes in Computer Science, vol. 12493, pp. 774–804 (2020).
    open access doi
  11. On Decoding Cohen-Haeupler-Schulman Tree Codes
    Anand Kumar Narayanan, and Matthew Weidner
    In Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020 (Shuchi Chawla, ed), SIAM, pp. 1337–1356 (2020).
    open access doi
  12. Certified lattice reduction
    Thomas Espitau, and Antoine Joux
    Adv. in Math. of Comm. 14, 1, pp. 137–159 (2020).
    open access doi

2019

  1. Représentations adaptées à l’arithmétique modulaire et à la résolution de systèmes flous. (Representations adapted to modular arithmetic and fuzzy system resolution)
    Jérémy Marrez
    Thèse de doctorat. Sorbonne Université (2019).
    open access
  2. Relational *-Liftings for Differential Privacy
    Gilles Barthe, Thomas Espitau, Justin Hsu, Tetsuya Sato, and Pierre-Yves Strub
    Logical Methods in Computer Science 15, 4, (2019).
    open access doi
  3. Subquadratic Time Encodable Codes Beating the Gilbert-Varshamov Bound
    Anand Kumar Narayanan, and Matthew Weidner
    IEEE Trans. Inf. Theory 65, 10, pp. 6010–6021 (2019).
    open access doi
  4. Cryptanalysis of Server-Aided RSA Protocols with Private-Key Splitting
    Thierry Mefenza, and Damien Vergnaud
    Comput. J. 62, 8, pp. 1194–1213 (2019).
    open access doi
  5. Polynomial interpolation of the generalized Diffie-Hellman and Naor-Reingold functions
    Thierry Mefenza, and Damien Vergnaud
    Des. Codes Cryptogr. 87, 1, pp. 75–85 (2019).
    open access doi
  6. Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND
    Eyal Kushilevitz, Rafail Ostrovsky, Emmanuel Prouff, Adi Rosén, Adrian Thillard, and Damien Vergnaud
    In Theory of Cryptography - 17th International Conference, TCC 2019, Nuremberg, Germany, December 1-5, 2019, Proceedings, Part II (Dennis Hofheinz, and Alon Rosen, eds), Springer, Lecture Notes in Computer Science, vol. 11892, pp. 386–406 (2019).
    open access doi
  7. Resilience of Randomized RNS Arithmetic with Respect to Side-Channel Leaks of Cryptographic Computation
    Jérôme Courtois, Lokman A. Abbas-Turki, and Jean-Claude Bajard
    IEEE Trans. Computers 68, 12, pp. 1720–1730 (2019).
    open access doi
  8. HyPoRes: An Hybrid Representation System for ECC
    Paulo Martins, Jérémy Marrez, Jean-Claude Bajard, and Leonel Sousa
    In 26th IEEE Symposium on Computer Arithmetic, ARITH 2019, Kyoto, Japan, June 10-12, 2019 (Naofumi Takagi, Sylvie Boldo, and Martin Langhammer, eds), IEEE, pp. 207–214 (2019).
    open access doi
  9. GALACTICS: Gaussian Sampling for Lattice-Based Constant- Time Implementation of Cryptographic Signatures, Revisited
    Gilles Barthe, Sonia Belaı̈d, Thomas Espitau, Pierre-Alain Fouque, Mélissa Rossi, and Mehdi Tibouchi
    In Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, CCS 2019, London, UK, November 11-15, 2019 (Lorenzo Cavallaro, Johannes Kinder, XiaoFeng Wang, and Jonathan Katz, eds), ACM, pp. 2147–2164 (2019).
    open access doi

2018

  1. Towards Efficient Arithmetic for Ring-LWE based Homomorphic Encryption. (Vers une arithmétique efficace pour le chiffrement homomorphe basé sur le Ring-LWE)
    Vincent Zucca
    Thèse de doctorat. Université Pierre et Marie Curie (2018).
    open access
  2. Proving expected sensitivity of probabilistic programs
    Gilles Barthe, Thomas Espitau, Benjamin Grégoire, Justin Hsu, and Pierre-Yves Strub
    Proc. ACM Program. Lang. 2, POPL, pp. 57:1–57:29 (2018).
    open access doi
  3. Loop-Abort Faults on Lattice-Based Signature Schemes and Key Exchange Protocols
    Thomas Espitau, Pierre-Alain Fouque, Benoı̂t Gérard, and Mehdi Tibouchi
    IEEE Trans. Computers 67, 11, pp. 1535–1549 (2018).
    open access doi
  4. LWE Without Modular Reduction and Improved Side-Channel Attacks Against BLISS
    Jonathan Bootle, Claire Delaplace, Thomas Espitau, Pierre-Alain Fouque, and Mehdi Tibouchi
    In Advances in Cryptology - ASIACRYPT 2018 - 24th International Conference on the Theory and Application of Cryptology and Information Security, Brisbane, QLD, Australia, December 2-6, 2018, Proceedings, Part I (Thomas Peyrin, and Steven D. Galbraith, eds), Springer, Lecture Notes in Computer Science, vol. 11272, pp. 494–524 (2018).
    open access doi
  5. An Assertion-Based Program Logic for Probabilistic Programs
    Gilles Barthe, Thomas Espitau, Marco Gaboardi, Benjamin Grégoire, Justin Hsu, and Pierre-Yves Strub
    In Programming Languages and Systems - 27th European Symposium on Programming, ESOP 2018, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Thessaloniki, Greece, April 14-20, 2018, Proceedings (Amal Ahmed, ed), Springer, Lecture Notes in Computer Science, vol. 10801, pp. 117–144 (2018).
    open access doi
  6. Masking the GLP Lattice-Based Signature Scheme at Any Order
    Gilles Barthe, Sonia Belaı̈d, Thomas Espitau, Pierre-Alain Fouque, Benjamin Grégoire, Mélissa Rossi, and Mehdi Tibouchi
    In Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29 - May 3, 2018 Proceedings, Part II (Jesper Buus Nielsen, and Vincent Rijmen, eds), Springer, Lecture Notes in Computer Science, vol. 10821, pp. 354–384 (2018).
    open access doi
  7. Montgomery reduction within the context of residue number system arithmetic
    Jean-Claude Bajard, Julien Eynard, and Nabil Merkiche
    J. Cryptographic Engineering 8, 3, pp. 189–200 (2018).
    open access doi
  8. Malleability of the blockchain’s entropy
    Cécile Pierrot, and Benjamin Wesolowski
    Cryptogr. Commun. 10, 1, pp. 211–233 (2018).
    open access doi
  9. Analysis and Improvement of an Authentication Scheme in Incremental Cryptography
    Louiza Khati, and Damien Vergnaud
    In Selected Areas in Cryptography - SAC 2018 - 25th International Conference, Calgary, AB, Canada, August 15-17, 2018, Revised Selected Papers (Carlos Cid, and Michael J. Jacobson Jr., eds), Springer, Lecture Notes in Computer Science, vol. 11349, pp. 50–70 (2019).
    open access doi
  10. Polynomial factorization over finite fields by computing Euler-Poincaré characteristics of Drinfeld modules
    Anand Kumar Narayanan
    Finite Fields Their Appl. 54, pp. 335–365 (2018).
    open access doi
  11. Fast Computation of Isomorphisms Between Finite Fields Using Elliptic Curves
    Anand Kumar Narayanan
    In Arithmetic of Finite Fields - 7th International Workshop, WAIFI 2018, Bergen, Norway, June 14-16, 2018, Revised Selected Papers (Lilya Budaghyan, and Francisco Rodrı́guez-Henrı́quez, eds), Springer, Lecture Notes in Computer Science, vol. 11321, pp. 74–91 (2018).
    open access doi

2017

  1. Class Group Computations in Number Fields and Applications to Cryptology. (Calcul de Groupes de Classes d’un Corps de Nombres et Applications à la Cryptologie)
    Alexandre Gélin
    Thèse de doctorat. Université Pierre et Marie Curie (2017).
    open access
  2. Reusing Nonces in Schnorr Signatures - (and Keeping It Secure...)
    Marc Beunardeau, Aisling Connolly, Houda Ferradi, Rémi Géraud, David Naccache, and Damien Vergnaud
    In Computer Security - ESORICS 2017 - 22nd European Symposium on Research in Computer Security, Oslo, Norway, September 11-15, 2017, Proceedings, Part I (Simon N. Foley, Dieter Gollmann, and Einar Snekkenes, eds), Springer, Lecture Notes in Computer Science, vol. 10492, pp. 224–241 (2017).
    open access doi
  3. Lattice Attacks on Pairing-Based Signatures
    Thierry Mefenza, and Damien Vergnaud
    In Cryptography and Coding - 16th IMA International Conference, IMACC 2017, Oxford, UK, December 12-14, 2017, Proceedings (Máire O’Neill, ed), Springer, Lecture Notes in Computer Science, vol. 10655, pp. 352–370 (2017).
    open access doi
  4. Arithmetical Improvement of the Round-Off for Cryptosystems in High-Dimensional Lattices
    Paulo Martins, Julien Eynard, Jean-Claude Bajard, and Leonel Sousa
    IEEE Trans. Computers 66, 12, pp. 2005–2018 (2017).
    open access doi
  5. Efficient Reductions in Cyclotomic Rings - Application to Ring-LWE Based FHE Schemes
    Jean-Claude Bajard, Julien Eynard, M. Anwar Hasan, Paulo Martins, Leonel Sousa, and Vincent Zucca
    In Selected Areas in Cryptography - SAC 2017 - 24th International Conference, Ottawa, ON, Canada, August 16-18, 2017, Revised Selected Papers (Carlisle Adams, and Jan Camenisch, eds), Springer, Lecture Notes in Computer Science, vol. 10719, pp. 151–171 (2017).
    open access doi
  6. Side-Channel Attacks on BLISS Lattice-Based Signatures: Exploiting Branch Tracing against strongSwan and Electromagnetic Emanations in Microcontrollers
    Thomas Espitau, Pierre-Alain Fouque, Benoı̂t Gérard, and Mehdi Tibouchi
    In Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, CCS 2017, Dallas, TX, USA, October 30 - November 03, 2017 (Bhavani M. Thuraisingham, David Evans, Tal Malkin, and Dongyan Xu, eds), ACM, pp. 1857–1874 (2017).
    open access doi
  7. Computing Generator in Cyclotomic Integer Rings - A Subfield Algorithm for the Principal Ideal Problem in LΔK(1/2) and Application to the Cryptanalysis of a FHE Scheme
    Jean-François Biasse, Thomas Espitau, Pierre-Alain Fouque, Alexandre Gélin, and Paul Kirchner
    In Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30 - May 4, 2017, Proceedings, Part I (Jean-Sébastien Coron, and Jesper Buus Nielsen, eds), Lecture Notes in Computer Science, vol. 10210, pp. 60–88 (2017).
    open access doi
  8. A Crossbred Algorithm for Solving Boolean Polynomial Systems
    Antoine Joux, and Vanessa Vitse
    In Number-Theoretic Methods in Cryptology - First International Conference, NuTMiC 2017, Warsaw, Poland, September 11-13, 2017, Revised Selected Papers (Jerzy Kaczorowski, Josef Pieprzyk, and Jacek Pomykala, eds), Springer, Lecture Notes in Computer Science, vol. 10737, pp. 3–21 (2017).
    open access doi
  9. Discrete Logarithms in Small Characteristic Finite Fields: a Survey of Recent Advances (Invited Talk)
    Antoine Joux
    In 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany (Heribert Vollmer, and Brigitte Vallée, eds), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, LIPIcs, vol. 66, pp. 3:1–3:1 (2017).
    open access doi
  10. Parametrizations for Families of ECM-Friendly Curves
    Alexandre Gélin, Thorsten Kleinjung, and Arjen K. Lenstra
    In Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2017, Kaiserslautern, Germany, July 25-28, 2017 (Michael A. Burr, Chee K. Yap, and Mohab Safey El Din, eds), ACM, pp. 165–171 (2017).
    open access doi
  11. Loop-Abort Faults on Supersingular Isogeny Cryptosystems
    Alexandre Gélin, and Benjamin Wesolowski
    In Post-Quantum Cryptography - 8th International Workshop, PQCrypto 2017, Utrecht, The Netherlands, June 26-28, 2017, Proceedings (Tanja Lange, and Tsuyoshi Takagi, eds), Springer, Lecture Notes in Computer Science, vol. 10346, pp. 93–106 (2017).
    open access doi
  12. *-Liftings for Differential Privacy
    Gilles Barthe, Thomas Espitau, Justin Hsu, Tetsuya Sato, and Pierre-Yves Strub
    In 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, July 10-14, 2017, Warsaw, Poland (Ioannis Chatzigiannakis, Piotr Indyk, Fabian Kuhn, and Anca Muscholl, eds), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, LIPIcs, vol. 80, pp. 102:1–102:12 (2017).
    open access doi
  13. Proving uniformity and independence by self-composition and coupling
    Gilles Barthe, Thomas Espitau, Benjamin Grégoire, Justin Hsu, and Pierre-Yves Strub
    In LPAR-21, 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Maun, Botswana, May 7-12, 2017 (Thomas Eiter, and David Sands, eds), EasyChair, EPiC Series in Computing, vol. 46, pp. 385–403 (2017).
    open access doi

2016

  1. Le logarithme discret dans les corps finis. (Discrete logarithm in finite fields)
    Cécile Pierrot
    Thèse de doctorat. Université Pierre et Marie Curie (2016).
    open access
  2. Synthesizing Probabilistic Invariants via Doob’s Decomposition
    Gilles Barthe, Thomas Espitau, Luis Marı́a Ferrer Fioriti, and Justin Hsu
    In Computer Aided Verification - 28th International Conference, CAV 2016, Toronto, ON, Canada, July 17-23, 2016, Proceedings, Part I (Swarat Chaudhuri, and Azadeh Farzan, eds), Springer, Lecture Notes in Computer Science, vol. 9779, pp. 43–61 (2016).
    open access doi
  3. Technical history of discrete logarithms in small characteristic finite fields - The road from subexponential to quasi-polynomial complexity
    Antoine Joux, and Cécile Pierrot
    Des. Codes Cryptogr. 78, 1, pp. 73–85 (2016).
    open access doi
  4. Loop-Abort Faults on Lattice-Based Fiat-Shamir and Hash-and-Sign Signatures
    Thomas Espitau, Pierre-Alain Fouque, Benoı̂t Gérard, and Mehdi Tibouchi
    In Selected Areas in Cryptography - SAC 2016 - 23rd International Conference, St. John’s, NL, Canada, August 10-12, 2016, Revised Selected Papers (Roberto Avanzi, and Howard M. Heys, eds), Springer, Lecture Notes in Computer Science, vol. 10532, pp. 140–158 (2016).
    open access doi
  5. Reducing number field defining polynomials: an application to class group computations
    Alexandre Gélin, and Antoine Joux
    LMS J. Comput. Math. 19A, pp. 315–331 (2016).
    open access doi
  6. Nearly sparse linear algebra and application to discrete logarithms computations
    Antoine Joux, and Cécile Pierrot

    open access doi

2015

  1. The Multiple Number Field Sieve with Conjugation and Generalized Joux-Lercier Methods
    Cécile Pierrot
    In Advances in Cryptology - EUROCRYPT 2015 - 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Sofia, Bulgaria, April 26-30, 2015, Proceedings, Part I (Elisabeth Oswald, and Marc Fischlin, eds), Springer, Lecture Notes in Computer Science, vol. 9056, pp. 156–170 (2015).
    open access doi