Cryptography Reference
In-Depth Information
FIGURE 13.2
FIGURE 13.3
Pohlig-Hellman Algorithm for Discrete Logs
The Pohlig-Hellman algorithm
p
p
is only effective when a prime modulus
1 consists entirely of small fac-
tors. But in this case, it is very effective. Consider the prime
is such that
p
, and let the prime factoriza-
p
tion of
1 be given by
p
1 =
p
1
e
1
p
2
e
2
...
p
n
e
n
.
Search WWH ::
Custom Search