Rewriting system of certain semigroups with three generators
In this paper, we study some properties of semigroups with presentation < a, b, c; a(p) = b(s), b(r) = c(v), c(u) = a(q). We will determine a complete rewriting system for the semigroup which could be useful for cryptosystems.
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Published: |
SPRINGER
2023
|
| Subjects: | |
| Online Access: | http://eprints.um.edu.my/39631/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | In this paper, we study some properties of semigroups with presentation < a, b, c; a(p) = b(s), b(r) = c(v), c(u) = a(q). We will determine a complete rewriting system for the semigroup which could be useful for cryptosystems. |
|---|