Rewriting system of certain semigroups with three generators

Document Type

Article

Publication Date

5-1-2023

Abstract

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.

Keywords

Semigroups, Rewriting system, Cryptosystems

Divisions

MathematicalSciences

Funders

University of Malaya [IIRG0019C]

Publication Title

Applicable Algebra in Engineering, Communication and Computing

Volume

34

Issue

3

Publisher

Springer

Publisher Location

ONE NEW YORK PLAZA, SUITE 4600, NEW YORK, NY, UNITED STATES

This document is currently not available here.

Share

COinS