Indranil R. Bardhan, Sugato Bagchi, et al.
JMIS
A method for determining logarithms in GF (2n) is presented. Its asymptotic running time is O(exp(cn1/3 log2/3 n)) for a small constant c, while, by comparison, Adleman's scheme runs in time O(exp(c′n1/2 1og1/2 n)). The ideas give a dramatic improvement even for moderate-sized fields such as GF (2127), and make (barely) possible computations in fields of size around 2400. The method is not applicable to GF (q) for a large prime q. © 1984 IEEE.
Indranil R. Bardhan, Sugato Bagchi, et al.
JMIS
Robert E. Donovan
INTERSPEECH - Eurospeech 2001
Reena Elangovan, Shubham Jain, et al.
ACM TODAES
Renu Tewari, Richard P. King, et al.
IS&T/SPIE Electronic Imaging 1996