DeepAI AI Chat
Log In Sign Up

A polynomial composites and monoid domains as algebraic structures and their applications

by   Magdalena Jankowska, et al.

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.


page 1

page 2

page 3

page 4


Types are Internal ∞-Groupoids

By extending type theory with a universe of definitionally associative a...

Learning algebraic decompositions using Prony structures

We propose an algebraic framework generalizing several variants of Prony...

Continuous Functions on Final Comodels of Free Algebraic Theories

In 2009, Ghani, Hancock and Pattinson gave a tree-like representation of...

Polynomial and trigonometric splines

Classes of simple polynomial and simple trigonometric splines given by F...

Polynomial mapped bases: theory and applications

In this paper, we collect the basic theory and the most important applic...

Walsh's Conformal Map onto Lemniscatic Domains for Polynomial Pre-images II

We consider Walsh's conformal map from the exterior of a set E=⋃_j=1^ℓ E...

Determinantal sets, singularities and application to optimal control in medical imagery

Control theory has recently been involved in the field of nuclear magnet...