Number Theory
Euler's Theorem
Suppose Alice and Bob choose \(p=191\) and \(g=2\). If Alice's secret number is \(12\) and Bob's is \(16\), what is the shared secret key?
Alice and Bob unwisely choose \(p=211\) for their Diffie-Hellman protocol, along with \(g=2\). Eve sees the transmission \(g^n \pmod p = 155\) and the transmission \(g^m \pmod p = 96\). What is the shared secret key \(g^{mn} \pmod p\)?
Which of the following modifications would NOT increase the security of the Diffie-Hellman protocol?