A novel algorithm for computing the discrete logarithm modulo 2k that is suitable for fast software or hardware implementation is described. The chosen preferred implementation is based on a linear-time multiplier-less method and has a critical path of less than k modulo 2k shift-and-add operations.
Published in:
Electronics Letters
(Volume:41
,
Issue:
2
)
Date of Publication: 20 Jan. 2005