# Stéphanie Porte

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.

Learn More

Let n be an RSA modulus and let P, Q ∈ (Z/nZ)[X]. This paper explores the following problem: Given Q and Q(P), find P. We shed light on the connections between the above problem to the RSA problem and derive from it new zero-knowledge protocols.

- ‹
- 1
- ›