Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

35

CARDIS
2010
Springer

favoriteEmaildiscussreport

175views Hardware» more CARDIS 2010»

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

14 years 5 months ago

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

Download eprint.iacr.org

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), ﬁnd 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.

Marc Joye, David Naccache, Stéphanie Porte

Real-time Traffic

CARDIS 2010 | Hardware | Polynomial P | RSA Modulus | RSA Problem |

claim paper

Related Content

» CrossComposition A New Technique for Kernelization Lower Bounds

» Weak Composite DiffieHellman

» On the Computational Capabilities of Several Models

» A compositional query algebra for secondorder logic and uncertain databases

» Gamut fitting for image composition applications

» FFTBased Dense Polynomial Arithmetic on Multicores

» Verification of arithmetic datapaths using polynomial function models and congruence solvi...

» An Efficient Syntactic Web Service Composition Algorithm Based on the Planning Graph Model

» On the Kernelization Complexity of Colorful Motifs

Post Info
More Details (n/a)

Added	18 May 2010
Updated	18 May 2010
Type	Conference
Year	2010
Where	CARDIS
Authors	Marc Joye, David Naccache, Stéphanie Porte

Comments (0)