Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Computing discrete logarithms with the parallelized kangaroo method.

From MaRDI portal
Publication:1408372
Jump to:navigation, search

DOI10.1016/S0166-218X(02)00590-5zbMath1044.11107MaRDI QIDQ1408372

Edlyn Teske

Publication date: 15 September 2003

Published in: Discrete Applied Mathematics (Search for Journal in Brave)


zbMATH Keywords

discrete logarithm problemparallelizationrunning timekangaroo method


Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)


Related Items (1)

Accelerating Pollard's rho algorithm on finite fields


Uses Software

  • LiDIA



Cites Work

  • Unnamed Item
  • Parallel collision search with cryptanalytic applications
  • Kangaroos, monopoly and discrete logarithms
  • On random walks for Pollard's rho method
  • Some baby-step giant-step algorithms for the low hamming weight discrete logarithm problem
  • The parallelized Pollard kangaroo method in real quadratic function fields
  • Monte Carlo Methods for Index Computation (mod p)




This page was built for publication: Computing discrete logarithms with the parallelized kangaroo method.

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1408372&oldid=13569181"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 16:30.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki