Pollard's rho algorithm (Discrete Logarithm Over Finite Fields Logarithm Calculations)

From Algorithm Wiki
Revision as of 12:17, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O({2}^{(n/{2})})$ == Space Complexity == $O({1})$ words (Stores a constant number of O(n)-bit values per iteration) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1978 == Reference == https://www.ams.org/mcom/1978-32-143/S0025-5718-1978-0491431-9/S0025-5718-1978-0491431-9.pdf")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O({2}^{(n/{2})})$

Space Complexity

$O({1})$ words

(Stores a constant number of O(n)-bit values per iteration)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1978

Reference

https://www.ams.org/mcom/1978-32-143/S0025-5718-1978-0491431-9/S0025-5718-1978-0491431-9.pdf

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Pollard%27s_rho_algorithm_(Discrete_Logarithm_Over_Finite_Fields_Logarithm_Calculations)&oldid=45517"