IC Colloquium - Discrete logarithms in small/medium characteristic finite fields
Event details
| Date | 14.11.2013 |
| Hour | 16:15 › 17:30 |
| Speaker | Antoine Joux - UPMC, Université Paris 6, France |
| Location | |
| Category | Conferences - Seminars |
Abstract:
In this talk, we present a new algorithm for the computation of
discrete logarithms in finite fields of small characteristic. This
algorithm combines several previously existing techniques with a few
additional ingredients.
Among those, the most notable is a new method for generating
multiplicative relations with a "systematic side" by composing the
polynomial (X^q-X) with homographies.
This results in an algorithm of quasi-polynomial complexity for discrete
logs in GF(q^k) where k is close to q.
Short bio:
Antoine is the holder of the Cryptology Chair of the Foundation of the
UPMC (Université Pierre et Marie Curie - Paris 6) and a senior security
expert at CryptoExperts. He was formerly a part-time professor at the
Université of Versailles and the head of the scientific division of the
french security agency DCSSI (now known as ANSSI). Together with Dan
Boneh and Matt Franklin, he received the 2013 Gödel prize for his work
on pairing-based cryptography.
In this talk, we present a new algorithm for the computation of
discrete logarithms in finite fields of small characteristic. This
algorithm combines several previously existing techniques with a few
additional ingredients.
Among those, the most notable is a new method for generating
multiplicative relations with a "systematic side" by composing the
polynomial (X^q-X) with homographies.
This results in an algorithm of quasi-polynomial complexity for discrete
logs in GF(q^k) where k is close to q.
Short bio:
Antoine is the holder of the Cryptology Chair of the Foundation of the
UPMC (Université Pierre et Marie Curie - Paris 6) and a senior security
expert at CryptoExperts. He was formerly a part-time professor at the
Université of Versailles and the head of the scientific division of the
french security agency DCSSI (now known as ANSSI). Together with Dan
Boneh and Matt Franklin, he received the 2013 Gödel prize for his work
on pairing-based cryptography.
Links
Practical information
- General public
- Free
Contact
- Host: Arjen Lenstra