@Article{EAJAM-13-177,
author = {Matysiak , ŁukaszChrzaniuk , MonikaDuda , MaximilianHanc , MartaKowalski , SebastianSkotnicka , Zoja and Waldoch , Martin},
title = {Cryptographic Systems Based on an Algebraic Structure},
journal = {East Asian Journal on Applied Mathematics},
year = {2023},
volume = {13},
number = {1},
pages = {177--193},
abstract = {<p style="text-align: justify;">In this paper cryptographic systems based on the Dedekind and Galois structures are considered. We supplement the created cryptosystems based on the Dedekind
structure with programs written in C++ and discuss the inner structure of Galois in
cryptography. It is well-known that such a structure is based on finite fields only. Our
results reveals something more internal. The final section contains additional information about square-free and radical factorizations in monoids consisting in searching for
a minimal list of counterexamples. As an open problem, we leave creating a program
that would generate such a list and how to use such a list to create a cryptosystem.</p>},
issn = {2079-7370},
doi = {https://doi.org/10.4208/eajam.240522.200822 },
url = {http://global-sci.org/intro/article_detail/eajam/21308.html}
}