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.
| Origin | Files produced by the author(s) |
|---|
Loading...
