Key agreement schemes based on linear groupoids

Authors present a study of the possibility to use special class of nonassociative groupoids (called linear) for the implementation of a key exchange protocol based on a generalization of Diffie–Hellmann algorithm. The necessity to use the power commutation and effective power calculation properties is proved. A specific example of linear groupoid over the elliptic curve is described.