Renshaw, James (2018) Completely regular semigroups and the discrete log problem arXiv 19pp. (In Press)
Record type:
Monograph
(Working Paper)
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.
More information
Submitted date: 31 January 2018
Accepted/In Press date: 31 January 2018
Related URLs:
Keywords:
Semigroup, completely regular, discrete logarithm, cryptography
Identifiers
Local EPrints ID: 417538
URI: http://eprints.soton.ac.uk/id/eprint/417538
PURE UUID: 1171d7bf-ff3e-4c6b-b743-c1bd541bca99
Catalogue record
Date deposited: 02 Feb 2018 17:30
Last modified: 16 Mar 2024 02:39
Export record
Contributors
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.