Author pages are created from data sourced from our academic publisher partnerships and public sources.

Publications Influence

Share This Author

MPFR: A multiple-precision binary floating-point library with correct rounding

- Laurent Fousse, G. Hanrot, V. Lefèvre, P. Pélissier, P. Zimmermann
- Computer Science
- TOMS
- 1 June 2007

This article presents a multiple-precision binary floating-point library, written in the ISO C language, and based on the GNU MP library. Its particularity is to extend to arbitrary-precision, ideas… Expand

IEEE Standard for Floating-Point Arithmetic

- D. Zuras, M. Cowlishaw, +89 authors P. Zimmermann
- Computer Science
- 2008

Imperfect Forward Secrecy: How Diffie-Hellman Fails in Practice

- David Adrian, K. Bhargavan, +11 authors P. Zimmermann
- Computer Science
- CCS
- 12 October 2015

TLDR

GFUN: a Maple package for the manipulation of generating and holonomic functions in one variable

- B. Salvy, P. Zimmermann
- Mathematics, Computer Science
- TOMS
- 1 June 1994

We describe the GFUN package which contains functions for manipulating sequences, linear recurrences, or differential equations and generating functions of various types. This article is intended… Expand

A Calculus for the Random Generation of Labelled Combinatorial Structures

- P. Flajolet, P. Zimmermann, B. Cutsem
- Computer Science, Mathematics
- Theor. Comput. Sci.
- 26 September 1994

TLDR

Efficient isolation of polynomial's real roots

- F. Rouillier, P. Zimmermann
- Mathematics
- 2004

This paper revisits an algorithm isolating the real roots of a univariate polynomial using Descartes' rule of signs. It follows work of Vincent, Uspensky, Collins and Akritas, Johnson, Krandick.Our… Expand

Factorization of a 768-Bit RSA Modulus

- T. Kleinjung, Kazumaro Aoki, +10 authors P. Zimmermann
- Mathematics, Computer Science
- CRYPTO
- 15 August 2010

This paper reports on the factorization of the 768-bit number RSA-768 by the number field sieve factoring method and discusses some implications for RSA.

Modern Computer Arithmetic

- R. Brent, P. Zimmermann
- Computer Science
- 1 November 2010

Modern Computer Arithmetic focuses on arbitrary-precision algorithms for efficiently performing arithmetic operations such as addition, multiplication and division, and their connections to topics… Expand

Factorization of a 512-Bit RSA Modulus

- S. Cavallar, B. Dodson, +14 authors P. Zimmermann
- Mathematics, Computer Science
- EUROCRYPT
- 14 May 2000

This paper reports on the factorization of the 512-bit number RSA-155 by the Number Field Sieve factoring method (NFS) and discusses the implications for RSA.

Automatic Average-Case Analysis of Algorithm

- P. Flajolet, B. Salvy, P. Zimmermann
- Computer Science, Mathematics
- Theor. Comput. Sci.
- 1 February 1991

TLDR

...

1

2

3

4

5

...