Paper 2004/224 Original: eprint.iacr.org/2004/224 ↗
The Polynomial Composition Problem in (Z/nZ)[X]
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.
Metadata
- Available format(s)
PDF- Publication info
- Preprint.
- History
- 2010-01-26: last updated
- 2004-09-05: published
- Short URL
- https://ia.cr/2004/224
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2004/224,
author = {Marc Joye and David Naccache and Stephanie Porte},
title = {The Polynomial Composition Problem in (Z/nZ)[X]},
howpublished = {Cryptology {ePrint} Archive, Paper 2004/224},
year = {2004},
url = {https://eprint.iacr.org/2004/224}
}