International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

St\'ephanie Porte

Publications

Year
Venue
Title
2004
EPRINT
The Polynomial Composition Problem in $(\mathbb{Z}/n\mathbb{Z})[X]$
Marc Joye David Naccache St\'ephanie Porte
Let $n$ be an RSA modulus and let $P,Q \in (\mathbb{Z}/n\mathbb{Z})[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.

Coauthors

Marc Joye (1)
David Naccache (1)