Completely Regular Semigroups and the Discrete Log Problem
Group Theory
2019-02-18 v2
Abstract
We consider an application to the discrete log problem using completely regular semigroups which may provide a more secure symmetric cryptosystem than the classic system based on groups. In particular we describe a scheme that would appear to offer protection to a standard trial multiplication attack.
Cite
@article{arxiv.1802.00042,
title = {Completely Regular Semigroups and the Discrete Log Problem},
author = {James Renshaw},
journal= {arXiv preprint arXiv:1802.00042},
year = {2019}
}