Paul Zimmermann

  • INRIA, France

According to our database1, Paul Zimmermann authored at least 72 papers between 1988 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.



In proceedings 
PhD thesis 


Online presence:



Deciphering Charles Quint (A diplomatic letter from 1547).
Proceedings of the 6th International Conference on Historical Cryptology, 2023

Accuracy of Real Time Continuous Glucose Monitoring during Different Liquid Solution Challenges in Healthy Adults: A Randomized Controlled Cross-Over Trial.
Sensors, 2022

The State of the Art in Integer Factoring and Breaking Public-Key Cryptography.
IEEE Secur. Priv., 2022

Is normal backwardation normal? Valuing financial futures with a local index-rate covariance.
Eur. J. Oper. Res., 2022

The CORE-MATH Project.
Proceedings of the 29th IEEE Symposium on Computer Arithmetic, 2022

Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment.
IACR Cryptol. ePrint Arch., 2020

A new ranking function for polynomial selection in the number field sieve.
Proceedings of the 75 Years of Mathematics of Computation, 2020

Imperfect forward secrecy: how Diffie-Hellman fails in practice.
Commun. ACM, 2019

On Various Ways to Split a Floating-Point Number.
Proceedings of the 25th IEEE Symposium on Computer Arithmetic, 2018

Optimized Binary64 and Binary128 Arithmetic with GNU MPFR.
Proceedings of the 24th IEEE Symposium on Computer Arithmetic, 2017

Better polynomials for GNFS.
Math. Comput., 2016

Corrigendum to "A long note on Mulders' short product" [J. Symb. Comput 37 (3) (2004) 391-401].
J. Symb. Comput., 2015

Division-Free Binary-to-Decimal Conversion.
IEEE Trans. Computers, 2014

Discrete Logarithm in GF(2809) with FFS.
Proceedings of the Public-Key Cryptography - PKC 2014, 2014

Numerical approximation of The Masser-Gramain constant to four decimal digits: δ = 1.819....
Math. Comput., 2013

Discrete logarithm in GF(2<sup>809</sup>) with FFS.
IACR Cryptol. ePrint Arch., 2013

Non-linear polynomial selection for the number field sieve.
J. Symb. Comput., 2012

Finding Optimal Formulae for Bilinear Maps.
IACR Cryptol. ePrint Arch., 2012

Factorisation of RSA-704 with CADO-NFS.
IACR Cryptol. ePrint Arch., 2012

Elliptic Curve Method for Factoring.
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

Ballot stuffing in a postal voting system.
Proceedings of the 2011 International Workshop on Requirements Engineering for Electronic Voting Systems, 2011

Short Division of Long Integers.
Proceedings of the 20th IEEE Symposium on Computer Arithmetic, 2011

Factorization of a 768-bit RSA modulus.
IACR Cryptol. ePrint Arch., 2010

Why and How to Use Arbitrary Precision.
Comput. Sci. Eng., 2010

The great trinomial hunt
CoRR, 2010

Modern Computer Arithmetic (version 0.5.1)
CoRR, 2010

An O(M(n) log n) algorithm for the Jacobi symbol
CoRR, 2010

Reliable Computing with GNU MPFR.
Proceedings of the Mathematical Software, 2010

An <i>O</i>(<i>M</i>(<i>n</i>) log<i>n</i>) Algorithm for the Jacobi Symbol.
Proceedings of the Algorithmic Number Theory, 9th International Symposium, 2010

Ten new primitive binary trinomials.
Math. Comput., 2009

Implementation of the reciprocal square root in MPFR.
Proceedings of the Numerical Validation in Current Hardware Architectures, 6.1., 2008

Worst Cases for the Exponential Function in the IEEE 754r decimal64 Format.
Proceedings of the Reliable Implementation of Real Number Algorithms: Theory and Practice, 2008

Faster Multiplication in GF(2)[x].
Proceedings of the Algorithmic Number Theory, 8th International Symposium, 2008

