Rewriting system of certain semigroups with three generators (Q6157861)

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.