IACR News item: 05 November 2015
Razvan Barbulescu
ePrint Report
This note can be seen as an appendix of a recent paper of
Kim [Kim15]. We show that the discrete logarithm problem in fields GF(Q) where Q = p n wit^ p of medium size and n having a factor of the good size (specified in the article) has a complexity of
L_Q(1/3, (48/9)^(1/3)).
Additional news items may be found on the IACR news page.