Lambda - Upsilon - Omega: An Assistant Algorithms Analyzer. - Philippe Flajolet; Bruno Salvy; Paul Zimmermann 001 (AAECC, 1988)

Average Case Analysis of Unification Algorithms. - Luc Albert; Rafael Casas; François Fages; A. Torrecillas; Paul Zimmermann 001 (STACS, 1991)

Automatic Average-Case Analysis of Algorithm. - Philippe Flajolet; Bruno Salvy; Paul Zimmermann 001 (Theor. Comput. Sci., 1991)

Séries génératrices et analyse automatique d'algorithmes. (Generating functions and automatic analysis of algorithms). - Paul Zimmermann 001 (1991)

A Calculus of Random Generation. - Philippe Flajolet; Paul Zimmermann 001; Bernard Van Cutsem (ESA, 1993)

A Calculus for the Random Generation of Labelled Combinatorial Structures. - Philippe Flajolet; Paul Zimmermann 001; Bernard Van Cutsem (Theor. Comput. Sci., 1994)

GFUN: a Maple package for the manipulation of generating and holonomic functions in one variable. - Bruno Salvy; Paul Zimmermann 001 (ACM Trans. Math. Softw., 1994)

Function composition and automatic average case analysis. - Paul Zimmermann 001 (Discret. Math., 1995)

Parallelism in MuPAD. - Christian Heckler; Oliver Kluge; Torsten Metzner; Andreas Sorgatz; Paul Zimmermann 001 (SIGSAM Bull., 1997)

Factorization of RSA-140 Using the Number Field Sieve. - Stefania Cavallar; Bruce Dodson; Arjen K. Lenstra; Paul C. Leyland; Walter M. Lioen; Peter L. Montgomery; Brian Murphy; Herman J. J. te Riele; Paul Zimmermann 001 (ASIACRYPT, 1999)

On sums of seven cubes. - François Bertault; Olivier Ramaré; Paul Zimmermann 001 (Math. Comput., 1999)

Uniform Random Generation of Decomposable Structures Using Floating-Point Arithmetic. - Alain Denise; Paul Zimmermann 001 (Theor. Comput. Sci., 1999)

Factorization of a 512-Bit RSA Modulus. - Stefania Cavallar; Bruce Dodson; Arjen K. Lenstra; Walter M. Lioen; Peter L. Montgomery; Brian Murphy; Herman J. J. te Riele; Karen I. Aardal; Jeff Gilchrist; Gérard Guillerm; Paul C. Leyland; Joël Marchand; et al. (EUROCRYPT, 2000)

Factorization in ***[x]: the searching phase. - John Abbott; Victor Shoup; Paul Zimmermann 001 (ISSAC, 2000)

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

Aliquot Sequence 3630 Ends After Reaching 100 Digits. - Manuel Benito; Wolfgang Creyaufmüller; Juan Luis Varona; Paul Zimmermann 001 (Exp. Math., 2002)

A Proof of GMP Square Root. - Yves Bertot; Nicolas Magaud; Paul Zimmermann 001 (J. Autom. Reason., 2002)

Ten consecutive primes in arithmetic progression. - Harvey Dubner; Tony Forbes; Nik Lygeros; Michel Mizony; Harry Nelson; Paul Zimmermann 001 (Math. Comput., 2002)

Worst Cases and Lattice Reduction. - Damien Stehlé; Vincent Lefèvre; Paul Zimmermann 001 (IEEE Symposium on Computer Arithmetic, 2003)

Random Number Generators with Period Divisible by a Mersenne Prime. - Richard P. Brent; Paul Zimmermann 001 (ICCSA (1), 2003)

A fast algorithm for testing reducibility of trinomials mod 2 and some new primitive trinomials of degree 3021377. - Richard P. Brent; Samuli Larvala; Paul Zimmermann 001 (Math. Comput., 2003)

Density results on floating-point invertible numbers. - Guillaume Hanrot; Joël Rivat; Gerald Tenenbaum; Paul Zimmermann 001 (Theor. Comput. Sci., 2003)

A Binary Recursive Gcd Algorithm. - Damien Stehlé; Paul Zimmermann 001 (ANTS, 2004)

The Middle Product Algorithm I. - Guillaume Hanrot; Michel Quercia; Paul Zimmermann 001 (Appl. Algebra Eng. Commun. Comput., 2004)

