If a cryptographic key's modulus (n) is factored into primes p and q, which vulnerability becomes prominent when p and q are close?

💡 Explanation

Fermat's factorization method exploits the difference between two squares to factorize a number; it is most efficient when the factors are close. Therefore, close primes p and q lead to a small difference of squares, making Fermat's method effective, rather than brute force or collision attacks.

• If a lossless data compression scheme encodes a text file using Huffman coding based on Shannon's source coding theorem, which consequence follows?
• If a robotic arm's control system uses modular arithmetic for precise positioning, which consequence results when a large prime number is chosen as the modulus?
• If a protein undergoes a conformational change in an enzyme's active site, which consequence follows regarding its binding affinity?
• An iterative algorithm searches a sorted array. Which technique formally verifies that the loop maintains the array's sorted order and the search range narrows?
• A database search algorithm is designed to locate a specific record among 'n' entries. What happens to the worst-case execution time as 'n' doubles?
• A Turing machine halting without reaching an explicit 'HALT' state indicates a looping condition. Which mechanism determines if an arbitrary Turing machine will halt?