Cover Image

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:
Bibliographic Details
Main Authors: Asri, Muhammad Sufi Mohd, Othman, Wan Ainun Mior, Wong, Kok Bin
Format: Article
Published: SPRINGER 2023
Subjects:
QA Mathematics
QA75 Electronic computers. Computer science
Online Access:http://eprints.um.edu.my/39631/
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.um.eprints.39631
record_format eprints
spelling my.um.eprints.396312024-06-11T02:11:04Z http://eprints.um.edu.my/39631/ Rewriting system of certain semigroups with three generators Asri, Muhammad Sufi Mohd Othman, Wan Ainun Mior Wong, Kok Bin QA Mathematics QA75 Electronic computers. Computer science 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. SPRINGER 2023-05 Article PeerReviewed Asri, Muhammad Sufi Mohd and Othman, Wan Ainun Mior and Wong, Kok Bin (2023) Rewriting system of certain semigroups with three generators. APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 34 (3). pp. 469-487. ISSN 0938-1279, DOI https://doi.org/10.1007/s00200-021-00506-7 <https://doi.org/10.1007/s00200-021-00506-7>. 10.1007/s00200-021-00506-7
institution Universiti Malaya
building UM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Malaya
content_source UM Research Repository
url_provider http://eprints.um.edu.my/
topic QA Mathematics
QA75 Electronic computers. Computer science
spellingShingle QA Mathematics
QA75 Electronic computers. Computer science
Asri, Muhammad Sufi Mohd
Othman, Wan Ainun Mior
Wong, Kok Bin
Rewriting system of certain semigroups with three generators
description 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.
format Article
author Asri, Muhammad Sufi Mohd
Othman, Wan Ainun Mior
Wong, Kok Bin
author_facet Asri, Muhammad Sufi Mohd
Othman, Wan Ainun Mior
Wong, Kok Bin
author_sort Asri, Muhammad Sufi Mohd
title Rewriting system of certain semigroups with three generators
title_short Rewriting system of certain semigroups with three generators
title_full Rewriting system of certain semigroups with three generators
title_fullStr Rewriting system of certain semigroups with three generators
title_full_unstemmed Rewriting system of certain semigroups with three generators
title_sort rewriting system of certain semigroups with three generators
publisher SPRINGER
publishDate 2023
url http://eprints.um.edu.my/39631/
_version_ 1805881112831983616
score 13.19449

Similar Items