The Polynomial Composition Problem in (ℤ/nℤ)[X] - Smart Card Research and Advanced Application Access content directly
Conference Papers Year : 2010

The Polynomial Composition Problem in (ℤ/nℤ)[X]

Abstract

Let n be an RSA modulus and let . This paper explores the following problem: Given polynomials and , find polynomial . 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.
Fichier principal
Vignette du fichier
polcomp.pdf (173.63 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01056103 , version 1 (14-08-2014)

Licence

Attribution

Identifiers

Cite

Marc Joye, David Naccache, Stéphanie Porte. The Polynomial Composition Problem in (ℤ/nℤ)[X]. 9th IFIP WG 8.8/11.2 International Conference on Smart Card Research and Advanced Applications (CARDIS), Apr 2010, Passau, Germany. pp.1-12, ⟨10.1007/978-3-642-12510-2_1⟩. ⟨hal-01056103⟩
110 View
112 Download

Altmetric

Share

Gmail Facebook X LinkedIn More