The Polynomial Composition Problem in (Z/nZ)[X]

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

• Type: Conference
• Year: 2010
• Where: CARDIS
• Authors: Marc Joye, David Naccache, Stéphanie Porte
• Keywords: CARDIS 2010, Hardware, Polynomial P, RSA Modulus, RSA Problem