Pohlig-Hellman (Discrete Logarithm Over Finite Fields Logarithm Calculations)

From Algorithm Wiki
Revision as of 11:17, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O({2}^{\sqrt{n}})$, only for primes; does much better for composites == Space Complexity == $O({2}^{\sqrt{n}})$ (though only for primes) words (A step in the algorithm involves using baby-steps giant-steps to compute discrete logs; the rest of the algorithm (including CRT and repeated powers) isn't as intensive) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM ==...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O({2}^{\sqrt{n}})$, only for primes; does much better for composites

Space Complexity

$O({2}^{\sqrt{n}})$ (though only for primes) words

(A step in the algorithm involves using baby-steps giant-steps to compute discrete logs; the rest of the algorithm (including CRT and repeated powers) isn't as intensive)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1978

Reference

https://dl-acm-org.ezproxy.canberra.edu.au/citation.cfm?id=2269283

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Pohlig-Hellman_(Discrete_Logarithm_Over_Finite_Fields_Logarithm_Calculations)&oldid=45516"