✦ LIBER ✦

Discrete logarithms inGF(p)

✍ Scribed by Don Coppersmith; Andrew M. Odlzyko; Richard Schroeppel

Book ID: 105325657
Publisher: Springer
Year: 1986
Tongue: English
Weight: 862 KB
Volume: 1
Category: Article
ISSN: 0178-4617
DOI: 10.1007/bf01840433

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Analysis of the Herlestam and Johannesso

Analysis of the Herlestam and Johannesson discrete logarithm scheme inGF(2N) for largeN

✍ Shimshon Berkovits; Joel E. Sachs 📂 Article 📅 1985 🏛 Springer Netherlands 🌐 English ⚖ 302 KB

Kangaroos, Monopoly and Discrete Logarit

Kangaroos, Monopoly and Discrete Logarithms

✍ J. M. Pollard 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 62 KB

Discrete logarithms for finite groups

✍ Lee C. Klingler; Spyros S. Magliveras; Fred Richman; Michal Sramka 📂 Article 📅 2009 🏛 Springer Vienna 🌐 English ⚖ 217 KB

Computing Discrete Logarithms in Quadrat

Computing Discrete Logarithms in Quadratic Orders

✍ Michael J. Jacobson Jr. 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 121 KB

Computation of discrete logarithms in pr

Computation of discrete logarithms in prime fields

✍ B. A. LaMacchia; A. M. Odlyzko 📂 Article 📅 1991 🏛 Springer 🌐 English ⚖ 929 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