A file encryption scheme uses the product of two distinct large prime numbers to generate a key; If the primes are too close, what occurs?

💡 Explanation

When primes are close together, trial division or Fermat's factorization method becomes more efficient, because the search space is reduced; therefore, the key is weakened, rather than strengthened as might be assumed, since a smaller difference between the primes makes factorization easier.

• What happens to a database query result when the set theory principle of 'union' combines two tables with completely disjoint sets of primary keys?
• 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?
• In a diagnostic blood test for a rare genetic disease, if the false positive rate is 5%, which subsequent step minimizes incorrect diagnoses?
• If a social network mandates that among any six users, either three are mutually friends or three are mutually strangers, which consequence follows for the network's structure?
• A text file experiences corruption; what happens to the average codeword length when Huffman coding is applied to the altered, more uniform character distribution?
• If a university course timetable can be represented as a bipartite graph, where courses and time slots are nodes, which outcome guarantees conflict-free scheduling?