Paul Zimmermann
Présentation
Paul Zimmermann
Publications
Publications
|
|
FastTwoSum revisited32nd IEEE Symposium on Computer Arithmetic (ARITH 2025), May 2025, El Paso, TX, United States |
|
|
Correct Rounding in Double Extended Precision32nd IEEE Symposium on Computer Arithmetic, May 2025, El Paso, TX, United States |
|
|
Towards a correctly-rounded and fast power function in binary64 arithmetic2023 IEEE 30th Symposium on Computer Arithmetic (ARITH 2023), Sep 2023, Portland, Oregon (USA), United States |
|
|
Deciphering Charles Quint (A diplomatic letter from 1547)6th International Conference on Historical Cryptology, HistoCrypt, Jun 2023, Munich, Germany. pp.148-158, ⟨10.3384/ecp195704⟩ |
|
|
The CORE-MATH ProjectARITH 2022 - 29th IEEE Symposium on Computer Arithmetic, Sep 2022, virtual, France. pp.26-34, ⟨10.1109/ARITH54963.2022.00014⟩ |
|
|
Comparing the difficulty of factorization and discrete logarithm: a 240-digit experimentAdvances in Cryptology – CRYPTO 2020, Aug 2020, Santa Barbara CA, United States. pp.62-91, ⟨10.1007/978-3-030-56880-1_3⟩ |
|
|
On various ways to split a floating-point numberARITH 2018 - 25th IEEE Symposium on Computer Arithmetic, Jun 2018, Amherst (MA), United States. pp.53-60, ⟨10.1109/ARITH.2018.8464793⟩ |
|
|
Optimized Binary64 and Binary128 Arithmetic with GNU MPFR24th IEEE Symposium on Computer Arithmetic (ARITH 24), Jul 2017, London, United Kingdom. pp.18-26, ⟨10.1109/ARITH.2017.28⟩ |
|
|
Imperfect Forward Secrecy: How Diffie-Hellman Fails in PracticeCCS '15: Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, Oct 2015, Denver, Colorado, United States. pp.5-17, ⟨10.1145/2810103.2813707⟩ |
|
|
Discrete logarithm in GF($2^{809}$) with FFSPublic-Key Cryptography – PKC 2014, 2014, Buenos Aires, Argentina. ⟨10.1007/978-3-642-54631-0_13⟩ |
|
|
Finding Optimal Formulae for Bilinear MapsInternational Workshop of the Arithmetics of Finite Fields, Ruhr Universitat Bochum, Jul 2012, Bochum, Germany. ⟨10.1007/978-3-642-31662-3_12⟩ |
|
|
Ballot stuffing in a postal voting system2011 International Workshop on Requirements Engineering for Electronic Voting Systems (REVOTE 2011), 2011, Trento, Italy. pp.27 - 36, ⟨10.1109/REVOTE.2011.6045913⟩ |
Short Division of Long Integers20th IEEE Symposium on Computer Arithmetic (ARITH-20), Jul 2011, Tuebingen, Germany. pp.7-14, ⟨10.1109/ARITH.2011.11⟩ |
|
|
|
Factorization of a 768-bit RSA modulusAdvances in Cryptology – CRYPTO 2010, Aug 2010, Santa Barbara, United States. pp.333-350, ⟨10.1007/978-3-642-14623-7_18⟩ |
|
|
An O(M(n) log n) algorithm for the Jacobi symbol9th Algorithmic Number Theory Symposium - ANTS IX, Jul 2010, Nancy, France. pp.83-95, ⟨10.1007/978-3-642-14518-6_10⟩ |
Reliable Computing with GNU MPFRProceedings of the third International Congress on Mathematical Software (ICMS 2010), Sep 2010, Kobe, Japan. pp.42--45, ⟨10.1007/978-3-642-15582-6_8⟩ |
|
|
|
Faster Multiplication in GF(2)[x]Algorithmic Number Theory – ANTS-VIII, May 2008, Banff, Canada. pp.153-166, ⟨10.1007/978-3-540-79456-1⟩ |
|
|
Time- and Space-Efficient Evaluation of Some Hypergeometric ConstantsISSAC '07: Proceedings of the 2007 international symposium on Symbolic and algebraic computation, Association for Computing Machinery, Jul 2007, Waterloo, Canada. pp.85-91, ⟨10.1145/1277548.1277561⟩ |
A Multi-level Blocking Distinct Degree Factorization Algorithm8th International Conference on Finite Fields and Applications (Fq8), Jul 2007, Melbourne, Australia |
|
How Fast Can We Multiply Over GF(2)[x]?Proceedings of Conference on Algorithmic Number Theory 2007, 2007, Turku, Finland. pp.165-170 |
|
|
|
Arithmétique entièreJournées Nationales de Calcul Formel, 2007, Luminy, France |
|
|
A GMP-based implementation of Schönhage-Strassen's large integer multiplication algorithmISSAC 2007, Jul 2007, Waterloo, Ontario, Canada. pp.167-174, ⟨10.1145/1277548.1277572⟩ |
|
|
Worst Cases of a Periodic Function for Large Arguments18th IEEE Symposium in Computer Arithmetic, Jun 2007, Montpellier, France. pp.133-140, ⟨10.1109/ARITH.2007.37⟩ |
|
|
20 years of ECM7th Algorithmic Number Theory Symposium (ANTS VII), 2006, Berlin/Germany, Germany. pp.525--542 |
Can we trust floating-point numbers?''Grand Challenges of Informatics'', An Academia Europaea Charles Simonyi John von Neumann Computer Society International Symposium, 2006, Budapest, Hungary |
|
Gal's Accurate Tables Method Revisited17th IEEE Symposium on Computer Arithmetic - ARITH'17, 2005, Cape Cod/USA, pp.236-257, ⟨10.1109/ARITH.2005.24⟩ |
|
A Binary Recursive Gcd Algorithm6th International Symposium on Algorithmic Number Theory - ANTS VI, 2004, Burligton, US, pp.411--425 |
|
Random number generators with period divisible by a Mersenne primeInternational Conference on Computational Science and its Applications - ICCSA'2003, 2003, Montreal, Canada, pp.1-10 |
|
Worst Cases and Lattice Reduction16th IEEE Symposium on Computer Arithmetic 2003 - ARITH-16'03, 2003, Santiago de Compostela, Espagne, pp.142-147 |
|
|
|
Algorithms for finding almost irreducible and almost primitive trinomialsPrimes and Misdemeanours: Lectures in Honour of the Sixtieth Birthday of Hugh Cowie Williams, 2003, Banff, Canada, France |
Accurate Summation: Towards a Simpler and Formal Proof5th Conference on Real Numbers and Computers 2003 - RNC5, 2003, Lyon, France, 11 p |
|
|
|
Symbolic Computation: Recent Progress and New FrontiersInternational Symposium on Scientific Computing, Computer Arithmetic, and Validated Numerics (SCAN), Sep 2002, none |
|
|
Factorization of a 512-bit RSA ModulusInternational Conference on the Theory and Application of Cryptographic Techniques - EUROCRYPT 2000, May 2000, Bruges, Belgium. pp.1-18, ⟨10.1007/3-540-45539-6_1⟩ |
Factorization in Z[x]: the searching phaseInternational Symposium on Symbolic and Algebraic Computation - ISSAC 2000, Aug 2000, St Andrews/United Kingdom, pp.1--7 |
|
Unranking of unlabelled decomposable structuresTroisième Conférence International sur les Ensembles Ordonnés, Algorithmes et Applications - Ordal'99, 1999, Montpellier/France, pp.12 |
|
|
|
Factorization of RSA-140 using the Number Field SieveInternational Conference on the Theory and Applications of Cryptology and Information Security - ASIACRYPT'99, Nov 1999, Singapore, Singapore. pp.195-207, ⟨10.1007/b72231⟩ |
GMP-ECM: yet another implementation of the Elliptic Curve Method (or how to find a 40-digit prime factor within 2 * 10^11 modular multiplications)Foundations of Computational Mathematics, 1999, Oxford, United Kingdom |
|
Sur la division euclidienne d'un nombre premier par son rangJournée de Mathématiques Effectives en l'honneur des 65 ans de René Ouzilou. Pré-Publication numéro 7 du Département de Mathématiques de l'Université Jean Monnet, 1998, Unknown |
|
|
|
CS: a MuPAD Package for Counting and Randomly Generating Combinatorial Structures10-th conference Formal Power Series and Algebraic Combinatorics, Jun 1998, Toronto, Canada. pp.195-204 |
A review of the ODE solvers of Axiom, Derive, Maple, Mathematica, Macsyma, MuPAD and ReduceProceedings of the 5th RHINE workshop on computer algebra, 1996, Saint-Louis, France. pp.2.1--2.10 |
|
Gröbner bases in MuPAD: state and futureProceedings of the PoSSo workshop on software, Paris, 1995, Unknown, pp.177--182 |
|
A Calculus of Random GenerationProceedings of the First European Symposium on Algorithms (ESA'93), 1993, Bad Honnef, Germany. pp.169-180, ⟨10.1007/3-540-57273-2_53⟩ |
|
Average Case Analysis of Unification AlgorithmsProceedings of STACS'91 - 8th Annual Symposium on Theoretical Aspects of Computer Science, 1991, Hamburg, Germany. pp.196-213, ⟨10.1007/BFb0020799⟩ |
|
|
Finding Optimal Formulae for Bilinear MapsAriC Seminar, Mar 2012, Lyon, France |
|
|
Computational Mathematics with SageMathSIAM, 2018, 978-1-61197-545-1. ⟨10.1137/1.9781611975468⟩ |
|
|
Calcul mathématique avec SageCreateSpace, pp.468, 2013, 9781481191043 |
Modern Computer ArithmeticCambridge University Press, 18, 221 p., 2010, Cambridge Monographs on Applied and Computational Mathematics, 978-0-521-19469-3 |
|
Calcul formel : mode d'emploi. Exemples en MapleSans, pp.326, 2009 |
|
|
|
Proceedings of the 7th Conference on Real Numbers and Computers (RNC'7)Guillaume Hanrot, Paul Zimmermann. None., 151 p., 2006, 2-905267-50-X |
Special issue on practical development of exact real number computationNorbert Müller and Martin Escardo and Paul Zimmermann. Elsevier, pp.154, 2005 |
|
MuPAD User's ManualWiley Ltd., pp.572, 1996 |
|
Calcul formel : mode d'emploi. Exemples en MapleMasson, 13, pp.328, 1995, Logique mathématiques informatique, 2-225-84780-0 |
|
|
FFT extension for algebraic-group factorization algorithmsJoppe W. Bos; Arjen K. Lenstra. Topics in Computational Number Theory Inspired by Peter L. Montgomery, Cambridge University Press, pp.189-205, 2017, 978-1-107-10935-3 |
|
|
Worst Cases for the Exponential Function in the IEEE 754r decimal64 FormatP. Hertling; C.M. Hoffmann; W. Luther; N. Revol. Reliable Implementation of Real Number Algorithms: Theory and Practice, 5045, Springer, pp.114-126, 2008, Lecture Notes in Computer Science, 978-3-540-85521-7. ⟨10.1007/978-3-540-85521-7_7⟩ |
Techniques algorithmiques et méthodes de programmationJean-Eric Pin. Encyclopédie de l'informatique et des systèmes d'information, Vuibert, 2005 |
|
The Elliptic Curve Methodvan Tilborg, Henk C.A. Encyclopedia of Cryptography and Security, Springer, 2005 |
|
The Elliptic Curve Methodnone. Encyclopedia of Information Security, Kluwer, 2002 |
|
Solving Ordinary Differential EquationsMichael Wester. Computer Algebra Systems: A Practical Guide, John Wiley & Sons Ltd, 1999 |
|
Calcul formel : ce qu'il y a dans la boîteNicole Berline and Claude Sabbah. Journées X-UPS 97, École Polytechnique, pp.47--62, 1997 |
|
|
Édition d'une lettre chiffrée de Charles Quint à Jean de Saint-Mauris (1547)2025, ⟨10.3384/ecp195704⟩ |
|
|
Déchiffrement d'une lettre de François Ier à Christophe Richer (21 janvier 1547)2025 |
Polynomial Factorization Challenges1996 |
|
|
Time- and Space-Efficient Evaluation of Some Hypergeometric Constants[Research Report] RR-6105, INRIA. 2007 |
|
|
MPFR: A Multiple-Precision Binary Floating-Point Library With Correct Rounding[Research Report] RR-5753, INRIA. 2005, pp.15 |
|
|
Gal's Accurate Tables Method Revisited[Research Report] RR-5359, INRIA. 2004, pp.23 |
|
|
Arithmétique flottante[Rapport de recherche] RR-5105, INRIA. 2004 |
|
|
Proposal for a Standardization of Mathematical Function Implementation in Floating-Point Arithmetic[Research Report] RR-5406, INRIA. 2004 |
A fast and elementary algorithm for digital plane recognition[Intern report] A03-R-332 || gerard03a, 2003, 16 p |
|
|
|
A Binary Recursive Gcd Algorithm[Research Report] RR-5050, INRIA. 2002 |
|
|
A long note on Mulders' short product[Research Report] RR-4654, INRIA. 2002 |
|
|
Worst Cases and Lattice Reduction[Research Report] RR-4586, INRIA. 2002 |
|
|
A proof of GMP square root using the Coq assistant[Research Report] RR-4475, INRIA. 2002 |
|
|
The Middle Product Algorithm, I.[Research Report] RR-4664, INRIA. 2002 |
|
|
Tuning and Generalizing Van Hoeij's Algorithm[Research Report] RR-4124, INRIA. 2001 |
|
|
Efficient Isolation of a Polynomial Real Roots[Research Report] RR-4113, INRIA. 2001 |
|
|
Arithmétique en précision arbitraire[Rapport de recherche] RR-4272, INRIA. 2001 |
A proof of GMP fast division and square root implementations[Intern report] A00-R-211 || zimmermann00a, 2000 |
|
|
|
Speeding up the Division and Square Root of Power Series[Research Report] RR-3973, INRIA. 2000, pp.20 |
A Fast Algorithm for Testing Irreducibility of Trinomials mod 2[Intern report] A00-R-465 || brent00a, 2000, 13 p |
|
Speeding up the inversion of power series[Intern report] A00-R-067 || hanrot00a, 2000, 8 p |
|
|
|
Karatsuba Square Root[Research Report] RR-3805, INRIA. 1999, pp.8 |
|
|
Estimations asymptotiques du nombre de chemins Nord-Est de pente fixée et de largeur bornée[Rapport de recherche] RR-3585, INRIA. 1998, pp.13 |
|
|
Cinq algorithmes de calcul symbolique[Rapport de recherche] RT-0206, INRIA. 1997, pp.21 |
|
|
Progress Report on Parallelism in MuPAD[Research Report] RR-3154, INRIA. 1997 |
|
|
Uniform Random Generation of Decomposable Structures Using Floating-Point Arithmetic[Research Report] RR-3242, INRIA. 1997 |
|
|
A Calculus for the random generation of combinatorial structures[Research Report] RR-1830, INRIA. 1993 |
|
|
EPELLE : un logiciel de detection de fautes d'orthographe[Rapport de recherche] RR-2030, INRIA. 1993 |
|
|
GFUN : a maple package for the manipulation of generating and holonomic functions in one variable[Research Report] RT-0143, INRIA. 1992, pp.14 |
|
|
Algorithms seminar, 1991-1992[Research Report] RR-1779, INRIA. 1992 |
|
|
Analysis of functions with a finite number of return values[Research Report] RR-1625, INRIA. 1992 |
|
|
Average case analysis of unification algorithms[Research Report] RR-1213, INRIA. 1990 |
|
|
Automatic average-case analysis of algorithms[Research Report] RR-1233, INRIA. 1990 |
|
|
BigNum : un module portable et efficace pour une arithmetique a precision arbitraire[Rapport de recherche] RR-1016, INRIA. 1989 |
|
|
The automatic complexity analysis of divide-and-conquer algorithms[Research Report] RR-1149, INRIA. 1989 |
|
|
Lambda-Upsilon-Omega the 1989 cookbook[Research Report] RR-1073, INRIA. 1989 |
|
|
ALAS : Un systeme d'analyse algebrique[Rapport de recherche] RR-0968, INRIA. 1989 |
|
|
Lambda-Upsilon-Omega : an assistant algorithms analyzer[Research Report] RR-0876, INRIA. 1988 |
|
|
Séries génératrices et analyse automatique d'algorithmesInformatique [cs]. Ecole Polytechnique X, 1991. Français. ⟨NNT : ⟩ |
|
|
De l'algorithmique à l'arithmétique via le calcul formelGénie logiciel [cs.SE]. Université Henri Poincaré - Nancy I, 2001 |
|
|
Modern Computer ArithmeticLicence. France. 2010 |
|
|
Paul Zimmermann - CADO-NFS2016 |