|
Towards a correctly-rounded and fast power function in binary64 arithmetic
Tom Hubrecht
,
Claude-Pierre Jeannerod
,
Paul Zimmermann
2023 IEEE 30th Symposium on Computer Arithmetic (ARITH 2023), Sep 2023, Portland, Oregon (USA), United States
Communication dans un congrès
hal-04326201
v1
|
|
Deciphering Charles Quint (A diplomatic letter from 1547)
Cécile Pierrot
,
Camille Desenclos
,
Pierrick Gaudry
,
Paul Zimmermann
6th International Conference on Historical Cryptology, HistoCrypt, Jun 2023, Munich, Germany. pp.148-158, ⟨10.3384/ecp195704⟩
Communication dans un congrès
hal-04083014
v1
|
|
The CORE-MATH Project
Alexei Sibidanov
,
Paul Zimmermann
,
Stéphane Glondu
Communication dans un congrès
hal-03721525
v3
|
|
Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment
Fabrice Boudot
,
Pierrick Gaudry
,
Aurore Guillevic
,
Nadia Heninger
,
Emmanuel Thomé
et al.
Communication dans un congrès
hal-02863525
v2
|
|
On various ways to split a floating-point number
Claude-Pierre Jeannerod
,
Jean-Michel Muller
,
Paul Zimmermann
Communication dans un congrès
hal-01774587
v2
|
|
Optimized Binary64 and Binary128 Arithmetic with GNU MPFR
Vincent Lefèvre
,
Paul Zimmermann
24th IEEE Symposium on Computer Arithmetic (ARITH 24), Jul 2017, London, United Kingdom. pp.18-26, ⟨10.1109/ARITH.2017.28⟩
Communication dans un congrès
hal-01502326
v1
|
|
Imperfect Forward Secrecy: How Diffie-Hellman Fails in Practice
David Adrian
,
Karthikeyan Bhargavan
,
Zakir Durumeric
,
Pierrick Gaudry
,
Matthew Green
et al.
CCS '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⟩
Communication dans un congrès
hal-01184171
v2
|
|
Discrete logarithm in GF($2^{809}$) with FFS
Razvan Barbulescu
,
Cyril Bouvier
,
Jérémie Detrey
,
Pierrick Gaudry
,
Hamza Jeljeli
et al.
Communication dans un congrès
hal-00818124
v3
|
|
Finding Optimal Formulae for Bilinear Maps
Razvan Barbulescu
,
Jérémie Detrey
,
Nicolas Estibals
,
Paul Zimmermann
Communication dans un congrès
hal-00640165
v2
|
|
Ballot stuffing in a postal voting system
Véronique Cortier
,
Jérémie Detrey
,
Pierrick Gaudry
,
Frédéric Sur
,
Emmanuel Thomé
et al.
2011 International Workshop on Requirements Engineering for Electronic Voting Systems (REVOTE 2011), 2011, Trento, Italy. pp.27 - 36, ⟨10.1109/REVOTE.2011.6045913⟩
Communication dans un congrès
inria-00612418
v1
|
|
Short Division of Long Integers
David Harvey
,
Paul Zimmermann
20th IEEE Symposium on Computer Arithmetic (ARITH-20), Jul 2011, Tuebingen, Germany. pp.7-14, ⟨10.1109/ARITH.2011.11⟩
Communication dans un congrès
inria-00612232
v1
|
|
Factorization of a 768-bit RSA modulus
Thorsten Kleinjung
,
Kazumaro Aoki
,
Jens Franke
,
Arjen K. Lenstra
,
Emmanuel Thomé
et al.
Communication dans un congrès
inria-00444693
v2
|
|
An O(M(n) log n) algorithm for the Jacobi symbol
Richard P. Brent
,
Paul Zimmermann
Communication dans un congrès
inria-00447968
v1
|
|
Reliable Computing with GNU MPFR
Paul Zimmermann
Proceedings 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⟩
Communication dans un congrès
istex
hal-00917758
v1
|
|
Faster Multiplication in GF(2)[x]
Richard P. Brent
,
Pierrick Gaudry
,
Emmanuel Thomé
,
Paul Zimmermann
Communication dans un congrès
inria-00188261
v4
|
|
A Multi-level Blocking Distinct Degree Factorization Algorithm
Richard P. Brent
,
Paul Zimmermann
8th International Conference on Finite Fields and Applications (Fq8), Jul 2007, Melbourne, Australia
Communication dans un congrès
inria-00187614
v1
|
|
Time- and Space-Efficient Evaluation of Some Hypergeometric Constants
Howard Cheng
,
Guillaume Hanrot
,
Emmanuel Thomé
,
Eugene Zima
,
Paul Zimmermann
ISSAC '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⟩
Communication dans un congrès
inria-00177850
v1
|
|
How Fast Can We Multiply Over GF(2)[x]?
Paul Zimmermann
Proceedings of Conference on Algorithmic Number Theory 2007, 2007, Turku, Finland. pp.165-170
Communication dans un congrès
hal-00917757
v1
|
|
A GMP-based implementation of Schönhage-Strassen's large integer multiplication algorithm
Pierrick Gaudry
,
Alexander Kruppa
,
Paul Zimmermann
Communication dans un congrès
inria-00126462
v2
|
|
Arithmétique entière
Paul Zimmermann
Journées Nationales de Calcul Formel, 2007, Luminy, France
Communication dans un congrès
hal-00917756
v1
|
|
Worst Cases of a Periodic Function for Large Arguments
Guillaume Hanrot
,
Vincent Lefèvre
,
Damien Stehlé
,
Paul Zimmermann
Communication dans un congrès
inria-00126474
v2
|
|
20 years of ECM
Paul Zimmermann
,
Bruce Dodson
7th Algorithmic Number Theory Symposium (ANTS VII), 2006, Berlin/Germany, Germany. pp.525--542
Communication dans un congrès
inria-00070192
v2
|
|
Can we trust floating-point numbers?
Paul Zimmermann
''Grand Challenges of Informatics'', An Academia Europaea Charles Simonyi John von Neumann Computer Society International Symposium, 2006, Budapest, Hungary
Communication dans un congrès
hal-00917755
v1
|
|
Gal's Accurate Tables Method Revisited
Damien Stehlé
,
Paul Zimmermann
Communication dans un congrès
inria-00000378
v1
|
|
A Binary Recursive Gcd Algorithm
Damien Stehlé
,
Paul Zimmermann
6th International Symposium on Algorithmic Number Theory - ANTS VI, 2004, Burligton, US, pp.411--425
Communication dans un congrès
inria-00100175
v1
|
|
Random number generators with period divisible by a Mersenne prime
Richard P. Brent
,
Paul Zimmermann
International Conference on Computational Science and its Applications - ICCSA'2003, 2003, Montreal, Canada, pp.1-10
Communication dans un congrès
inria-00099723
v1
|
|
Worst Cases and Lattice Reduction
Damien Stehlé
,
Vincent Lefèvre
,
Paul Zimmermann
16th IEEE Symposium on Computer Arithmetic 2003 - ARITH-16'03, 2003, Santiago de Compostela, Espagne, pp.142-147
Communication dans un congrès
inria-00099572
v1
|
|
Algorithms for finding almost irreducible and almost primitive trinomials
Richard P. Brent
,
Paul Zimmermann
Primes and Misdemeanours: Lectures in Honour of the Sixtieth Birthday of Hugh Cowie Williams, 2003, Banff, Canada, France
Communication dans un congrès
inria-00099724
v1
|
|
Accurate Summation: Towards a Simpler and Formal Proof
Laurent Fousse
,
Paul Zimmermann
5th Conference on Real Numbers and Computers 2003 - RNC5, 2003, Lyon, France, 11 p
Communication dans un congrès
inria-00099686
v1
|
|
Symbolic Computation: Recent Progress and New Frontiers
Paul Zimmermann
International Symposium on Scientific Computing, Computer Arithmetic, and Validated Numerics (SCAN), Sep 2002, none
Communication dans un congrès
inria-00107625
v1
|
|
Factorization of a 512-bit RSA Modulus
Stefania Cavallar
,
Bruce Dodson
,
Arjen K. Lenstra
,
Walter Lioen
,
Peter L. Montgomery
et al.
International 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⟩
Communication dans un congrès
istex
inria-00099117
v1
|
|
Factorization in Z[x]: the searching phase
John Abbott
,
Victor Shoup
,
Paul Zimmermann
International Symposium on Symbolic and Algebraic Computation - ISSAC 2000, Aug 2000, St Andrews/United Kingdom, pp.1--7
Communication dans un congrès
inria-00099116
v1
|
|
Unranking of unlabelled decomposable structures
François Bertault
,
Paul Zimmermann
Troisième Conférence International sur les Ensembles Ordonnés, Algorithmes et Applications - Ordal'99, 1999, Montpellier/France, pp.12
Communication dans un congrès
inria-00098835
v1
|
|
Factorization of RSA-140 using the Number Field Sieve
Stefania Cavallar
,
Bruce Dodson
,
Arjen-K. Lenstra
,
Paul Leyland
,
Walter M. Lioen
et al.
International Conference on the Theory and Applications of Cryptology and Information Security - ASIACRYPT'99, Nov 1999, Singapore, Singapore. pp.195-207, ⟨10.1007/b72231⟩
Communication dans un congrès
inria-00108061
v1
|
|
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)
Paul Zimmermann
Foundations of Computational Mathematics, 1999, Oxford, United Kingdom
Communication dans un congrès
hal-00917753
v1
|
|
Sur la division euclidienne d'un nombre premier par son rang
Nik Lygeros
,
Michel Mizony
,
Paul Zimmermann
Journé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
Communication dans un congrès
hal-00917737
v1
|
|
CS: a MuPAD Package for Counting and Randomly Generating Combinatorial Structures
Alain Denise
,
Isabelle Dutour
,
Paul Zimmermann
10-th conference Formal Power Series and Algebraic Combinatorics, 1998, Toronto, pp.195-204
Communication dans un congrès
inria-00107518
v1
|
|
A review of the ODE solvers of Axiom, Derive, Maple, Mathematica, Macsyma, MuPAD and Reduce
Frank Postel
,
Paul Zimmermann
Proceedings of the 5th RHINE workshop on computer algebra, 1996, Saint-Louis, France. pp.2.1--2.10
Communication dans un congrès
hal-00917739
v1
|
|
Gröbner bases in MuPAD: state and future
Klaus Drescher
,
Paul Zimmermann
Proceedings of the PoSSo workshop on software, Paris, 1995, Unknown, pp.177--182
Communication dans un congrès
hal-00917728
v1
|
|
A Calculus of Random Generation
Philippe Flajolet
,
Paul Zimmermann
,
Bernard Van Cutsem
Proceedings of the First European Symposium on Algorithms (ESA'93), 1993, Bad Honnef, Germany. pp.169-180, ⟨10.1007/3-540-57273-2_53⟩
Communication dans un congrès
istex
hal-00917730
v1
|
|
Average Case Analysis of Unification Algorithms
Luc Albert
,
Rafael Casas
,
François Fages
,
A. Torrecillas
,
Paul Zimmermann
Proceedings of STACS'91 - 8th Annual Symposium on Theoretical Aspects of Computer Science, 1991, Hamburg, Germany. pp.196-213, ⟨10.1007/BFb0020799⟩
Communication dans un congrès
istex
hal-00917726
v1
|