Key exchange protocol based on circulant matrix action over congruence-simple semiring

TL;DR

This paper introduces a novel key exchange protocol utilizing circulant matrices over a congruence-simple semiring, analyzing its computational efficiency and security features.

Contribution

It presents a new cryptographic protocol based on circulant matrix actions over a specific algebraic structure, expanding the toolkit for secure key exchange methods.

Findings

Protocol is computationally efficient.

Security analysis shows resistance to known attacks.

Provides methods to compute necessary matrices.

Abstract

We present a new key exchange protocol based on circulant matrices acting on matrices over a congruence-simple semiring. We describe how to compute matrices with the necessary properties for the implementation of the protocol. Additionally, we provide an analysis of its computational cost and its security against known attacks.