Question

Let n=p*q where p and q are two large secret primes. Give b and

n, finding x such that ×^2 = b mod n is a hard problem
True
False

Answer 1

True

Explanation:

Solving for x in the equation x^2 = b mod n is known as the integer factorization problem, which is considered a hard problem when n is the product of two large primes. This is the basis for many cryptographic systems, including RSA.