Key Agreement and Authentication Schemes Using Non-Commutative Semigroups

TL;DR

This paper introduces new key agreement and authentication schemes based on non-commutative semigroups, generalizing existing conjugacy-based protocols, with improved efficiency and a security sketch.

Contribution

It presents a generalized authentication scheme and new key agreement protocols leveraging non-commutative semigroups, enhancing efficiency over previous methods.

Findings

More efficient multiplications for certain parameters

Sketch of security proof provided

New protocols based on non-commutative algebra

Abstract

We give a new two-pass authentication scheme, whichis a generalisation of an authentication scheme of Sibert-Dehornoy-Girault based on the Diffie-Hellman conjugacy problem. Compared to the above scheme, for some parameters it is more efficient with respect to multiplications. We sketch a proof that our authentication scheme is secure. We give a new key agreement protocols.