On improvements of the $r$-adding walk in a finite field of characteristic 2

Ansari Abdullah, Hardik Gajera, Ayan Mahalanobis

It is currently known from the work of Shoup and Nechaev that a generic algorithm to solve the discrete logarithm problem in a group of prime order must have complexity at least $k…