A Polynomial Composites and Monoid Domains as Algebraic Structures and their Applications
cryptology, domain, field, monoid, monoid domain, polynomial composites
Abstract
This paper contains the results collected so far on polynomial composites in terms of many basic algebraic properties. Since it is a polynomial structure, results for monoid domains come in here and there. The second part of the paper contains the results of the relationship between the theory of polynomial composites, the Galois theory and the theory of nilpotents. The third part of this paper shows us some cryptosystems. We find generalizations of known ciphers taking into account the infinite alphabet and using simple algebraic methods. We also find two cryptosystems in which the structure of Dedekind rings resides, namely certain elements are equivalent to fractional ideals. Finally, we find the use of polynomial composites and monoid domains in cryptology.
Downloads
- Article PDF
- TEI XML Kaleidoscope (download in zip)* (Beta by AI)
- Lens* NISO JATS XML (Beta by AI)
- HTML Kaleidoscope* (Beta by AI)
- DBK XML Kaleidoscope (download in zip)* (Beta by AI)
- LaTeX pdf Kaleidoscope* (Beta by AI)
- EPUB Kaleidoscope* (Beta by AI)
- MD Kaleidoscope* (Beta by AI)
- FO Kaleidoscope* (Beta by AI)
- BIB Kaleidoscope* (Beta by AI)
- LaTeX Kaleidoscope* (Beta by AI)
How to Cite
References
D. Anderson, David Anderson, Muhammad Zafrullah (1990) Factorization in integral domains. 69(1), 1-19. https://doi.org/10.1016/0022-4049(90)90074-r
D. Anderson, D. Anderson, M. Zafrullah, Rings D[X], K[X], Houston Mathematics (1991) Rings between D[X] and K[X]. 17, 109{129.
D. Anderson, A. Ryckaert, The class group of D+M, J. Algebra (1988) The class group of D + M.
J. Brewer, E. Rutter (1976) D + M construction with general overrings. 23, 33{42.
Costa, J. Mott, M. Zafrullah (1978) The construction D + XDS[X.
P. Jr (1968) The converse to a well known theorem on Noetherian rings.
M. Fontana, S. Kabbaj, On Krull, J. Algebra (1990) On the krull and valuative dimension of D + XDs[X] domains.
Kim (2001) FACTORIZATION IN MONOID DOMAINS.
Andy Magid (2014) The Separable Galois Theory of Commutative Rings, Chapman & Hall/CRC, Boca Raton, 2014. https://doi.org/10.1201/b17145
(2020) Ł. Matysiak, On properties of composites and monoid domains, Accepted for printing in Advances and Applications in Mathematical Sciences, . pdf, (2020). http://lukmat.ukw.edu.pl/files/On-properties-of-composites-and-monoid-domains--template-IJPAM-Italy-.pdf
(2020) Ł. Matysiak, ACCP and atomic properties of composites and monoid domains, Accepted for printing in Indian Journal of Mathematics, . pdf, (2020). http://lukmat.ukw.edu.pl/files/ACCP-and-atomic-properties-of-com-posites-and-monoid-domains.pdf
Ł. Matysiak (2021) Generalized RSA cipher and Diffe-Hellman protocol. 39.
Ł. Matysiak (2021) On some properties of polynomial composites.
Ł. Matysiak (2021) Polynomial composites and certain types of fields extensions.
M. Jankowska, L. Matysiak (2021) Matysiak, A structure of Dedekind in the cryptosystem. http://lukmat.ukw.edu.pl/files/A-structure-of-Dede-kind-in-the-cryptosystem.pdf
T. Shah, W. Khan (2010) On Factorization properties of monoid S and monoid domain D[S. (18).
M. Zafrullah, J. Algebra (1988) The D + XDS[X] construction from GCD-domains.
Published
2021-06-08
Issue
Section
License
Copyright (c) 2021 Authors and Global Journals Private Limited

This work is licensed under a Creative Commons Attribution 4.0 International License.