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 voting system under the 'Condorcet Criterion' when circular preferences exist?
• If a formal system proves a statement 'P' and 'P implies Q', which inference rule allows us to conclude 'Q'?
• If a finite state machine table lacks unreachable states, which consequence follows?
• A search algorithm must locate a student record within a database of 10,000 entries. Which algorithm provides the MOST efficient time complexity in the worst-case scenario?
• If a computational geometer incrementally constructs a convex hull from a point set using Graham's scan, which outcome occurs when the current point creates a non-left turn?
• A data compression engineer implements Huffman coding for a text file, but the decoding process halts prematurely. Which consequence follows from incomplete transmission of the Huffman tree?