MPFR: A multiple-precision binary floating-point library with correct rounding.
ACM Trans. Math. Softw., 2007

Error bounds on complex floating-point multiplication.
Math. Comput., 2007

A Multi-level Blocking Distinct Degree Factorization Algorithm
CoRR, 2007

A gmp-based implementation of schönhage-strassen's large integer multiplication algorithm.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2007

Time-and space-efficient evaluation of some hypergeometric constants.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2007

Worst Cases of a Periodic Function for Large Arguments.
Proceedings of the 18th IEEE Symposium on Computer Arithmetic (ARITH-18 2007), 2007

20 Years of ECM.
Proceedings of the Algorithmic Number Theory, 7th International Symposium, 2006

Elliptic Curve Method.
Proceedings of the Encyclopedia of Cryptography and Security, 2005

Searching Worst Cases of a One-Variable Function Using Lattice Reduction.
IEEE Trans. Computers, 2005

A primitive trinomial of degree 6972593.
Math. Comput., 2005

Guest editors' introduction: Special issue on practical development of exact real number computation.
J. Log. Algebraic Methods Program., 2005

An elementary digital plane recognition algorithm.
Discret. Appl. Math., 2005

Gal's Accurate Tables Method Revisited.
Proceedings of the 17th IEEE Symposium on Computer Arithmetic (ARITH-17 2005), 2005

Proposal for a Standardization of Mathematical Function Implementation in Floating-Point Arithmetic.
Numer. Algorithms, 2004

A long note on Mulders' short product.
J. Symb. Comput., 2004

The Middle Product Algorithm I.
Appl. Algebra Eng. Commun. Comput., 2004

A Binary Recursive Gcd Algorithm.
Proceedings of the Algorithmic Number Theory, 6th International Symposium, 2004

Density results on floating-point invertible numbers.
Theor. Comput. Sci., 2003

A fast algorithm for testing reducibility of trinomials mod~2 and some new primitive trinomials of degree 3021377.
Math. Comput., 2003

Random Number Generators with Period Divisible by a Mersenne Prime.
Proceedings of the Computational Science and Its Applications, 2003

Worst Cases and Lattice Reduction.
Proceedings of the 16th IEEE Symposium on Computer Arithmetic (Arith-16 2003), 2003

Ten consecutive primes in arithmetic progression.
Math. Comput., 2002

A Proof of GMP Square Root.
J. Autom. Reason., 2002

Aliquot Sequence 3630 Ends After Reaching 100 Digits.
Exp. Math., 2002

De l'algorithmique à l'arithmétique via le calcul formel. (From algorithmics to arithmetic via computer algebra).
, 2001

Factorization in ***[<i>x</i>]: the searching phase.
Proceedings of the 2000 International Symposium on Symbolic and Algebraic Computation, 2000

Uniform Random Generation of Decomposable Structures Using Floating-Point Arithmetic.
Theor. Comput. Sci., 1999

On sums of seven cubes.
Math. Comput., 1999

Factorization of RSA-140 Using the Number Field Sieve.
Proceedings of the Advances in Cryptology, 1999

Parallelism in MuPAD.
SIGSAM Bull., 1997

Function composition and automatic average case analysis.
Discret. Math., 1995

GFUN: a Maple package for the manipulation of generating and holonomic functions in one variable.
ACM Trans. Math. Softw., 1994

A Calculus for the Random Generation of Labelled Combinatorial Structures.
Theor. Comput. Sci., 1994

A Calculus of Random Generation.
Proceedings of the Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30, 1993

Séries génératrices et analyse automatique d'algorithmes. (Generating functions and automatic analysis of algorithms).
PhD thesis, 1991

Automatic Average-Case Analysis of Algorithm.
Theor. Comput. Sci., 1991

Average Case Analysis of Unification Algorithms.
Proceedings of the STACS 91, 1991

Lambda - Upsilon - Omega: An Assistant Algorithms Analyzer.
Proceedings of the Applied Algebra, 1988