๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On computing logarithms overGF(2p)

โœ Scribed by Tore Herlestam; Rolf Johannesson

Book ID
105405532
Publisher
Springer Netherlands
Year
1981
Tongue
English
Weight
373 KB
Volume
21
Category
Article
ISSN
0006-3835

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

2-Designs overGF(q)
2-Designs overGF(q)
โœ Hiroshi Suzuki ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Springer Japan ๐ŸŒ English โš– 336 KB
2-designs overGF(2m)
2-designs overGF(2m)
โœ Hiroshi Suzuki ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Springer Japan ๐ŸŒ English โš– 190 KB
Discrete logarithms inGF(p)
Discrete logarithms inGF(p)
โœ Don Coppersmith; Andrew M. Odlzyko; Richard Schroeppel ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› Springer ๐ŸŒ English โš– 862 KB
Computing discrete logarithms with the p
Computing discrete logarithms with the parallelized kangaroo method
โœ 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