Research

Research fields

I use lattices as cryptanalysis tools, to attack existing cryptosystems. Lattice are efficient to solve linear systems, especially when the solution is small (approximation of diophantines equations, zeros of multivariate modular polynomials).
I also try using lattices as construction tools to create new cryptographic protocols, for example identity-based encryption protocoles.

My Ph.D

I did a Ph.D, Mathematical study of pseudo rendom number generators under the supervision of Pr. Damien Vergnaud at Sorbonne Université, LIP6, in the ALMASTY team.
I defended July 2023. My manuscript can be found on HAL.

Publications

The code presented in these publications can be found on my github page.

• Cryptanalysis of a Generalized Subset-Sum Pseudorandom Generator (here)
  C. Bouillaguet, F. Martinez, D. Vergnaud
  International Symposium on Mathematical Fundation of Computer Science (MFCS 2023)
• Practical Seed-Recovery of Fast Cryptographic Pseudo-Random Number Generators (Editor, eprint)
  F. Martinez
  Applied Cryptography for Network Security (ACNS 2022)
• Attack on Pseudo Random Number Generator Hiding a Linear Structure (Editor, eprint)
  F. Martinez
  Cryptographers' Track at RSA (CT-RSA 2022)
• Cryptanalysis of Modular Exponentiation Outsourcing Protocols (Editor, HAL)
  C. Bouillaguet, F. Martinez, D. Vergnaud
  The Computer Journal 2022
• Practical seed-recovery for the PCG Pseudo-random Number Generator (here)
  C. Bouillaguet, F. Martinez, J. Sauvage
  Fast Software Encryption (FSE 2020)