A long note on Mulders' short product. - Guillaume Hanrot; Paul Zimmermann 001 (J. Symb. Comput., 2004)

Proposal for a Standardization of Mathematical Function Implementation in Floating-Point Arithmetic. - David Defour; Guillaume Hanrot; Vincent Lefèvre; Jean-Michel Muller; Nathalie Revol; Paul Zimmermann 001 (Numer. Algorithms, 2004)

Gal's Accurate Tables Method Revisited. - Damien Stehlé; Paul Zimmermann 001 (IEEE Symposium on Computer Arithmetic, 2005)

An elementary digital plane recognition algorithm. - Yan Gérard; Isabelle Debled-Rennesson; Paul Zimmermann 001 (Discret. Appl. Math., 2005)

Guest editors' introduction: Special issue on practical development of exact real number computation. - Norbert Th. Müller; Martín Hötzel Escardó; Paul Zimmermann 001 (J. Log. Algebraic Methods Program., 2005)

A primitive trinomial of degree 6972593. - Richard P. Brent; Samuli Larvala; Paul Zimmermann 001 (Math. Comput., 2005)

Searching Worst Cases of a One-Variable Function Using Lattice Reduction. - Damien Stehlé; Vincent Lefèvre; Paul Zimmermann 001 (IEEE Trans. Computers, 2005)

Elliptic Curve Method. - Paul Zimmermann 001 (Encyclopedia of Cryptography and Security, 2005)

20 Years of ECM. - Paul Zimmermann 001; Bruce Dodson (ANTS, 2006)

Worst Cases for the Exponential Function in the IEEE 754r decimal64 Format. - Vincent Lefèvre; Damien Stehlé; Paul Zimmermann 001 (Reliable Implementation of Real Number Algorithms, 2006)

Worst Cases of a Periodic Function for Large Arguments. - Guillaume Hanrot; Vincent Lefèvre; Damien Stehlé; Paul Zimmermann 001 (IEEE Symposium on Computer Arithmetic, 2007)

Time-and space-efficient evaluation of some hypergeometric constants. - Howard Cheng; Guillaume Hanrot; Emmanuel Thomé; Paul Zimmermann 001; Eugene V. Zima (ISSAC, 2007)

A gmp-based implementation of schönhage-strassen's large integer multiplication algorithm. - Pierrick Gaudry; Alexander Kruppa; Paul Zimmermann 001 (ISSAC, 2007)

A Multi-level Blocking Distinct Degree Factorization Algorithm - Richard P. Brent; Paul Zimmermann 001 (CoRR, 2007)

Error bounds on complex floating-point multiplication. - Richard P. Brent; Colin Percival; Paul Zimmermann 001 (Math. Comput., 2007)

MPFR: A multiple-precision binary floating-point library with correct rounding. - Laurent Fousse; Guillaume Hanrot; Vincent Lefèvre; Patrick Pélissier; Paul Zimmermann 001 (ACM Trans. Math. Softw., 2007)

Faster Multiplication in GF(2)[x]. - Richard P. Brent; Pierrick Gaudry; Emmanuel Thomé; Paul Zimmermann 001 (ANTS, 2008)

Implementation of the reciprocal square root in MPFR. - Paul Zimmermann 001 (Numerical Validation in Current Hardware Architectures, 2008)

Ten new primitive binary trinomials. - Richard P. Brent; Paul Zimmermann 001 (Math. Comput., 2009)

An O(M(n) logn) Algorithm for the Jacobi Symbol. - Richard P. Brent; Paul Zimmermann 001 (ANTS, 2010)

Reliable Computing with GNU MPFR. - Paul Zimmermann 001 (ICMS, 2010)

An O(M(n) log n) algorithm for the Jacobi symbol - Richard P. Brent; Paul Zimmermann 001 (CoRR, 2010)

Modern Computer Arithmetic (version 0.5.1) - Richard P. Brent; Paul Zimmermann 001 (CoRR, 2010)

The great trinomial hunt - Richard P. Brent; Paul Zimmermann 001 (CoRR, 2010)

Why and How to Use Arbitrary Precision. - Kaveh R. Ghazi; Vincent Lefèvre; Philippe Théveny; Paul Zimmermann 001 (Comput. Sci. Eng., 2010)

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; et al. (IACR Cryptol. ePrint Arch., 2010)

Short Division of Long Integers. - David Harvey; Paul Zimmermann 001 (IEEE Symposium on Computer Arithmetic, 2011)

