If 'p' is a prime number greater than 2 in a Diffie-Hellman key exchange, which consequence necessarily follows according to Fermat's Little Theorem?

💡 Explanation

Fermat's Little Theorem dictates that if 'p' is prime and 'a' is coprime to 'p', then a^(p-1) is congruent to 1 (mod p), because this theorem directly relates to modular exponentiation. Therefore, option D is correct, rather than other options which misstate or modify the theorem’s conditions.

• A network router's routing table update process treats IP address blocks as topological spaces. Which outcome results when a discontinuous change occurs in the available routes?
• A mechanical linkage transforms rotational motion to linear. If the linkage exhibits spatial reflection symmetry across its central axis, which consequence follows?
• If an optimization engineer uses the Simplex method to maximize the tensile strength of a steel alloy, which result indicates the objective function is unbounded?
• A robotic pathfinding algorithm faces an obstacle course with limited memory. Which consequence follows from using a dynamic programming paradigm?
• 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 network engineer attempts to prove the uniqueness of a shortest path algorithm by assuming a second, distinct shortest path exists. Which consequence follows?