Same as blinder, but I found a more efficient solution for this particular . It takes about 4500 operations to work (c.f. 13000 operations using elliptic curve).
The previous solution using elliptic curve is more general. This solution won't work if you select a prime with non-smooth factorization for .
- Work under the polynomial quotient ring of modulo .
- Recover the partial index of using Pohlig-hellman.
- Calculate .
Note: If you haven't read our previous solution using elliptic curve, read it first. The concepts are similar, and I also applied most of the optimizations here.
After the previous solution is finished, I try to figure out how elliptic curve punch some holes in that field, creating a shrinking map to a smaller subgroup which has a smooth order.
Some points not on the curve seems to be the reason, but I still don't know how these things actually works, so let's skip this part.
Elliptic curve works really well on cryptography due to the hardness of its DLP. But clearly, we don't need such thing in this task. Maybe we can work on another simpler structure than elliptic curve.
Here it is: Polynomial quotient ring !!
Polynomial Quotient Ring
Let to be an irreducible polynomial over . The order of multiplicative group in the quotient ring is . In this task, the order is actually , which is almost smooth except for the last factor.
Recover part of the index
It won't be too hard to recover the index of a polynomial in each subgroup except last one. and is a little bit large, so we need to use baby step giant step here. Luckliy, multiplication of polynomial doesn't cost too much operations.
Clearly, there's no efficient way to recover the index in subgroup using oracle only. But we don't need to know that, we already have enough information to reveal what is.
Let's think about what that subgroup is?
It's a group of all constants (i.e. degree 0 polynomials).
So here's how we reveal .
And here's our new script :)