Skip to main content
Conference ProceedingsOPEN ACCESS

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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2010) 6035 LNCS 1-12
DOI: 10.1007/978-3-642-12510-2_1
0Citations
Citations of this article
20Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Let n be an RSA modulus and let ℘,script Q ∈ (ℤ/nℤ)[X]. This paper explores the following problem: Given polynomials script Q and script Q(℘), 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. © IFIP International Federation for Information Processing 2010.

Author supplied keywords

Cite

CITATION STYLE

APA

Joye, M., Naccache, D., & Porte, S. (2010). The Polynomial Composition Problem in (ℤ/nℤ)[X]. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6035 LNCS, pp. 1–12). https://doi.org/10.1007/978-3-642-12510-2_1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free