Pseudo-Random Functions Clause Samples

Pseudo-Random Functions. When engineers choose a protocol for key exchange, they take into its security, computation and communication e ciency, and easy of integration. Since they do not face the same computing environment, they may choose to use a di erent means to generate the session key. The computa- tion of K with H0(ckf igi2Gc ) is just a way to generate, deterministically, a random string. They may want to implement a version of the above protocol wherein the base station simply draws the value K with any pseudo-random generator. This version would exhibit a similar security result and proof as the one presented in the next section (a security proof is straightforward to derive from the one presented below).