If a sender increases the size of the prime numbers *p* and *q* used to generate the modulus *n* in an RSA cryptosystem, which consequence follows?

💡 Explanation

A larger modulus makes the RSA cipher harder to break because the factoring problem becomes computationally more difficult; therefore, security increases, rather than decryption speed or key generation complexity improving, since these depend on the size of the keys and the mathematical operations involved.

• What happens to a compiler's verification process when the negation of a key optimization invariant leads to detectable program failure?
• A software supply chain uses cryptographic hashes to verify component integrity. Which failure mode becomes likely when a weak hashing algorithm with poor collision resistance is employed?
• What outcome results when a large prime number is used as a modulus in a cryptographic system, assuming secure key exchange?
• If a self-replicating robotic swarm uses an inductive process to build structures of increasing complexity, which consequence follows regarding the verification of structural integrity?
• If an attacker gains access to the private key in an RSA encryption system used for secure email, which consequence follows?
• A compiler optimizing a program divides tasks into smaller subproblems; it uses memoization to avoid recomputing previously solved subproblems. Which algorithm design paradigm is most clearly demonstrated?