Is it any easier to find $X$ for $a=1$ than some other $a$'s that is smaller than $N$. $a$ is quadratic residue.
How difficult is to find x for x^2 mod N = a, where a = 1?
1
$\begingroup$
elementary-number-theory
-
0Special-case of [this question,](http://math.stackexchange.com/q/14501/242) on k'th roots. It's no easier than the general case. – 2012-10-15