Perfect square modulo $n = pq$

number-theory cryptography

Solution 1:

Hint $\rm\ (\pm x,\pm x)^2 \equiv (a,a)\ mod\ (p,q).\ $ There are $4$ possible sign combinations.

Related

Determining the proper function for morphisms
Finding $\int_0^{\infty}xe^{-\lambda x} \, dx$
Inequality for the kernel of the composition of linear maps
How to start proving $A \times B \times C \ne (A \times B) \times C$?
Derivative of von Neumann entropy
If $0<a<b,$ determine the limit of $\frac{a^{n+1}+b^{n+1}}{a^n+b^n}$
Scheduling a team based activity with 10 different teams and X different games. Every team must meet each other ONCE but never twice,
Proving $9$ divides $n^3 + (n+1)^3 + (n+2)^3$ [duplicate]
Prove by induction $\sum \frac {1}{2^n} < 1$
Product of Principal Ideals when $R$ is commutative, but not necessarily unital
Defining a Perplexing Two-Dimensional Sequence Explicitly
Are there more rational or irrational numbers? [duplicate]