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 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 social network's adjacency matrix represents connections between users. Which effect results when Principal Component Analysis (PCA) is performed on this matrix?
• A digital image undergoes lossy compression using Discrete Cosine Transform (DCT). Which outcome arises from aggressively quantizing DCT coefficient matrices?
• If a digital audio workstation (DAW) uses a Fibonacci sequence to determine the duration of reverb tails, which outcome arises as the sequence progresses to higher-order terms?
• If a distributed database system experiences network partitions leading to subsets of nodes becoming isolated, which outcome regarding ACID properties is most likely to occur?
• A chemical engineer adjusts temperature and pressure settings within a reactor to optimize product yield; which constraint satisfaction technique manages the coupled non-linear equations?