Questions tagged [pohlig-hellman]

I'm trying to use the Pohlig-Hellman algorithm to solve for $x$ where $15^x=131 \bmod 337$. This is what I have so far: Prime factors of $p-1$: $336=2^4\cdot3\cdot7$ $q=2$: $x=2^0\cdot x_0+2^1\cdot x_1+2^2\cdot x_2+2^3\cdot x_3$ $x_0$:…

I need to use Pohlig-Hellman exponentiation cipher for reasons explained here. However, I can't seem to find an implementation of this cipher anywhere. It doesn't seem to be too difficult to implement from scratch - so, I want to try. I do have the…

Been reading about Pohlig Hellman algo to solve DLP. But can't seem to get an example based on the following: So if modulus, n is composite (i.e. non-prime) and the base is NOT a generator of Zn. Will PH algo still work and if so, why?

Use the Pohlig-Hellman algorithm to compute a solution to: $3^x\equiv 2 \pmod {65537}$ My attempt: $p-1 = 65537-1 = 65536= 2^{16}$ $x= 2^0x_0+2^1x_1+2^2x_2+...+2^{15}x_{15}$ For $x_0$: $2^{65536/2}=3^{(65536/2)x_0}$ $1 \pmod {65537} \equiv…