Computing discrete logarithms with the p
โ
Edlyn Teske
๐
Article
๐
2003
๐
Elsevier Science
๐
English
โ 241 KB
The Pollard kangaroo method computes discrete logarithms in arbitrary cyclic groups. It is applied if the discrete logarithm is known to lie in a certain interval, say [a; b], and then has expected running time O( โ b -a) group operations. In its serial version it uses very little storage. It can be