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.

• What happens to the row player's payoff when mixed strategies converge to a Nash equilibrium within a two-player game represented by a payoff matrix?
• A recursive function calculates factorials. What happens if the base case (n=0) is omitted, causing infinite recursion?
• If a neural network’s output layer uses Huffman coding to represent predicted phonemes, which consequence follows for network efficiency?
• If a signal-processing engineer applies singular value decomposition (SVD) to a matrix representing an audio signal, which consequence follows regarding noise reduction?
• An election system uses plurality voting. Which outcome inevitably increases when more candidates enter?
• If Dijkstra's algorithm encounters a node with an estimate matching its true shortest distance, which consequence follows for the monovariant?