A cryptographic system uses prime numbers to generate keys. If a key generation algorithm mistakenly uses two numbers that share a common prime factor, which security outcome results?

💡 Explanation

A shared prime factor allows an attacker to use factorization algorithms to easily break the key, because the modulus is no longer the product of two distinct primes; therefore, security is compromised, rather than improved, by shared factors.

• A robotic arm with three joints needs to reach a specific point in space; the joint angles are linearly dependent. Which outcome occurs?
• 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?
• A cleaning robot navigates a warehouse, using a potential function to minimize travel. If the robot gets stuck in a local minimum, which behavior is most likely?
• Why does an automated theorem prover use Proof by Contradiction to validate a mathematical statement?
• If a cryptographic key's modulus (n) is factored into primes p and q, which vulnerability becomes prominent when p and q are close?
• Which mechanism allows context-free grammars to parse structured text formats with nested dependencies in compilers?