Public key cryptography based on Moufang loops

Abstract

One of the earliest examples of public key cryptography is the Diffie-Hellman key exchange protocol, which is based on the discrete logarithm problem. In 2000, Ko, Lee et al. modified the Diffie-Hellman protocol by using braid groups as platform where the security of the protocol lies on the conjugacy search problem. In this paper, we propose two key exchange protocols that use two well known classes of nonassociative Moufang loops as potential platforms.