Rewriting system of certain semigroups with three generators
The paper under review provides a complete rewriting system for the semigroup $S(p,r,u,s,v,q)$ given by the following presentation $\langle a,b,c\mid a^p=b^s, b^r=c^v, c^u=a^q\rangle$, where $p\geq q$, $r\geq s$ and $\gcd(p,q) = 1$. This follows the paper [\textit{P. H. Kropholler} et al., Semigroup Forum 81, No. 1, 172--186 (2010; Zbl 1201.94110)] where a complete rewriting system was computed for the semigroup $S(p,s,q,r)=\langle a,b\mid a^p=b^s, a^q=b^r\rangle$, with $p\geq q$, $r\geq s$ and $\gcd(p,q) = 1$, which is actually a quotient of $S(p,r,r,s,r,q)$. The authors also mention that $S(p,r,u,s,v,q)$ could be used as a platform for the Diffie-Hellman key exchange scheme. However, this is true for any semigroup and indeed they don't specify why it could be preferable to use it.
- Rewrite systems for varieties of semigroups
- scientific article; zbMATH DE number 1222454
- Symmetric semigroups with three generators
- scientific article; zbMATH DE number 2074997
- About systems of generators of some groups with 3-transpositions.
- On three variants of rewriting P systems
- Rewriting in varieties of idempotent semigroups
- Finite complete rewriting systems for regular semigroups.
- Rewriting systems and geometric three-manifolds
- Rewriting systems of Coxeter groups
- A proposed public key cryptosystem using the modular group
- A public key cryptosystem and a signature scheme based on discrete logarithms
- An algebraic method for public-key cryptography
- Combinatorial group theory and public key cryptography
- Cryptosystems using linear groups
- scientific article; zbMATH DE number 1186880 (Why is no real title available?)
- scientific article; zbMATH DE number 2081063 (Why is no real title available?)
- scientific article; zbMATH DE number 1759777 (Why is no real title available?)
- New directions in cryptography
- Properties of certain semigroups and their potential as platforms for cryptosystems
- Public key cryptography based on semigroup actions
- Term Rewriting and All That
- The conjugacy search problem in public key cryptography: unnecessary and insufficient
- Thompson’s Group and Public Key Cryptography
This page was built for publication: Rewriting system of certain semigroups with three generators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6157861)
