- 9
- 3
PZ
Paul Zimmermann
12
Documents
Identifiants chercheurs
- paul-zimmermann
- 0000-0003-0718-4458
- IdRef : 034200282
Présentation
Paul Zimmermann
Paul Zimmermann
Publications
- 3
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 12
- 11
- 4
- 3
- 3
- 3
- 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
- 2
- 1
- 1
- 1
- 2
- 1
- 1
- 1
- 1
- 2
- 1
- 1
- 1
|
The State of the Art in Integer Factoring and Breaking Public-Key CryptographyIEEE Security and Privacy Magazine, 2022, 20 (2), pp.80-86. ⟨10.1109/MSEC.2022.3141918⟩
Article dans une revue
hal-03691141v1
|
|
Nouveaux records de factorisation et de calcul de logarithme discretTechniques de l'Ingénieur, 2020, pp.17
Article dans une revue
hal-03045666v1
|
|
Imperfect forward secrecy: How Diffie-Hellman fails in practiceCommunications of the ACM, 2018, 62 (1), pp.106-114. ⟨10.1145/3292035⟩
Article dans une revue
hal-01982426v1
|
RSA : la fin des clés de 768 bitsTechniques de l'Ingénieur, 2011, IN131, ⟨10.51257/a-v1-in131⟩
Article dans une revue
hal-00641592v1
|
|
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⟩
Communication dans un congrès
hal-02863525v2
|
|
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⟩
Communication dans un congrès
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⟩
Communication dans un congrès
hal-00818124v3
|
|
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⟩
Communication dans un congrès
inria-00612418v1
|
|
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⟩
Communication dans un congrès
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⟩
Communication dans un congrès
inria-00188261v4
|
|
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⟩
Communication dans un congrès
inria-00126462v2
|
|
Factorisation of RSA-220 with CADO-NFS2016
Pré-publication, Document de travail
hal-01315738v1
|