[Busec] On the complexity of computing discrete logarithms in the field GF(3^{6·509}) Tuesday September 17 at WPI

Benjamin Fuller bfuller at cs.bu.edu
Thu Sep 12 18:01:36 EDT 2013


I know WPI is a bit of a hike but there is some really interesting research
going on in discrete log right now:


   - *Tuesday, Sept. 17 at 10 am in AK 233::*
   *On the complexity of computing discrete logarithms in the field
   *Presenter:* *Francisco Rodríguez-Henríquez* (CINVESTAV-IPN, Mexico)

   In 2013, Joux, and then Barbulescu, Gaudry, Joux and Thomé, presented
   new algorithms for computing discrete logarithms in finite fields of small
   and medium characteristic. In this talk we show how to combine these new
   algorithms to compute discrete logarithms over the finite field
   GF(3^{6·509}) = GF(3^3054) at a significantly lower complexity than
   previously thought possible. Our concrete analysis shows that the
   supersingular elliptic curve over GF(3^509) with embedding degree 6 that
   had been widely considered for implementing pairing-based cryptosystems at
   the 128-bit security level, in fact provides only a considerably lower
   level of security.
   This is a joint work with Gora Adj, Alfred Menezes and Thomaz Oliveira.

   Francisco Rodríguez-Henríquez received the BSc degree in electrical
   engineering from the University of Puebla, México, in 1989, the MSc degree
   in electrical and computer engineering from the National Institute of
   Astrophysics, Optics and Electronics (INAOE), Mexico, in 1992, and the PhD
   degree in electrical and computer engineering from Oregon State University,
   in 2000. Currently, he is an associate professor at the Computer Science
   Department of CINVESTAV-IPN, Mexico City, México, which he joined in 2002.
   His major research interests are in cryptography and
   finite field arithmetic.
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://cs-mailman.bu.edu/pipermail/busec/attachments/20130912/09dfc1f6/attachment.html>

More information about the Busec mailing list