Ballot stuffing in a postal voting system. - Véronique Cortier; Jérémie Detrey; Pierrick Gaudry; Frédéric Sur; Emmanuel Thomé; Mathieu Turuani; Paul Zimmermann 001 (REVOTE, 2011)

Elliptic Curve Method for Factoring. - Paul Zimmermann 001 (Encyclopedia of Cryptography and Security (2nd Ed.), 2011)

Factorisation of RSA-704 with CADO-NFS. - Shi Bai 001; Emmanuel Thomé; Paul Zimmermann 001 (IACR Cryptol. ePrint Arch., 2012)

Finding Optimal Formulae for Bilinear Maps. - Razvan Barbulescu; Jérémie Detrey; Nicolas Estibals; Paul Zimmermann 001 (IACR Cryptol. ePrint Arch., 2012)

Non-linear polynomial selection for the number field sieve. - Thomas Prest; Paul Zimmermann 001 (J. Symb. Comput., 2012)

Discrete logarithm in GF(2809) with FFS. - Razvan Barbulescu; Cyril Bouvier; Jérémie Detrey; Pierrick Gaudry; Hamza Jeljeli; Emmanuel Thomé; Marion Videau; Paul Zimmermann 001 (IACR Cryptol. ePrint Arch., 2013)

Numerical approximation of The Masser-Gramain constant to four decimal digits: δ = 1.819.... - Guillaume Melquiond; W. Georg Nowak; Paul Zimmermann 001 (Math. Comput., 2013)

Discrete Logarithm in GF(2809) with FFS. - Razvan Barbulescu; Cyril Bouvier; Jérémie Detrey; Pierrick Gaudry; Hamza Jeljeli; Emmanuel Thomé; Marion Videau; Paul Zimmermann 001 (Public Key Cryptography, 2014)

Division-Free Binary-to-Decimal Conversion. - Cyril Bouvier; Paul Zimmermann 001 (IEEE Trans. Computers, 2014)

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

Better polynomials for GNFS. - Shi Bai 001; Cyril Bouvier; Alexander Kruppa; Paul Zimmermann 001 (Math. Comput., 2016)

Optimized Binary64 and Binary128 Arithmetic with GNU MPFR. - Vincent Lefèvre; Paul Zimmermann 001 (ARITH, 2017)

On Various Ways to Split a Floating-Point Number. - Claude-Pierre Jeannerod; Jean-Michel Muller; Paul Zimmermann 001 (ARITH, 2018)

Imperfect forward secrecy: how Diffie-Hellman fails in practice. - David Adrian; Karthikeyan Bhargavan; Zakir Durumeric; Pierrick Gaudry; Matthew Green 001; J. Alex Halderman; Nadia Heninger; Drew Springall; Emmanuel Thomé; Luke Valenta; Benjamin VanderSloot; Eric Wustrow; et al. (Commun. ACM, 2019)

A new ranking function for polynomial selection in the number field sieve. - Nicolas David; Paul Zimmermann 001 (75 Years of Mathematics of Computation, 2020)

Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment. - Fabrice Boudot; Pierrick Gaudry; Aurore Guillevic; Nadia Heninger; Emmanuel Thomé; Paul Zimmermann 001 (IACR Cryptol. ePrint Arch., 2020)

The CORE-MATH Project. - Alexei Sibidanov; Paul Zimmermann 001; Stéphane Glondu (ARITH, 2022)

The State of the Art in Integer Factoring and Breaking Public-Key Cryptography. - Fabrice Boudot; Pierrick Gaudry; Aurore Guillevic; Nadia Heninger; Emmanuel Thomé; Paul Zimmermann 001 (IEEE Secur. Priv., 2022)

Towards a correctly-rounded and fast power function in binary64 arithmetic. - Tom Hubrecht; Claude-Pierre Jeannerod; Paul Zimmermann 001 (ARITH, 2023)

Deciphering Charles Quint (A diplomatic letter from 1547). - Cécile Pierrot; Camille Desenclos; Pierrick Gaudry; Paul Zimmermann 001 (HistoCrypt, 2023)

Correct Rounding in Double Extended Precision. - Sélène Corbineau; Paul Zimmermann 001 (ARITH, 2025)

FastTwoSum revisited. - Claude-Pierre Jeannerod; Paul Zimmermann 001 (ARITH, 2025)