February 19, 2002
Practical Aspects of Modern Cryptography
60
Proving Something is a Square
n
Suppose I want to convince you that
Y
is a square modulo
N
.
n
[There exists an
X
such that
Y = X
2
mod N
.]