A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
A key-agreement protocol (KAP) is a multi-party algorithm deÿned by a sequence of steps specifying the actions required for two or more individuals to each obtain a shared secret. A brief introduction to an axiomatic basis for non-abelian KAPs is presented. The security of these protocols is related to the di culty of solving equations in non-linear algebraic structures. In particular, it is shown that well known hard problems in group theory can be used to generate key agreement protocols.doi:10.1016/s0166-218x(02)00585-1 fatcat:6odjnkzknfhh5m752mx6wl7xh4