If a RSA cryptosystem uses a modulus `n` that is the product of two distinct large prime numbers, which advantage does Fermat's Little Theorem provide in checking primality?

💡 Explanation

Fermat's Little Theorem allows a probabilistic primality test: if `a^(p-1)` is not congruent to 1 mod p, then `p` is composite, because the theorem offers a fast way to eliminate composite numbers rather than providing a guaranteed factorization, therefore option D is correct.

• If a web server experiences a power outage independent of network connectivity, which outcome reflects their conditional independence?
• A cryptographer implements a zero-knowledge proof system. Which outcome demonstrates completeness during verification?
• If a CNF formula, representing constraints in a software configuration, contains a clause (A ∨ ¬A ∨ B), which simplification is directly applicable?
• An automated warehouse uses a robotic arm to sort boxes. If the arm's spatial calibration drifts, causing it to misplace boxes, which consequence is most likely?
• If a formal system proves a statement 'P' and 'P implies Q', which inference rule allows us to conclude 'Q'?
• If a cryptographic key generation algorithm relies heavily on multiplying very large prime numbers, which security risk increases most if the primes are too close in magnitude?