Skip to Main content Skip to Navigation
Conference papers

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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [4 references]  Display  Hide  Download

https://hal.inria.fr/hal-01056103
Contributor : Hal Ifip <>
Submitted on : Thursday, August 14, 2014 - 6:27:55 PM
Last modification on : Tuesday, September 22, 2020 - 3:48:03 AM
Long-term archiving on: : Thursday, November 27, 2014 - 1:41:38 AM

File

polcomp.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

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⟩

Share

Metrics

Record views

173

Files downloads

244