Application of non-associative structures to the construction of public key distribution algorithms

We explore the possibility of using non-associative groupoids to construct public key distribution algorithms generalizing the Diffie–Hellmann algorithm. A class of non-associative groupoids satisfying the power permutability property is founded. For this class the complexity of computing powers of an element and the complexity of discrete logarithm problem, including the possible usage of hypothetical quantum computer.