Application of non-associative groupoids to the realization of an open key distribution procedure

We investigate the possibility to use non-associative groupoids in the realization of an open key distribution procedure based on a generalization of the well known Diffie–Hellman algorithm. We prove the existence of non-associative groupoids which are simultaneously power commuting and not power-associative.