Welcome to the resource topic for 2004/224
Title:
The Polynomial Composition Problem in (Z/nZ)[X]
Authors: Marc Joye, David Naccache, Stephanie Porte
Abstract:Let n be an RSA modulus and let P,Q in (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.
ePrint: https://eprint.iacr.org/2004/224
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .