PPT Slide
Discrete Log Problem for Zk mod p2
Suppose we are given N and <Zk> mod p2 but not k.
Then we can compute ZNk mod p2 in O(log N) time and can derive a relation of the form
using Theorem 7. Hence k can be determined mod p in polynomial time.
Discrete Log Problem for Elliptic Curves mod p
Given (xk,yk) mod p but not the value of Zk or k , there is a polynomial time algorithm (based on the algorithm above) to determine k mod N.