This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
IEEE Computer Society Annual Symposium on VLSI: New Frontiers in VLSI Design (ISVLSI'05)
Hardware Implementation of an Additive Bit-Serial Algorithm for the Discrete Logarithm Modulo 2^k
Tampa, Florida
May 11-May 12
ISBN: 0-7695-2365-X
L. Li, Southern Methodist University
Alex Fit-Florea, Southern Methodist University
M. A. Thornton, Southern Methodist University
D. W. Matula, Southern Methodist University
We describe the hardware implementation of a novel algorithm for computing the discrete logarithm modulo 2^k. The circuit has a total latency of less than k table-lookup-determined shift-and-add modulo 2^k operations. We introduce a one-to-one mapping between k-bit binary integers and k-bit encodings of a factorization of the integers employing the discrete logarithm. We compare the physical layout result for the circuit when k=8, 16, 32, and 64.
Citation:
L. Li, Alex Fit-Florea, M. A. Thornton, D. W. Matula, "Hardware Implementation of an Additive Bit-Serial Algorithm for the Discrete Logarithm Modulo 2^k," isvlsi, pp.130-135, IEEE Computer Society Annual Symposium on VLSI: New Frontiers in VLSI Design (ISVLSI'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.