Skip to Main content Skip to Navigation


...
hal-03045666v1  Journal articles
Fabrice BoudotPierrick GaudryAurore GuillevicNadia HeningerEmmanuel Thomé et al.  Nouveaux records de factorisation et de calcul de logarithme discret
Techniques de l'Ingenieur, Techniques de l'ingénieur, 2020, pp.17
...
hal-00818124v3  Conference papers
Razvan BarbulescuCyril BouvierJérémie DetreyPierrick GaudryHamza Jeljeli et al.  Discrete logarithm in GF($2^{809}$) with FFS
Public-Key Cryptography – PKC 2014, 2014, Buenos Aires, Argentina. ⟨10.1007/978-3-642-54631-0_13⟩
...
hal-01184171v2  Conference papers
David AdrianKarthikeyan BhargavanZakir DurumericPierrick GaudryMatthew Green et al.  Imperfect Forward Secrecy: How Diffie-Hellman Fails in Practice
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⟩
...
inria-00444693v2  Conference papers
Thorsten KleinjungKazumaro AokiJens FrankeArjen LenstraEmmanuel Thomé et al.  Factorization of a 768-bit RSA modulus
Advances in Cryptology – CRYPTO 2010, Aug 2010, Santa Barbara, United States. pp.333-350, ⟨10.1007/978-3-642-14623-7_18⟩
...
hal-01630907v1  Book sections
Richard BrentAlexander KruppaPaul Zimmermann. FFT extension for algebraic-group factorization algorithms
Joppe 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
...
inria-00075591v1  Reports
Paul Zimmermann. ALAS : Un systeme d'analyse algebrique
[Rapport de recherche] RR-0968, INRIA. 1989
...
inria-00069965v1  Reports
Paul Zimmermann. Cinq algorithmes de calcul symbolique
[Rapport de recherche] RT-0206, INRIA. 1997, pp.21
...
hal-00864293v2  Journal articles
Cyril BouvierPaul Zimmermann. Division-Free Binary-to-Decimal Conversion
IEEE Transactions on Computers, Institute of Electrical and Electronics Engineers, 2014, 63 (8), pp.1895-1901. ⟨10.1109/TC.2014.2315621⟩
inria-00424347v1  Books
Richard BrentPaul Zimmermann. Modern Computer Arithmetic
Cambridge University Press, 18, 221 p., 2010, Cambridge Monographs on Applied and Computational Mathematics, 978-0-521-19469-3
...
inria-00077019v1  Reports
Philippe FlajoletPaul Zimmermann. Algorithms seminar, 1991-1992
[Research Report] RR-1779, INRIA. 1992
hal-00641592v1  Journal articles
Pierrick GaudryEmmanuel ThoméPaul Zimmermann. RSA : la fin des clés de 768 bits
Techniques de l'Ingenieur, Techniques de l'ingénieur, 2011
inria-00447968v1  Conference papers
Richard BrentPaul Zimmermann. An O(M(n) log n) algorithm for the Jacobi symbol
9th Algorithmic Number Theory Symposium - ANTS IX, Jul 2010, Nancy, France. pp.83-95, ⟨10.1007/978-3-642-14518-6_10⟩
...
hal-00640165v2  Conference papers
Razvan BarbulescuJérémie DetreyNicolas EstibalsPaul 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⟩
hal-00917726v1  Conference papers
Luc AlbertRafael CasasFrançois FagesA. TorrecillasPaul 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⟩
...
hal-01502326v1  Conference papers
Vincent LefèvrePaul Zimmermann. Optimized Binary64 and Binary128 Arithmetic with GNU MPFR
24th IEEE Symposium on Computer Arithmetic (ARITH 24), Jul 2017, London, United Kingdom. pp.18-26, ⟨10.1109/ARITH.2017.28⟩