Quantcast
Channel: Cryptology ePrint Archive
Viewing all articles
Browse latest Browse all 30352

An appendix for a recent paper of Kim, by Razvan Barbulescu

$
0
0
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)).

Viewing all articles
Browse latest Browse all 30352

Trending Articles