- 62
- 61
- 11
- 9
- 5
- 4
- 2
- 2
- 2
- 2
- 1
- 1
PZ
Paul Zimmermann
162
Documents
Researcher identifiers
paul-zimmermann-
0000-0003-0718-4458
- IdRef : 034200282
- VIAF : 29637405
- ISNI : 0000000121260619
Presentation
Paul Zimmermann
Paul Zimmermann
Publications
- 8
- 6
- 5
- 5
- 4
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 18
- 15
- 14
- 13
- 13
- 6
- 5
- 5
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 9
- 4
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 7
- 2
- 3
- 2
- 2
- 3
- 2
- 4
- 1
- 2
- 2
- 5
- 4
- 6
- 3
- 4
- 9
- 5
- 10
- 9
- 9
- 10
- 5
- 6
- 7
- 4
- 5
- 4
- 5
- 5
- 3
- 3
- 2
- 2
- 4
- 1
|
|
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
Conference papers
hal-04326201v1
|
|
|
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⟩
Conference papers
hal-04083014v1
|
|
|
The CORE-MATH ProjectARITH 2022 - 29th IEEE Symposium on Computer Arithmetic, Sep 2022, virtual, France. pp.26-34, ⟨10.1109/ARITH54963.2022.00014⟩
Conference papers
hal-03721525v3
|
|
|
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⟩
Conference papers
hal-02863525v2
|
|
|
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⟩
Conference papers
hal-01774587v2
|
|
|
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⟩
Conference papers
hal-01502326v1
|
|
|
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⟩
Conference papers
hal-01184171v2
|
|
|
Discrete logarithm in GF($2^{809}$) with FFSPublic-Key Cryptography – PKC 2014, 2014, Buenos Aires, Argentina. ⟨10.1007/978-3-642-54631-0_13⟩
Conference papers
hal-00818124v3
|
|
|
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⟩
Conference papers
hal-00640165v2
|
|
|
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⟩
Conference papers
inria-00612418v1
|
Short Division of Long Integers20th IEEE Symposium on Computer Arithmetic (ARITH-20), Jul 2011, Tuebingen, Germany. pp.7-14, ⟨10.1109/ARITH.2011.11⟩
Conference papers
inria-00612232v1
|
|
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⟩
Conference papers
hal-00917758v1
|
|
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⟩
Conference papers
inria-00447968v1
|
|
|
|
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⟩
Conference papers
inria-00444693v2
|
|
|
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⟩
Conference papers
inria-00188261v4
|
|
|
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⟩
Conference papers
inria-00126474v2
|
A Multi-level Blocking Distinct Degree Factorization Algorithm8th International Conference on Finite Fields and Applications (Fq8), Jul 2007, Melbourne, Australia
Conference papers
inria-00187614v1
|
|
|
|
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⟩
Conference papers
inria-00126462v2
|
|
|
Arithmétique entièreJournées Nationales de Calcul Formel, 2007, Luminy, France
Conference papers
hal-00917756v1
|
How Fast Can We Multiply Over GF(2)[x]?Proceedings of Conference on Algorithmic Number Theory 2007, 2007, Turku, Finland. pp.165-170
Conference papers
hal-00917757v1
|
|
|
|
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⟩
Conference papers
inria-00177850v1
|
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
Conference papers
hal-00917755v1
|
|
|
|
20 years of ECM7th Algorithmic Number Theory Symposium (ANTS VII), 2006, Berlin/Germany, Germany. pp.525--542
Conference papers
inria-00070192v2
|
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⟩
Conference papers
inria-00000378v1
|
|
A Binary Recursive Gcd Algorithm6th International Symposium on Algorithmic Number Theory - ANTS VI, 2004, Burligton, US, pp.411--425
Conference papers
inria-00100175v1
|
|
Accurate Summation: Towards a Simpler and Formal Proof5th Conference on Real Numbers and Computers 2003 - RNC5, 2003, Lyon, France, 11 p
Conference papers
inria-00099686v1
|
|
Worst Cases and Lattice Reduction16th IEEE Symposium on Computer Arithmetic 2003 - ARITH-16'03, 2003, Santiago de Compostela, Espagne, pp.142-147
Conference papers
inria-00099572v1
|
|
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
Conference papers
inria-00099723v1
|
|
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
Conference papers
inria-00099724v1
|
|
|
|
Symbolic Computation: Recent Progress and New FrontiersInternational Symposium on Scientific Computing, Computer Arithmetic, and Validated Numerics (SCAN), Sep 2002, none
Conference papers
inria-00107625v1
|
Factorization in Z[x]: the searching phaseInternational Symposium on Symbolic and Algebraic Computation - ISSAC 2000, Aug 2000, St Andrews/United Kingdom, pp.1--7
Conference papers
inria-00099116v1
|
|
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⟩
Conference papers
inria-00099117v1
|
|
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
Conference papers
hal-00917753v1
|
|
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⟩
Conference papers
inria-00108061v1
|
|
Unranking of unlabelled decomposable structuresTroisième Conférence International sur les Ensembles Ordonnés, Algorithmes et Applications - Ordal'99, 1999, Montpellier/France, pp.12
Conference papers
inria-00098835v1
|
|
|
|
CS: a MuPAD Package for Counting and Randomly Generating Combinatorial Structures10-th conference Formal Power Series and Algebraic Combinatorics, 1998, Toronto, pp.195-204
Conference papers
inria-00107518v1
|
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
Conference papers
hal-00917737v1
|
|
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
Conference papers
hal-00917739v1
|
|
Gröbner bases in MuPAD: state and futureProceedings of the PoSSo workshop on software, Paris, 1995, Unknown, pp.177--182
Conference papers
hal-00917728v1
|
|
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⟩
Conference papers
hal-00917730v1
|
|
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⟩
Conference papers
hal-00917726v1
|
|
|
Finding Optimal Formulae for Bilinear MapsAriC Seminar, Mar 2012, Lyon, France
Documents associated with scientific events
hal-01413162v1
|
Computational Mathematics with SageMathSIAM, 2018, 978-1-61197-545-1. ⟨10.1137/1.9781611975468⟩
Books
hal-01646401v1
|
|
|
|
Calcul mathématique avec SageCreateSpace, pp.468, 2013, 9781481191043
Books
inria-00540485v2
|
Modern Computer ArithmeticCambridge University Press, 18, 221 p., 2010, Cambridge Monographs on Applied and Computational Mathematics, 978-0-521-19469-3
Books
inria-00424347v1
|
|
Calcul formel : mode d'emploi. Exemples en MapleSans, pp.326, 2009
Books
inria-00371192v1
|
|
|
|
Proceedings of the 7th Conference on Real Numbers and Computers (RNC'7)Guillaume Hanrot, Paul Zimmermann. None., 151 p., 2006, 2-905267-50-X
Books
inria-00107213v1
|
Special issue on practical development of exact real number computationNorbert Müller and Martin Escardo and Paul Zimmermann. Elsevier, pp.154, 2005
Books
hal-00917738v1
|
|
MuPAD User's ManualWiley Ltd., pp.572, 1996
Books
hal-00917734v1
|
|
Calcul formel : mode d'emploi. Exemples en MapleMasson, 13, pp.328, 1995, Logique mathématiques informatique, 2-225-84780-0
Books
hal-00917735v1
|
|
|
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
Book sections
hal-01630907v1
|
|
|
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⟩
Book sections
inria-00068731v2
|
The Elliptic Curve Methodvan Tilborg, Henk C.A. Encyclopedia of Cryptography and Security, Springer, 2005
Book sections
inria-00000630v1
|
|
Techniques algorithmiques et méthodes de programmationJean-Eric Pin. Encyclopédie de l'informatique et des systèmes d'information, Vuibert, 2005
Book sections
inria-00000664v1
|
|
The Elliptic Curve Methodnone. Encyclopedia of Information Security, Kluwer, 2002
Book sections
inria-00100980v1
|
|
Solving Ordinary Differential EquationsMichael Wester. Computer Algebra Systems: A Practical Guide, John Wiley & Sons Ltd, 1999
Book sections
inria-00098850v1
|
|
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
Book sections
hal-00917752v1
|
Polynomial Factorization Challenges1996
Other publications
hal-00917742v1
|
|
|
Séries génératrices et analyse automatique d'algorithmesInformatique [cs]. Ecole Polytechnique X, 1991. Français. ⟨NNT : ⟩
Theses
tel-00526670v1
|
|
|
De l'algorithmique à l'arithmétique via le calcul formelGénie logiciel [cs.SE]. Université Henri Poincaré - Nancy I, 2001
Accreditation to supervise research
tel-00526731v1
|
|
|
Modern Computer ArithmeticLicence. France. 2010
Lectures
cel-01500109v1
|
|
|
Paul Zimmermann - CADO-NFS2016
Videos
medihal-01346718v1
|