Download Now Free registration required
A new 4-pass Key-Agreement-Protocol is presented. The security of the protocol mainly relies on the existence of a (polynomial-time computable) One-Way-Function and the supposed computational hardness of solving a specific system of equations. At the end of a Key-Agreement-Protocol two parties, say Alice and Bob, share a common bit string s. During the protocol they are allowed to exchange a fixed number of messages mi, i = 1,. .., r, over a public channel. The protocol is called secure, if no algorithm exist that computes the string s from the mi's in a polynomial number of steps.
- Format: PDF
- Size: 69.86 KB