Paul Zimmermann (mathematician) explained

Paul Zimmermann (born 13 November 1964) is a French computational mathematician, working at INRIA.

Education

After engineering studies at École Polytechnique 1984 to 1987, he got a master's degree in computer science in 1988 from University Paris VII and a magister from École Normale Supérieure in mathematics and computer science. His doctoral degree from École Polytechnique in 1991 was entitled Séries génératrices et analyse automatique d’algorithmes,[1] and advised by Philippe Flajolet.[2]

Research

His interests include asymptotically fast arithmetic.

He has developed some of the fastest available code for manipulating polynomials over GF(2),[3] and for calculating hypergeometric constants to billions of decimal places.[4] He is associated with the CARAMEL project to develop efficient arithmetic, in a general context and in particular in the context of algebraic curves of small genus; arithmetic on polynomials of very large degree turns out to be useful in algorithms for point-counting on such curves. He is also interested in computational number theory. In particular, he has contributed to some of the record computations in integer factorisation[5] and discrete logarithm.[6]

Zimmermann co-authored the book Computational Mathematics, published in 2018 on SageMath[7] used by Mathematical students worldwide.

In 2010, he co-authored a book on algorithms for computer arithmetic with Richard Brent.[8]

He has been an active developer of the GMP-ECM implementation of the elliptic curve method for integer factorisation and of MPFR, an arbitrary precision floating point library with correct rounding. He is also a coauthor of the CADO-NFS software tool, which was used to factor RSA-240 in record time.[9]

In a 2014 blog post,[10] Zimmermann said that he would refuse invitations to review papers submitted to gold (author-pays) open access and hybrid open access journals, because he disagrees with the publication mechanism.

References

  1. https://members.loria.fr/PZimmermann/cv.pdf CV
  2. https://www.genealogy.math.ndsu.nodak.edu/id.php?id=130639 Paul Zimmermann
  3. Faster Multiplication in GF(2)[x] ]. Paul . Zimmermann . Richard Peirce . Brent . Richard Peirce Brent . Pierrick . Gaudry . Emmanuel . Thomé . Proceedings of ANTS-VIII . 153–166 . 2008 . 10.1007/978-3-540-79456-1 . 5011 . Lecture Notes in Computer Science . Poorten . Alfred J. . Stein . Andreas . 978-3-540-79455-4.
  4. Time- and Space-Efficient Evaluation of Some Hypergeometric Constants . Proceedings of International Symposium on Symbolic and Algebraic Computation (ISSAC) 2007 . 2007 . 85–91 . C. W. . Brown . Paul . Zimmermann . Howard . Cheng . Guillaume . Hanrot . Emmanuel . Thomé . Eugene . Zima.
  5. http://eprint.iacr.org/2010/006 Cryptology ePrint Archive: Report 2010/006
  6. http://eprint.iacr.org/2013/197 Cryptology ePrint Archive: Report 2013/197
  7. Web site: Computational Mathematics with SageMath . Paul . Zimmermann . Alexandre . Casamayou . Nathann . Cohen . Guillaume . Connan . Thierry . Dumont .
  8. Web site: Modern Computer Arithmetic . Paul . Zimmermann . Richard Peirce . Brent . Richard Peirce Brent.
  9. Web site: [Cado-NFS-discuss] 795-bit factoring and discrete logarithms . 2019-12-03 . 2019-12-03 . https://web.archive.org/web/20191203150058/https://lists.gforge.inria.fr/pipermail/cado-nfs-discuss/2019-December/001139.html . dead .
  10. Web site: Why I refuse to review papers submitted to open-access and hybrid journals? . Paul . Zimmermann .

External links