Zimmermann, Paul
Centre National de la Recherche Scientifique · Institut national de recherche en sciences et technologies du numérique · Laboratoire Lorrain de Recherche en Informatique et ses Applications · Université de Lorraine
2 papers on CoChatORCID 0000-0003-0718-4458
Most cited papers
- Verified
Factorization of a 768-Bit RSA Modulus
Kleinjung, T., Aoki, K., Franke, J., Lenstra, A. K., Thomé, E., Bos, J. W., Gaudry, P., Kruppa, A., Montgomery, P. L., Osvik, D. A., et al. (2010) · Lecture Notes in Computer Science
Cryptography and Residue ArithmeticCryptography and Data Security
Cited by 423
- Verified
Comparing the Difficulty of Factorization and Discrete Logarithm: A 240-Digit Experiment
Boudot, F., Gaudry, P., Guillevic, A., Heninger, N., Thomé, E., & Zimmermann, P. (2020) · Lecture Notes in Computer Science
Cryptography and Residue ArithmeticCryptography and Data Security
Cited by 71
Go further with a free account
Verify every reference, keep papers in a library, and ask questions across them.
Sign up - it is free