1. Search
124 results  save search
...
cel-01500109v1  Lectures
Richard Brent, Paul Zimmermann. Modern Computer Arithmetic
Licence. France. 2010
inria-00100175v1  Conference papers
Damien Stehlé, Paul Zimmermann. A Binary Recursive Gcd Algorithm
6th International Symposium on Algorithmic Number Theory - ANTS VI, 2004, Burligton, US, pp.411--425
inria-00100543v1  Journal articles
Paul Zimmermann. Arithmétique en précision arbitraire
Réseaux et systèmes répartis, calculateurs Parallèles, 2001, 13 (4-5), 29 p
inria-00108061v1  Conference papers
Stefania Cavallar, Bruce Dodson, Arjen-K. Lenstra, Paul Leyland, Walter M. Lioen et al.  Factorization of RSA-140 using the Number Field Sieve
International Conference on the Theory and Applications of Cryptology and Information Security - ASIACRYPT'99, Nov 1999, Singapore, Singapore. pp.195-207, ⟨10.1007/b72231⟩
inria-00187614v1  Conference papers
Richard Brent, Paul Zimmermann. A Multi-level Blocking Distinct Degree Factorization Algorithm
8th International Conference on Finite Fields and Applications (Fq8), Jul 2007, Melbourne, Australia
...
inria-00107625v1  Conference papers
Paul Zimmermann. Symbolic Computation: Recent Progress and New Frontiers
International Symposium on Scientific Computing, Computer Arithmetic, and Validated Numerics (SCAN), Sep 2002, none
...
inria-00107518v1  Conference papers
Alain Denise, Isabelle Dutour, Paul Zimmermann. CS: a MuPAD Package for Counting and Randomly Generating Combinatorial Structures
10-th conference Formal Power Series and Algebraic Combinatorics, 1998, Toronto, pp.195-204
...
hal-00818124v3  Conference papers
Razvan Barbulescu, Cyril Bouvier, Jérémie Detrey, Pierrick Gaudry, Hamza Jeljeli et al.  Discrete logarithm in GF($2^{809}$) with FFS
PKC 2014 - International Conference on Practice and Theory of Public-Key Cryptography, 2014, Buenos Aires, Argentina. ⟨10.1007/978-3-642-54631-0_13⟩
...
inria-00074842v1  Reports
Philippe Flajolet, Paul Zimmermann, B. van Custem. A Calculus for the random generation of combinatorial structures
[Research Report] RR-1830, INRIA. 1993
...
hal-00640165v2  Conference papers
Razvan Barbulescu, Jérémie Detrey, Nicolas Estibals, Paul Zimmermann. Finding Optimal Formulae for Bilinear Maps
International Workshop of the Arithmetics of Finite Fields, Ruhr Universitat Bochum, Jul 2012, Bochum, Germany. ⟨10.1007/978-3-642-31662-3_12⟩
...
inria-00071921v1  Reports
Guillaume Hanrot, Michel Quercia, Paul Zimmermann. The Middle Product Algorithm, I.
[Research Report] RR-4664, INRIA. 2002
...
inria-00071931v1  Reports
Guillaume Hanrot, Paul Zimmermann. A long note on Mulders' short product
[Research Report] RR-4654, INRIA. 2002
...
inria-00071999v1  Reports
Damien Stehlé, Vincent Lefèvre, Paul Zimmermann. Worst Cases and Lattice Reduction
[Research Report] RR-4586, INRIA. 2002
...
inria-00072113v1  Reports
Yves Bertot, Nicolas Magaud, Paul Zimmermann. A proof of GMP square root using the Coq assistant
[Research Report] RR-4475, INRIA. 2002
inria-00100057v1  Journal articles
Yan Gérard, Isabelle Debled-Rennesson, Paul Zimmermann. An elementary digital plane recognition algorithm
Discrete Applied Mathematics, Elsevier, 2004, 17 p
...
inria-00107213v1  Directions of work or proceedings
Guillaume Hanrot, Paul Zimmermann. Proceedings of the 7th Conference on Real Numbers and Computers (RNC'7)
Guillaume Hanrot, Paul Zimmermann. None., 151 p., 2006, 2-905267-50-X
...
inria-00188261v4  Conference papers
Richard Brent, Pierrick Gaudry, Emmanuel Thomé, Paul Zimmermann. Faster Multiplication in GF(2)[x]
ANTS-VIII, May 2008, Banff, Canada. pp.153-166, ⟨10.1007/978-3-540-79456-1⟩
inria-00337525v1  Journal articles
Richard Brent, Paul Zimmermann. Ten new primitive binary trinomials
Mathematics of Computation / Mathematics of Computation, American Mathematical Society, 2009, 78 (266), pp.1197-1199
inria-00100147v1  Journal articles
Guillaume Hanrot, Michel Quercia, Paul Zimmermann. The Middle Product Algorithm I. Speeding up the division and square root of power series
Applicable Algebra in Engineering, Communication and Computing, Springer Verlag, 2004, 14 (6), pp.415-438
inria-00100980v1  Book sections
Paul Zimmermann. The Elliptic Curve Method
none. Encyclopedia of Information Security, Kluwer, 2002
...
inria-00072518v1  Reports
Fabrice Rouillier, Paul Zimmermann. Efficient Isolation of a Polynomial Real Roots
[Research Report] RR-4113, INRIA. 2001
...
inria-00072504v1  Reports
Karim Belabas, Guillaume Hanrot, Paul Zimmermann. Tuning and Generalizing Van Hoeij's Algorithm
[Research Report] RR-4124, INRIA. 2001
...
inria-00072675v1  Reports
Guillaume Hanrot, Michel Quercia, Paul Zimmermann. Speeding up the Division and Square Root of Power Series
[Research Report] RR-3973, INRIA. 2000, pp.20
...
inria-00072315v1  Reports
Paul Zimmermann. Arithmétique en précision arbitraire
[Rapport de recherche] RR-4272, INRIA. 2001
...
inria-00072854v1  Reports
Paul Zimmermann. Karatsuba Square Root
[Research Report] RR-3805, INRIA. 1999, pp.8
...
inria-00073535v1  Reports
Christian Heckler, Torsten Metzner, Paul Zimmermann. Progress Report on Parallelism in MuPAD
[Research Report] RR-3154, INRIA. 1997
...
hal-01184171v2  Conference papers
David Adrian, Karthikeyan Bhargavan, Zakir Durumeric, Pierrick Gaudry, Matthew Green et al.  Imperfect Forward Secrecy: How Diffie-Hellman Fails in Practice
ACM CCS 2015, Oct 2015, Denver, Colorado, United States. pp.5-17, ⟨10.1145/2810103.2813707⟩
...
inria-00074936v1  Reports
Paul Zimmermann. Analysis of functions with a finite number of return values
[Research Report] RR-1625, INRIA. 1992
hal-00917726v1  Conference papers
Luc Albert, Rafael Casas, François Fages, A. Torrecillas, Paul Zimmermann. Average Case Analysis of Unification Algorithms
Proceedings of STACS'91 - 8th Annual Symposium on Theoretical Aspects of Computer Science, 1991, Hamburg, Germany. pp.196-213, ⟨10.1007/BFb0020799⟩

Contact

CCSD