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.

• Why does the existence of unavoidable monochromatic cliques become guaranteed when the number of edges in a complete graph surpasses the Ramsey number R(3,3)?
• An engineer designs a braking system under the assumption that a car can simultaneously be both stopped and moving at a non-zero velocity. Which consequence follows?
• A secure microgrid controller needs to verify energy usage without revealing precise consumption values to the central grid. Which mechanism maintains data privacy?
• A robotic arm uses inverse kinematics to reach objects in a workspace. If a joint encoder fails, disrupting spatial awareness, which consequence follows?
• In a sorting algorithm, which mechanism explains why QuickSort, on average, performs better than Bubble Sort for large datasets?
• A network of interconnected sensors monitors a chemical reaction; if a communications outage affects critical nodes, which outcome occurs?