Conference paper
FPGA-based coprocessor for text string extraction
N.K. Ratha, A.K. Jain, et al.
Workshop CAMP 2000
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.
N.K. Ratha, A.K. Jain, et al.
Workshop CAMP 2000
Xinyi Su, Guangyu He, et al.
Dianli Xitong Zidonghua/Automation of Electric Power Systems
Robert G. Farrell, Catalina M. Danis, et al.
RecSys 2012
Ziyang Liu, Sivaramakrishnan Natarajan, et al.
VLDB