A Cryptosystem Using Cluster Algebras

TL;DR

This paper introduces an encryption algorithm leveraging mutations in finite type cluster algebras to encode messages as elements of a finite field.

Contribution

It presents a novel cryptosystem based on cluster algebra mutations, expanding the application of algebraic structures in cryptography.

Findings

Developed an algorithm for encryption and decryption using cluster algebra mutations.

Demonstrated the feasibility of encoding messages as elements of a finite field.

Established a cryptographic scheme grounded in algebraic mutation processes.

Abstract

We establish an algorithm to encrypt and decrypt messages, where messages can be seen as elements of a finite field, using of mutations in a cluster algebra finite type.