How to prove yourself: practical solutions to identification and signature problems
Proceedings on Advances in cryptology---CRYPTO '86
Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
A course in computational algebraic number theory
A course in computational algebraic number theory
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Low-exponent RSA with related messages
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
| Hi-index | 0.00 |
Let n be an RSA modulus and let $\mathcal {P},\mathcal{Q} \in (\mathbb{Z}/n\mathbb{Z})[X]$. This paper explores the following problem: Given polynomials $\mathcal{Q}$ and $\mathcal{Q}(\mathcal{P})$, find polynomial $\mathcal{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.