Assertion: cryptography's root | /r/HasProperty | number
Facets:
Source sentences:
text: Although it is easy to compute a modular square root (a number whose square leaves a designated remainder when divided by the product) if the prime factors are known, it is just as hard as factoring (in fact equivalent to factoring) the product if the primes are unknown.