#### Filter Results:

- Full text PDF available (30)

#### Publication Year

2001

2017

- This year (0)
- Last 5 years (17)
- Last 10 years (32)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- David Adrian, Karthikeyan Bhargavan, +11 authors Paul Zimmermann
- ACM Conference on Computer and Communications…
- 2015

We investigate the security of Diffie-Hellman key exchange as used in popular Internet protocols and find it to be less secure than widely believed. First, we present Logjam, a novel flaw in TLS that… (More)

- Thorsten Kleinjung, Kazumaro Aoki, +10 authors Paul Zimmermann
- CRYPTO
- 2010

This paper reports on the factorization of the 768-bit number RSA-768 by the number field sieve factoring method and discusses some implications for RSA.

- Pierrick Gaudry, Emmanuel Thomé, Nicolas Thériault, Claus Diem
- IACR Cryptology ePrint Archive
- 2004

In this article, we examine how the index calculus approach for computing discrete logarithms in small genus hyperelliptic curves can be improved by introducing a double large prime variation. Two… (More)

- Razvan Barbulescu, Pierrick Gaudry, Antoine Joux, Emmanuel Thomé
- EUROCRYPT
- 2014

We present a library for finite field arithmetic. The originality of this library lies in the fact that specialized code is automatically produced for the selected finite fields. The opportunity of… (More)

- Emmanuel Thomé
- J. Symb. Comput.
- 2002

This paper describes a new algorithm for computing linear generators (vector generating polynomials) for matrix sequences, running in subquadratic time. This algorithm applies in particular to the… (More)

- Claus Diem, Emmanuel Thomé
- Journal of Cryptology
- 2007

We study an index calculus algorithm to solve the discrete logarithm problem (DLP) in degree 0 class groups of non-hyperelliptic curves of genus 3 over finite fields. We present a heuristic analysis… (More)

In this paper, we discuss an implementation of various algorithms for multiplying polynomials in GF(2)[x]: variants of the window methods, Karatsuba’s, Toom-Cook’s, Schönhage’s and Cantor’s… (More)

- Razvan Barbulescu, Pierrick Gaudry, Antoine Joux, Emmanuel Thomé
- IACR Cryptology ePrint Archive
- 2013

We present a new discrete logarithm algorithm, in the same vein as in recent works by Joux, using an asymptotically more efficient descent approach. The main result gives a quasi-polynomial heuristic… (More)

- Andreas Enge, Pierrick Gaudry, Emmanuel Thomé
- Journal of Cryptology
- 2010

We present an algorithm for solving the discrete logarithm problem in Jacobians of families of plane curves whose degrees in X and Y are low with respect to their genera. The finite base fields… (More)