P
Paul Zimmermann
Researcher at French Institute for Research in Computer Science and Automation
Publications - 106
Citations - 4826
Paul Zimmermann is an academic researcher from French Institute for Research in Computer Science and Automation. The author has contributed to research in topics: Factorization & General number field sieve. The author has an hindex of 26, co-authored 103 publications receiving 4462 citations. Previous affiliations of Paul Zimmermann include University of Lorraine.
Papers
More filters
Journal ArticleDOI
MPFR: A multiple-precision binary floating-point library with correct rounding
TL;DR: This article presents a multiple-precision binary floating-point library, written in the ISO C language, and based on the GNU MP library, to extend to arbitrary- Precision, ideas from the IEEE 754 standard, by providing correct rounding and exceptions.
Proceedings ArticleDOI
Imperfect Forward Secrecy: How Diffie-Hellman Fails in Practice
David Adrian,Karthikeyan Bhargavan,Zakir Durumeric,Pierrick Gaudry,Matthew Green,J. Alex Halderman,Nadia Heninger,Drew Springall,Emmanuel Thomé,Luke Valenta,Benjamin VanderSloot,Eric Wustrow,Santiago Zanella-Béguelin,Paul Zimmermann +13 more
TL;DR: Logjam, a novel flaw in TLS that lets a man-in-the-middle downgrade connections to "export-grade" Diffie-Hellman, is presented and a close reading of published NSA leaks shows that the agency's attacks on VPNs are consistent with having achieved a break.
Journal ArticleDOI
GFUN: a Maple package for the manipulation of generating and holonomic functions in one variable
Bruno Salvy,Paul Zimmermann +1 more
TL;DR: The GFUN package is described which contains functions for manipulating sequences, linear recurrences, or differential equations and generating functions of various types and is intended both as an elementary introduction to the subject and as a reference manual for the package.
Book ChapterDOI
Factorization of a 768-bit RSA modulus
Thorsten Kleinjung,Kazumaro Aoki,Jens Franke,Arjen K. Lenstra,Emmanuel Thomé,Joppe W. Bos,Pierrick Gaudry,Alexander Kruppa,Peter L. Montgomery,Dag Arne Osvik,Herman J. J. te Riele,Andrey Timofeev,Paul Zimmermann +12 more
TL;DR: In this paper, the authors report on the factorization of the 768-bit number RSA-768 by the number field sieve factoring method and discuss some implications for RSA.
Journal ArticleDOI
A calculus for the random generation of labelled combinatorial structures
TL;DR: A general strategy is developed for solving the random generation problem with two closely related types of methods: for structures of size n, the boustrophedonic algorithms exhibit a worst-case behaviour of the form O(n log n); the sequential algorithms have worst case O( n2), while offering good potential for optimizations in the average case.