Loading menu…

A Polynomial Composites and Monoid Domains as Algebraic Structures and their Applications

§ Kazimierz Wielki University

Send Message

To: Author

A Polynomial Composites and Monoid Domains as Algebraic Structures and their Applications

Article Fingerprint

ReserarchID

P91MC

A Polynomial Composites and Monoid Domains as Algebraic Structures and their Applications Banner

Key Research Insights

Synthesized scholarly intelligence & interactive research assistant
  • English
  • Afrikaans
  • Albanian
  • Amharic
  • Arabic
  • Armenian
  • Azerbaijani
  • Basque
  • Belarusian
  • Bengali
  • Bosnian
  • Bulgarian
  • Catalan
  • Cebuano
  • Chichewa
  • Chinese (Simplified)
  • Chinese (Traditional)
  • Corsican
  • Croatian
  • Czech
  • Danish
  • Dutch
  • Esperanto
  • Estonian
  • Filipino
  • Finnish
  • French
  • Frisian
  • Galician
  • Georgian
  • German
  • Greek
  • Gujarati
  • Haitian Creole
  • Hausa
  • Hawaiian
  • Hebrew
  • Hindi
  • Hmong
  • Hungarian
  • Icelandic
  • Igbo
  • Indonesian
  • Irish
  • Italian
  • Japanese
  • Javanese
  • Kannada
  • Kazakh
  • Khmer
  • Korean
  • Kurdish (Kurmanji)
  • Kyrgyz
  • Lao
  • Latin
  • Latvian
  • Lithuanian
  • Luxembourgish
  • Macedonian
  • Malagasy
  • Malay
  • Malayalam
  • Maltese
  • Maori
  • Marathi
  • Mongolian
  • Myanmar (Burmese)
  • Nepali
  • Norwegian
  • Pashto
  • Persian
  • Polish
  • Portuguese
  • Punjabi
  • Romanian
  • Russian
  • Samoan
  • Scots Gaelic
  • Serbian
  • Sesotho
  • Shona
  • Sindhi
  • Sinhala
  • Slovak
  • Slovenian
  • Somali
  • Spanish
  • Sundanese
  • Swahili
  • Swedish
  • Tajik
  • Tamil
  • Telugu
  • Thai
  • Turkish
  • Ukrainian
  • Urdu
  • Uzbek
  • Vietnamese
  • Welsh
  • Xhosa
  • Yiddish
  • Yoruba
  • Zulu
Reading Preferences
Font Size
Line Spacing
Background
This converted HTML version may contain rendering inconsistencies. Please refer to the PDF for the authoritative version, or click here to provide feedback.

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.

I. INTRODUCTION

Let N = { 1 , 2 , … } , N 0 = { 0 , 1 , 2 , … } . By a ring we mean a commutative ring with unity. Let R be a ring. Denote by R ∗ the group of all invertible elements of R. The set of all irreducible elements in R will be denoted by Irr R. By a domain we mean a commutative ring with unity without zero divisors. An element r ∈ R is called nilpotent if there is n ∈ N such that r n = 0 .

The most important motivation for writing this paper is to quote the most important results related to polynomial composites, their algebraic place in mathematics and their application in cryptology.

D.D. Anderson, D.F. Anderson, M. Zafrullah in [2] called object A + X B [ X ] as a composite, where A be a subdomain of the field B. If B be a domain and M be an additive cancellative monoid (a semigroup with neutral element and cancellative property) we can define a monoid domain B [ M ] = { a 0 X m 0 + ⋯ + a n X m n : a 0 , … , a n ∈ B , m 1 , … m n ∈ M } . If M = N 0 , then B [ M ] = B [ X ] . Monoid domains appear in many works, for example [8], [16].

There are a lot of works where composites are used as examples to show some properties. But the most important works are presented below.

In 1976 [4] authors considered the structures in the form D + M, where D is a domain and M is a maximal ideal of ring R, where D \subset R. Later In the second section we can find many results about polynomial composites and monoid domains. Basic algebraic properties such as irreducible elements, nilpotents and ideals have been examined. Theorem 2.6 is especially worth noting. In this theorem, for A ⊂ B be fields, we can note that every nonzero prime ideal polynomial composites is maximal, every prime ideal different from some maximal ideal of polynomial composite is principal and every polynomial composites are atomic (every element of polynomial composites be a product of finite irreducibles (atoms)). In Theorem 2.9 we have an information about irreducibles of monoid domain. In the second part of the second section we have results about ACCP and atomic properties. Recall, a property: for any ascending chain of principal ideals of ring R : I 1 ⊂ I 2 ⊂ I 3 ⊂ … , there is n ∈ N such that I n = I n + 1 = … . A domain with ACCP property is called ACCP-domain. Every ACCP-domain be atomic. In Theorem 2.23 it turns out that the polynomial composite of the form K + X L [ X ] (where K ⊂ L be fields) is a Dedekind ring. This is a very important class of rings in algebra.

In the third section we can find relationships between a theory of polynomial composites and Galois theory. Galois theory contributed greatly to the development of many fields, not only in mathematics. Particularly noteworthy is the solution of three ancient problems of construction with a compass and a straightedge in the 19th century. The results in this section, under different assumptions, boil down to the relationship between field extensions and Noetherian rings. Recall a Noetherian ring is called a ring with ACCP-property. Equivalence, a ring such that every ideal be a finite generated. In Theorems 3.13 and 3.14 we combine the Magid's results with the current results to create a complete characterization of field extensions using polynomial composites and idempotents. Recall, an element e ∈ R is called idempotent if e 2 = e holds. For example, in Z we have two trivial idempotents 0 and 1.

Sections four and five are reminder from [ 12 ] a generalized RSA cipher and a Diffie-Hellman protocol key exchange. Such a reminder is purposeful because we want to draw attention to the replacement of the finite alphabet with the infinite one and the replacement of classical prime numbers with prime ideals. Such a swap will be extremely difficult for third person to break.

In sections six and seven we have cryptosystems which use the structure Dedekind. The former uses this structure in the key, and the latter uses it in two different alphabets. Of course, these ciphers can be generalized to infinite alphabets and ideals.

Section eight shows a cryptosystem based on polynomial composites. Section nine shows a cryptosystem based on monoid domains. Note that in the last cryptosystem, in order to break it, the discrete logarithm calculation should be used. At the moment, there is no mathematical way to facilitate the computation of discrete logarithms. We can count using computers, but here the algorithm would consist in checking each successive number, not on a specific indication of the number. And this is a great difficulty in breaking the last cryptosystem.

II. POLYNOMIAL COMPOSITES AND MONOID DOMAINS

In this section we introduce the most important facts about polynomial composites and monoid domains in math.

Let T = A + X B [ X ] , T n = A 0 + A 1 X + ⋯ + A n − 1 X n − 1 + X n B [ X ] where A , B , A 0 , A 1 , … , A n be domains such that A ⊂ B , A 0 ⊂ A 1 ⊂ ⋯ ⊂ A n − 1 ⊂ B .

Let's start from the following Lemma which is very easy to proof.

Lemma 2.1. T n , T be rings, T n ⊂ T .

Now let's look at invertible and nilpotent elements.

Proposition 2.2. Let f = a 0 + a 1 X + ⋯ + a n X n ∈ T for any n ∈ N 0 . Then f ∈ T ∗ if and only if a 0 ∈ A ∗ and a 1 , a 2 , … , a n are nilpotents.

Proof. We know that if R is a ring then f = a 0 + a 1 X + ⋯ + a n X n ∈ R [ X ] ∗ if and only if a 0 ∈ R ∗ and a 1 , a 2 , … , a n are nilpotents. In our Proposition we have a 1 , a 2 , … , a n are nilpotents. Of course we get a 0 ∈ A ∗ .

Proposition 2.3. Let f = a 0 + a 1 X + … a n − 1 X n − 1 + a n X n + ⋯ + a m X m ∈ T n , where 0 ≤ n ≤ m and a i ∈ A i for i = 0 , 1 , … , n and a j ∈ B for j = n , n + 1 , … , m .

(i) f ∈ T n ∗ if and only if a 0 ∈ A 0 ∗ and a 1 , a 2 , … , a m are nilpotents.

(ii) f be a nilpotent if and only if a 0 , a 1 , … , a m are nilpotents.

Proof. Analogous proof like in Proposition 2.2.

Proposition 2.4. Let B be a domain and f = a m 1 X m 1 + a m 2 X m 2 + ⋯ + a m n X m n ∈ B [ M ] , where m 1 , m 2 , … , m n ∈ M and a m 1 , a m 2 , … , a m n ∈ B .

(i) f ∈ B [ M ] ∗ if and only if there exist m i ∈ M such that a m i ∈ B ∗ and m i = 0 and for every m k ≠ m i we have a m k be nilpotents.

(ii) f be a nilpotent if and only if a m 1 , a m 2 , … , a m n are nilpotents.

Proof. (i) Assume f ∈ B [ M ] ∗ . Then there exists g = b m 1 ′ X m 1 ′ + b m 2 ′ X m 2 ′ + ⋯ + b m n ′ X m n ′ , where m 1 ′ , m 2 ′ , … , m n ′ ∈ M and b m 1 ′ , b m 2 ′ , … , b m n ′ ∈ B such that fg = 1. Hence there exist m i , m j ∈ M such that a m i b m j X m i + m j = 1 . We have a i ∈ B ∗ and m i , m j = 0 . The rest of coefficients are nilpotents. On the other side of the proof it is easy.

Ref (ii) Obvious.

Let's recall Theorem from [2](Theorem 2.9) in a different form.

Theorem 2.5. Let A be a subfield of B . Consider D = A + X B [ X ] . Then Irr ⁡ D = { a X , a ∈ B } ∪ { a ( 1 + X f ( X ) ) , a ∈ A , f ∈ B [ X ] , 1 + X f ( X ) ∈ Irr ⁡ B [ X ] } .

Theorem 2.6. Consider T = A + X B [ X ] , where A be a subfield of B ; T n = A 0 + A 1 X + A 2 X 2 ⋯ + A n − 1 X n − 1 + X n B [ X ] , where A 0 ⊂ A 1 ⊂ A 2 ⊂ ⋯ ⊂ A n − 1 ⊂ B be fields. Then (i) every nonzero prime ideal of T ( T n , respectively) is maximal;

(ii) every prime ideal P different from A 1 X + A 2 X 2 + ⋯ + A n − 1 X n − 1 + X n B [ X ] (in T n ) is principal;

(iii) every prime ideal P different from X B [ X ] (in T ) is principal;

(iv) T n is atomic, i.e., every nonzero nonunit of T is a finite product of irreducible elements (atoms);

(v) T is atomic.

Proof. (i). We proof for T n . The proof for T will be a corollary.

First note that A 1 X + A 2 X 2 + ⋯ + A n − 1 X n − 1 + X n B [ X ] is maximal since T n / A 1 X + A 2 X 2 + ⋯ + A n − 1 X n − 1 + X n B [ X ] ≅ A 0 . Let P be a nonzero prime ideal of T n . Now X ∈ P implies ( T n / A 1 X + A 2 X 2 + ⋯ + A n − 1 X n − 1 + X n B [ X ] ) 2 ⊆ P and hence A 1 X + A 2 X 2 + ⋯ + A n − 1 X n − 1 + X n B [ X ] ⊆ P so P = A 1 X + A 2 X 2 + ⋯ + A n − 1 X n − 1 + X n B [ X ] . So suppose that X ∉ P . Then for N = { 1 , X , X 2 , … } , P N is a prime ideal in the PID B [ X , X − 1 ] = T n , N . (In fact, B [ X , X − 1 ] ⊆ R P and R P is a DVR (discrete valuation ring)). So P is minimal and is also maximal unless P ⊊ A 1 X + A 2 X 2 + ⋯ + A n − 1 X n − 1 + X n B [ X ] . But let k n X n + ⋯ + k s X s ∈ P with k n ∈ N 0 , where k n , … , k s ∈ B for any n, s. Then X n + 1 + k n − 1 k n + 1 X n + 2 + ⋯ + k n − 1 k s X s ∈ P , so X ∉ P implies that 1 + k n − 1 k n + 1 X + ⋯ + k n − 1 k s X s − n ∈ P , a contradiction. So every nonzero prime ideal is maximal.

(ii), (similarly (iii)). If P is different from A 1 X + A 2 X 2 + ⋯ + A n − 1 X n − 1 + X n B [ X ] , then it contains an element of the form 1 + a 1 X + a 2 X 2 + ⋯ + a n − 1 X n − 1 + X n f ( X ) , where a i ∈ A i for i = 1 , 2 , … , n − 1 and f ( X ) ∈ B [ X ] . Now if 1 + a 1 X + a 2 X 2 + ⋯ + a n − 1 X n − 1 + X n f ( X ) can be factored in A 1 X + A 2 X 2 + ⋯ + A n − 1 X n − 1 + X n B [ X ] it can be written as ( 1 + b 1 X + b 2 X 2 + ⋯ + b n − 1 X n − 1 + X n g ( X ) ) ( 1 + c 1 X + c 2 X 2 + ⋯ + c n − 1 X n − 1 + X n h ( X ) ) , where b i , c i ∈ A i for i = 1 , 2 , … , n − 1 and g ( X ) , h ( X ) ∈ B [ X ] . Hence 1 + a 1 X + a 2 X 2 + ⋯ + a n − 1 X n − 1 + X n f ( X ) is irreducible in T n if and only if it is irreducible in A 1 X + A 2 X 2 + ⋯ + A n − 1 X n − 1 + X n B [ X ] .

Now let 1 + a 1 X + a 2 X 2 + ⋯ + a n − 1 X n − 1 + X n f ( X ) be irreducible in T n and suppose that 1 + a 1 X + a 2 X 2 + ⋯ + a n − 1 X n − 1 + X n f ( X ) ∣ k ( X ) l ( X ) in T n . Then 1 + a 1 X + a 2 X 2 + ⋯ + a n − 1 X n − 1 + X n f ( X ) ∣ k ( X ) l ( X ) in A 1 X + A 2 X 2 + ⋯ + A n − 1 X n − 1 + X n B [ X ] , and so in A 1 X + A 2 X 2 + ⋯ + A n − 1 X n − 1 + X n B [ X ] we have, say 1 + a 1 X + a 2 X 2 + ⋯ + a n − 1 X n − 1 + X n f ( X ) ∣ k ( X ) . Then, in A 1 X + A 2 X 2 + ⋯ + A n − 1 X n − 1 + X n B [ X ] , k ( X ) = ( 1 + a 1 X + a 2 X 2 + ⋯ + a n − 1 X n − 1 + X n f ( X ) ) d ( X ) . Now d ( X ) can be written as d ( X ) = a X r ( 1 + a 1 X + a 2 X 2 + ⋯ + a n − 1 X n − 1 + X n p ( X ) ) . If r > 0, d ( X ) ∈ T n , while if r = 0, k ( X ) = ( 1 + a 1 X + a 2 X 2 + ⋯ + a n − 1 X n − 1 + X n f ( X ) ) ( b ( 1 + b 1 X + b 2 X 2 + ⋯ + b n − 1 X n − 1 + X n p ( X ) ) and b ∈ A 0 because k ( X ) ∈ T n . In either case, d ( X ) ∈ T n and so 1 + a 1 X + a 2 X 2 + ⋯ + a n − 1 X n − 1 + X n f ( X ) ∣ k ( X ) in T n . Consequently, in T n every irreducible element of the type 1 + a 1 X + a 2 X 2 + ⋯ + a n − 1 X n − 1 + X n f ( X ) is prime.

Now since every element of the form 1 + a 1 X + a 2 X 2 + ⋯ + a n − 1 X n − 1 + X n f ( X ) is a product of irreducible elements of the same form and hence is a product of prime elements, it follows that every prime ideal of P different from A 1 X + A 2 X 2 + ⋯ + A n − 1 X n − 1 + X n B [ X ] contains a principal prime and hence is actually principal.

(iv) (similarly v). From (ii) a general element of T n can be written as a X r ( 1 + a 1 X + a 2 X 2 + ⋯ + a n − 1 X n − 1 + X n f ( X ) ) , where a ∈ B (with a ∈ A 0 if r=0) and 1 + a 1 X + a 2 X 2 + ⋯ + a n − 1 X n − 1 + X n f ( X ) is a product of primes.

Now, We give some basic information related to ideals.

Corollary 2.7. (i) If A be a field, then X B [ X ] be an maximal ideal in T .

(ii) If A be an integral domain, then X B [ X ] be an prime ideal in T .

(iii) T / ( X ) ≅ A .

(iv) T / B ≅ { 0 } .

(v) Let A ⊂ B be fields in T . T / ( a X ) be a field for any a ∈ B .

(vi) Let A ⊂ B be fields in T . T / ( a ( 1 + X f ( X ) ) ) be a field for any a ∈ A , f ∈ B [ X ] such that 1 + X f ( X ) ∈ Irr ⁡ B [ X ] .

Proof. (i) Let A be a field. The proof follows from T / X B [ X ] ≅ A . We have X B [ X ] is a maximal ideal in T .

(ii) - (iv) Obvious.

(v), (vi) From Theorem 2.9 in [2] aX for any a ∈ B is an irreducible element. We get T / ( a X ) be a field. We also have a ( 1 + X f ( X ) ) for any a ∈ A , f ∈ B [ X ] such that 1 + X f ( X ) ∈ Irr  B [ X ] is a irreducible element. We have T / ( a ( 1 + X f ( X ) ) ) be a field.

Corollary 2.8. (i) If A 0 + A 1 X + ⋯ + A n − 1 X n − 1 be a field (where A 0 ⊂ A 1 ⊂ A 2 ⊂ ⋯ ⊂ A n − 1 ⊂ B ), then X n B [ X ] be an maximal ideal in T n .

Ref (ii) If A 0 + A 1 X + ⋯ + A n − 1 X n − 1 be a domain, then X n B [ X ] be an prime ideal in T n .

(iii) T n / ( X ) ≅ A 0 .

(iv) T n / B ≅ { 0 } .

(v) Let A 0 ⊂ A 1 ⊂ ⋯ ⊂ B be fields in T n . T n / ( a X ) be a field for any a ∈ B .

(vi) Let A 0 ⊂ A 1 ⊂ ⋯ ⊂ B be fields in T n . T n / ( a ( 1 + a 1 X + a 2 X 2 + ⋯ + a n − 1 X n − 1 + X n f ( X ) ) ) be a field for any a ∈ B , a i ∈ A i ( i = 1 , 2 , … , n − 1 ) , f ∈ B [ X ] such that 1 + X f ( X ) ∈ Irr ⁡ B [ X ] .

Proof. The proof is similarly to proof of Corollary 2.7.

Theorem 2.9. Consider T = A + X B [ X ] , where A be a subfield of B ; T n = A 0 + A 1 X + A 2 X 2 ⋯ + A n − 1 X n − 1 + X n B [ X ] , where A 0 ⊂ A 1 ⊂ A 2 ⊂ ⋯ ⊂ A n − 1 ⊂ B be fields. Then (i) f ∈ Irr ⁡ T if and only if f ∈ Irr ⁡ B [ X ] , f ( 0 ) ∈ A .

(ii) f ∈ Irr ⁡ T n if and only if f ∈ Irr ⁡ B [ X ] , a i ∈ A i , where f = a 0 + a 1 X + … a n − 1 X n − 1 + a n X n + ⋯ + a m X m with a i ∈ A i for i = 0 , 1 , … n − 1 and a n , a n + 1 , … , a m ∈ B ( n < m ) .

Proof. (i). Suppose that f ∉ Irr ⁡ B [ X ] or f ( 0 ) ∉ A . If f ( 0 ) ∉ A , then f ∉ T , so f ∉ Irr ⁡ B [ X ] . Now, assume that f ∉ Irr ⁡ B [ X ] . Then f = gh, where g , h ∈ B [ x ] ∖ B . Let g = a 0 + a 1 X + ⋯ + a n X n , h = b 0 + b 1 X + ⋯ + b m X m . We have f = ( a 0 + a 1 X + ⋯ + a n X n ) ( b 0 + b 1 X + ⋯ + b m X m ) . Then f = ( 1 + a 1 a 0 X + ⋯ + a n a 0 X n ) ( a 0 b 0 + a 0 b 1 X + ⋯ + a 0 b m X m ) , where a 0 b 0 = f ( 0 ) ∈ A . Now, suppose that f ∉ Irr ⁡ T . If f ∉ T , then f ( 0 ) ∉ A . Now, assume that f ∈ T . Then we have f = gh, where g , h ∈ T ∖ A . This implies g , h ∈ B [ x ] ∖ B .

(ii) Occur in the same way as in (i).

In [8], Lemma 6.4 we have informations about irreducible element in monoid domain D [ S ] , where D be a domain, and S be a submonoid of Q + . I present a generalized Proposition.

Proposition 2.10. Let B be an integral domain with quotient field K and M a monoid with quotient group G ≠ M . Assume that B contains prime elements p 1 , p 2 , … , p r − 1 . Assume that M is integrally closed and each nonzero element of G is type ( 0 , 0 , … ) (G satisfies the ascending chain condition on cyclic subgroups). Consider m 1 , m 2 , … , m r ∈ M such that m 1 ∈ I r r M and m 2 , m 3 , … , m r ∉ m 1 + M . Then p r − 1 X m r − ⋯ − p 2 X m 3 − p 1 X m 2 − X m 1 ∈ I r r B [ M ] .

Proof. Let ≤ be a total order on G. We may assume that m r < m r − 1 < … m 2 < m 1 . Suppose that p r − 1 X m r − ⋯ − p 2 X m 3 − p 1 X m 2 − X m 1 = f g with f , g ∈ B [ M ] . Write f = a 1 X t 1 + … a m X t m and g = b 1 X k 1 + ⋯ + b n X k n in canonical form, where t 1 < ⋯ < t m and k 1 < ⋯ < k n . First assume that either f or g is a monomial, say f = a X t . Then a ∈ B ∗ , m 1 = t + k n , m 2 = t + k 1 , m 3 = t + k 2 , … , m r = t + k r − 1 . Since m 1 ∈ Irr ⁡ M , either t or k n is invertible in M. If k n is invertible, then m 2 = t + k 1 = ( m 1 − k n ) + k 1 ∈ m 1 + M , m 3 = t + k 2 = ( m 1 − k n ) + k 2 ∈ m 1 + M , … , m r ∈ m 1 + M , a contradiction. Thus t is invertible in M, and hence f is a unit in B[M]. Thus we may assume that f and g are not monomials. Now consider the reduction of p r − 1 X m r − ⋯ − p 2 X m 3 − p 1 X m 2 − X m 1 = f g modulo the ideal ( p 1 , p 2 , … , p r − 1 ) . Then ( − 1 + ( p 1 , p 2 , … , p r − 1 ) = ( ( a m + ( p 1 , p 2 , … , p r − 1 ) ) X t m ) ( ( b n + ( p 1 , p 2 , … , p r − 1 ) ) X k n ) . This means that a 1 + ( p 1 , p 2 , … , p r − 1 ) = b 1 + ( p 1 , p 2 , … , p r − 1 ) = ( p 1 , p 2 , … , p r − 1 ) . In this case c 1 p 1 + … c r − 1 p r − 1 = a 1 b 1 ∈ ( p 1 , … , p r − 1 ) 2 , a contradiction. Thus p r − 1 X m r − ⋯ − p 2 X m 3 − p 1 X m 2 − X m 1 ∈ Irr ⁡ B [ M ] .

Proposition 2.11. B [ M ] / ( p r − 1 X m r − ⋯ − p 1 X m 2 − X m 1 ) be a field, where B be a domain, p 1 , p 2 , … , p m r ∈ B , m 1 , m 2 , … , m r ∈ M with m 1 ∈ Irr ⁡ M , m 2 , m 3 , … , m r ∉ m 1 + M .

Proof. It follows from Proposition 2.10.

Recall that Noetherian rings satisfy the ACCP condition. Almost every mathematician has encountered such rings. For example, Z is a Noetherian ring. Below are the results of ACCP properties in polynomial composites and monoid domains.

Proposition 2.12. Let A be an integral domain, B be a field such that A ⊂ B . Let R be a ring with A [ X ] ⊆ R ⊆ B [ X ] . Then R has ACCP if and only if R ∩ B has ACCP and for each ascending chain of polynomials f 1 R ⊆ f 2 R ⊆ f 3 R ⊆ … where f i ∈ R all have the same degree, then there is d ∈ ( R ∩ B ) ∖ { 0 } such that d f i ∈ ( R ∩ B ) [ X ] .

Proof. [11], Proposition 2.1.

Proposition 2.13 shows that between A [ X ] and A + X B [ X ] we can find a structure which satisfying ACCP condition.

Proposition 2.13. Let A be an integral domain, B be a field such that A ⊂ B . Let C be a domain such that A [ X ] ⊆ C ⊆ A + X B [ X ] . Suppose that for each n ∈ N 0 , there exists a n ∈ A ∖ { 0 } for all f ∈ C with deg ⁡ f ≤ n . Then C has ACCP if and only if A has ACCP.

Proof. [11], Proposition 2.2.

The above Proposition is not obvious for arbitrary composition. This would be a valuable remark, as it would allow we to choose the smallest possible composite.

Question: For subdomains A 0 , A 1 , … , A n − 1 of a field B, is the Proposition 2.13 valid for such domain C satisfying A 0 [ X ] ⊆ C ⊆ A 0 + A 1 X + ⋯ + A n − 1 X n − 1 + X n B [ X ] , where the condition A 0 ⊂ A 1 ⊂ ⋯ ⊂ A n − 1 ⊂ B holds or not?

Kim in [8] proved very serious fact about ACCP monoid domain.

Lemma 2.14. Let A be a domain. Then A has ACCP if and only if A [ X ] has ACCP.

Proof. [8], Corollary 2.2. Can be easily proved by comparing degrees.

It also turn out that ACCP property moves between A and A + X B [ X ] . This is important because we do not have to choose a general polynomial, and we can limit the inclusion to the smallest composite needed. Such a significant limitation of a polynomial to a composite is important, e.g. in Galois theory in commutative rings.

Theorem 2.15. Let A be an integral domain, B be a field such that A ⊂ B . An A has ACCP if and only if A + X B [ X ] has ACCP.

Proof. From Proposition 2.13 we have A [ X ] ⊆ A + X B [ X ] ⊆ A + X K [ X ] , where K be a quotient field of B . We can to prove that for each n ≥ 0 , there exists a n ∈ A ∖ { 0 } for all f ∈ A + X B [ X ] with deg ⁡ f ≤ n . Because A has ACCP then from Proposition 2.13 we get A + X B [ X ] has ACCP. Conversely, because A + X B [ X ] has ACCP then A has ACCP.

The next facts are the conclusions of Theorem 2.15.

Corollary 2.16. Let A 0 , A 1 , … , A n − 1 be subdomains of a field B such that A 0 ⊂ A 1 ⊂ ⋯ ⊂ B . Let C be a domain with A 0 [ X ] ⊆ C ⊆ A 0 + A 1 X + ⋯ + A n − 1 X n − 1 + X n B [ X ] . Suppose that for each n ≥ 0 , there exists a n ∈ A 0 ∖ { 0 } for all f ∈ C with deg ⁡ f ≤ n . Then C has ACCP if and only if A 0 has ACCP.

Corollary 2.17. Let A 0 , A 1 , … , A n − 1 be subdomains of a field B such that A 0 ⊂ A 1 ⊂ ⋯ ⊂ B . An A 0 has ACCP if and only if A 0 + A 1 X + ⋯ + A n − 1 X n − 1 + X n B [ X ] has ACCP.

Next Lemmas coming from Kim [8] are results about ACCP properties in monoid domains.

Lemma 2.18. Let S ⊆ T be an extension of torsion-free cancellative monoids. If T satisfies ACCP and T ∗ ∩ S = S ∗ , then S satisfies the ACCP.

Proof. [8] Proposition 1.2. (1).

Lemma 2.19. Let D be an integral domain, S a torsion-free cancellative additive monoid, and D [ S ] the monoid domain. If D [ S ] satisfies ACCP, then D and S satisfy ACCP.

Proof. [8], Proposition 1.5.

Next Theorem is the answer about question from Kim [8] Question 1.6. In [8] Proposition 1.5 (1) we have an implication. Kim asked that are the sufficient conditions in [8] Proposition 1.5 (1) for the monoid domain to satisfy ACCP, necessary.

Theorem 2.20. Let A be an integral domain and B be a field such that A ⊂ B and A [ S ] ∗ = B [ S ] ∗ . Let S be a torsion-free cancellative monoid. Both A and B [ S ] satisfy ACCP if and only if A [ S ] satisfies ACCP.

Proof. ( ⇒ ) The proof is similar to [8], Proposition 1.5.

( ⇐ ) From Lemma 2.19, since A [ S ] has ACCP, then A has ACCP. Now, consider f 1 , f 2 , ⋯ ∈ B [ S ] such that … , f 3 ∣ f 2 , f 2 ∣ f 1 . Without loss of generality, we can assume that f 1 , f 2 , ⋯ ∈ Irr ⁡ B [ S ] because every ACCP-domain is atomic. Since A ∗ = B ∗ , so f 1 , f 2 , ⋯ ∈ Irr ⁡ A [ S ] . By assumption A [ S ] has ACCP, so there exists n ⩾ 1 such that f n ∣ f n − 1 , … , f 3 ∣ f 2 , f 2 ∣ f 1 . We get ( f 1 ) ⊆ ( f 2 ) ⊆ ⋯ ⊆ ( f n ) = ( f n + 1 ) = … in B [ S ] which is stationary.

Recall that each ACCP-domain is atomic. Hence, all previous results about the ACCP-domains hold for the atomic domains. We complete the knowledge about the atomicity condition in monoid domains.

Lemma 2.21. Let D be an integral domain, S a torsion-free cancellative monoid, and D [ S ] the monoid domain. If D [ S ] be atomic, then D and S be atomic.

Proof. [8], Proposition 1.4.

Next Theorem is similarly to 2.20.

Theorem 2.22. Let A be an integral domain and B be a field such that A ⊂ B with A [ S ] ∗ = B [ S ] ∗ . Let S be a torsion-free cancellative monoid. Both A and B [ S ] be atomic if and only if A [ S ] be atomic.

Proof. ( ⇒ ) Since B[S] be atomic, then consider f = g 1 g 2 … g n ∈ B [ S ] , where g 1 , g 2 , … , g n ∈ Irr ⁡ B [ S ] . Hence from assumption we have g 1 , g 2 , … , g n ∈ Irr ⁡ A [ S ] . Then A[S] is atomic.

( ⇐ ) From Lemma 2.21 since A [ S ] be atomic, then A and S be atomic. Now consider f = g 1 g 2 … g n ∈ A [ S ] , where g 1 , g 2 , … , g n ∈ Irr A [ S ] , because A [ S ] be atomic. Then g 1 , g 2 , … , g n ∈ Irr B [ S ] , hence B [ S ] be atomic.

Anderson, Anderson and Zafrullah asked in [1](Question 1) is R [ X ] atomic when R is atomic. I say no. I have no example but we can deduce from well known facts:

Suppose that R [ X ] is not atomic. We want to get R is not atomic. Since R [ X ] is not atomic then R [ X ] has no ACCP. Hence R has no ACCP which it does not imply R is not atomic because there exists an example atomic domain which is not ACCP.

Converse, if R is not atomic, then R has no ACCP. Hence R [ X ] has no ACCP which it does not imply R [ X ] is atomic.

In [13] we have another results about polynomial composites. Various properties have been investigated: BFD (bounded factorization domain), HFD (half factorial domain), idf (each nonzero element of domain has at most a finite number of nonassociate irreducible divisors), FFD (finite factorization domain), S-domain (for each height-one prime ideal P of domain, height of P [ X ] is equal to 1 in polynomial ring over domain), Hilbert ring (every prime ideal of domain is an intersection of maximal ideals of that domain).

Theorem 2.23 says that, under some assumption, a polynomial composite has the structure of Dedekind rings. Dedekind rings are a very important class of rings in algebra. There are a lot of work, the results associated with it. On the basis of the Dedekind structure, I developed cryptosystems with the Dedekind structure in Sections 6 and 7.

Theorem 2.23. Let K ⊂ L be a finite fields extension. Then K + X L [ X ] be a Dedekind domain.

Proof. By [2], Theorem 2.7 every nonzero prime ideal is a maximal. By [13] Proposition 3.1 we have K + X L [ X ] is integrally closed. By Theorem 3.2 [14] K + X L [ X ] is noetherian domain. Hence K + X L [ X ] be a Dedekind domain.

In the following Proposition, we provide the most important and fundamental facts about the structure of Dedekind.

Proposition 2.24. Let K ⊂ L be an extension fields and let T = K + X L [ X ] .

(a) If P be a nonzero prime ideal of T and P ′ = { x ∈ T 0 ; x P ⊂ T } , then P P ′ = T .

(b) Every nonzero ideal of T has an unambiguous representation in the form product of prime ideals.

(c) Every nonzero ideal of T is invertible.

(d) If I is an ideal of T , then T / I is a principal ideal domain.

(e) C l ( T ) (a group of class of invertible ideals) be isomorphic to P i c ( T ) (a group of class of invertible modules).

(f) If M be a finite generated torsion-free T-module, then M ≅ I 1 ⊕ I 2 ⊕ ⋯ ⊕ I k , where I 1 , I 2 , … , I k are nonzero ideals of T and k is a range of M. Moreover

M ≅ T k − 1 ⊕ I 1 I 2 … I k .

Ref (g) If M be a finite generated T -module, then

M ≅ T k − 1 ⊕ I ⊕ ⨁ ( P i , n i ) T / P i n i ,

where k = dim T 0 ⁡ ( M ⊗ T T 0 ) , I ⊂ T , I is unambiguously, with the accuracy to isomorphism, a designated ideal, P i are nonzero prime ideals of T, n i > 0 , and a finite set of pair ( P i , n i ) is designated unambiguously.

III. RELATIONSHIPS BETWEEN POLYNOMIAL COMPOSITES AND CERTAIN TYPES OF FIELDS EXTENSIONS

Let K ⊂ L be a fields extension. Let's build a polynomial composites K + X L [ X ] . In this section, we will answer the question of whether there are relationships between field extensions and polynomial composites.

All my considerations began with the Theorem 3.1 below. This Proposition motivated me to further consider polynomial composites K + X L [ X ] in a situation where the extension of fields K ⊂ L is algebraic, separable, normal and Galois, respectively.

Theorem 3.1. Let K ⊂ L be a field extension. Put T = K + X L [ X ] . Then T is Noetherian if and only if [ L : K ] < ∞ .

Proof. ( ⇒ ) Since XL[X] is a finitely generated ideal of K + X L [ X ] , it follows from [14] Lemma 3.1 that [ L : K ] < ∞ . Thus, L[X] is module-finite over the Noetherian ring K + X L [ X ] .

( ⇐ ) L [ X ] is Noetherian ring and module-finite over the subring K + X L [ X ] . This is the situation covered by P.M. Eakin's Theorem [6].

Every Propositions and Theorems of this section we can find in [14].

Proposition 3.2. Let K ⊂ L be a fields extension such that L G ( L | K ) = K . Put T = K + X L [ X ] . T is Noetherian if and only if K ⊂ L be an algebraic extension.

Proposition 3.3. Let K ⊂ L be fields extension such that K be a perfect field and assume that any K -isomorphism φ : M → M , where φ ( L ) = L holds for every field M such that L ⊂ M . Put T = K + X L [ X ] . T be a Noetherian if and only if K ⊂ L be a separable extension.

Proposition 3.4. Let K ⊂ L be fields extension. Assume that if a map φ : L → a ( K ) is K -embedding, then φ ( L ) = L . Put T = K + X L [ X ] . T be a Noetherian if and only if K ⊂ L be a normal extension.

Proposition 3.5. Let K ⊂ L be fields extension such that L G ( L | K ) = K . Put T = K + X L [ X ] . T be a Noetherian if and only if K ⊂ L be a normal extension.

Proposition 3.6. Let T = K + X L [ X ] be Noetherian, where K ⊂ L be fields. Assume | G ( L | K ) | = [ L : K ] and any K -isomorphism φ : M → M , where φ ( L ) = L holds for every field M such that L ⊂ M . T be a Noetherian if and only if K ⊂ L be a Galois extension.

Proposition 3.7. Let T = K + X L [ X ] , where K ⊂ L be fields such that K = L G ( L | K ) . T be a Noetherian if and only if K ⊂ L be a Galois extension.

Proposition 3.8. Let K ⊂ L ⊂ M be fields such that K be a perfect field. If K + X L [ X ] and L + X M [ X ] be Noetherian then K ⊂ M be separable fields extension.

Moreover, if we assume that any K -isomorphism φ : M ′ → M ′ , where φ ( M ) = M holds for every field M ′ such that M ⊂ M ′ , then K + X M [ X ] be a Noetherian.

Proposition 3.9. Let K ⊂ L ⊂ M be fields such that M G ( M | K ) = K . If K + X M [ X ] be Noetherian then L ⊂ M be a normal fields extension. Moreover, L + X M [ X ] be Noetherian.

Proposition 3.10. Let K ⊂ L be extension fields such that [ L : K ] = 2 . Then K + X L [ X ] be Noetherian. Moreover, if L G ( L | K ) = K , then K ⊂ L be a normal.

Theorem 3.11 ([9], Theorem 1.2.). Let M be an algebraically closed field algebraic over K , and let L such that K ⊆ L ⊆ M be an intermediate field. Then the following are equivalent:

(a) L is separable over K .

(b) M ⊗ K L has no nonzero nilpotent elements.

(c) Every element of M ⊗ K L is a unit times an idempotent.

(d) As an M -algebra M ⊗ K L is generated by idempotents.

Theorem 3.12 ([9], Theorem 1.3.). Let M be an algebraically closed field containing K, and let L be a field algebraic over K. Then the following are equivalent:

(a) L is separable over K .

(b) M ⊗ K L has no nonzero nilpotent elements.

(c) Every element of M ⊗ K L is a unit times an idempotent.

(d) As an M -algebra M ⊗ K L is generated by idempotents.

Below we have conclusions from the above results.

Theorem 3.13. In Theorems 3.11 and 3.12, if we assume L G ( L | K ) = K , then conditions (a) - (d) are equivalent.

(e) K + X L [ X ] be a Noetherian.

(f) [ L : K ] < ∞

(g) K ⊂ L be an algebraic extension.

(h) K ⊂ L be a Galois extension.

Proof. (h) ⇒ (a) - Obvious.

(a) ⇒ (g) ⇒ (e) ⇒ (h) If K ⊂ L be a separable extension, then be an algebraic extension. By Proposition 3.2 K + X L [ X ] be a Noetherian. By Proposition 3.7 K ⊂ L be a Galois extension.

(e)⇒(f) - Theorem 3.1.

Theorem 3.14. In Theorem 3.13 if assume K be a perfect field and L G ( L | K ) = K , then conditions (a) - (h) are equivalent to (g) K ⊂ L be a normal extension.

Proof. (g)⇒(a) If K ⊂ L be a normal extension, then be an algebraic extension. By definition perfect field K ⊂ L be a separable extension.

(h)⇒(g) Obvious.

Proposition 3.7, Theorems 3.13 and 3.14 can be used to solve the inverse Galois problem. The inverse Galois problem concerns whether or not every finite group appears as the Galois group of some Galois extension of the rational numbers Q. This problem, first posed in the early 19th century, is unsolved.

There is a lot of work. And it is enough to solve the problem for non-abelian groups. Thus, the following question arises:

Question:

Can all the statements of this sections operate in noncommutative structures?

And another question also arises regarding polynomial composites:

Question:

Under certain assumptions for any type of K ⊂ L , we get that K + X L [ X ] be a Noetherian ring. When can K + X L [ X ] be isomorphic to any Noetherian ring?

IV. GENERALIZED RSA CIPHER

In [12] we have an information about how can we make a finite alphabet to an infinite alphabet?

We can assign an appropriate number to each letter of the alphabet: A = 0, B = 1, C = 2, D = 3, E = 4, F = 5, G = 6, H = 7, I = 8, J = 9, K = 10, L = 11, M = 12, N = 13, O = 14, P = 15, Q = 16, R = 17, S = 18, T = 19, U = 20, V = 21, W = 22, X = 23, Y = 24, Z = 25. So the alphabet is a finite set. The opposite side can easily decipher using the length of the alphabet. What if we extend this alphabet to an infinite set? In this situation, we can stay with the alphabet, but extend the length to infinity. So we have A = 0 + 26 k 0 , B = 1 + 26 k 1 , C = 2 + 26 k 2 , … , Y = 24 + 26 k 24 , Z = 25 + 26 k 25 , where k 0 , k 1 , … , k 25 ∈ N 0 . So, for example, the text ABACAB can be converted to 0 1 0 2 0 1, but also to 0 1 26 54 26 53. And we can give this number sequence to encrypt.

a) Generating keys

Let's choose distinct prime ideals P = ( p ) and Q = ( q ) ( p , q are distinct primes) such that N = P Q such that | N | < | ( x ) | , where x is the length of the alphabet.

Ref

 Compute  Φ ( N ) = ( φ ( n ) ) := ( P − 1 ) ( Q − 1 ) = ( p − 1 ) ( q − 1 ) .

Let's choose the ideal E = ( e ) such that e and φ ( n ) are relatively primes ( gcd ( e , φ ( n ) = 1 ) ) and | Φ ( N ) | < E | ⊊ ( 1 ) = N 0 .

We find the ideal D = ( d ) such that E D ≡ 1 ( mod Φ ( N ) ) .

The public key is defined as the pair of ideals ( N , E ) , while the private key is the pair ( N , D ) .

b) Encryption and decryption

We encrypt the message M = M 0 M 1 … M r by calculation

C i ≡ M i E ( mod Φ ( N ) )

The encrypted message C = C 0 C 1 … C r is decrypted by formula

M 1 ≡ C i D ( mod Φ ( N ) ) .
V . G E N E R A L I Z E D D i f F I E − H E L L M A N K E Y E X C H A N G E

From [12] recall a generalized Diffie-Hellman key exchange.

First person F and second person S agree on the prime ideals ( p ) and ( g ) in N 0 such that | ( p ) | < | ( g ) | .

Person F chooses any secret ( a ) in N 0 and sends to person S

( A ) ≡ ( g ) ( a ) ( mod ( p ) ) .

Person S chooses any secret (b) in N 0 and sends to person F

( B ) ≡ ( g ) ( b ) ( mod ( p ) ) .

Person F compute ( s ) ≡ ( B ) ( a ) ( mod ( p ) ) .

Person S compute ( s ) ≡ ( A ) ( b ) ( mod ( p ) ) .

Person F and person S share a secret ideal (s). This is because

( s ) ≡ ( g ) ( a ) ( b ) ≡ ( g ) ( b ) ( a ) ( mod ( p ) ) .

Ref

VI. A Key that is a Fractional Ideal

In section 6 and 7 we have cryptosystems that use the Dedekind structure ([15] in cooperation with M. Jankowska). My goal was not to create an entire cryptosystem based on the Dedekind structure. The first cryptosystem has a Dedekind structure in the key. The second cryptosystem has a Dedekind structure in two different alphabets. It is essential. This increases the security of our data. First of all, we use the fractional ideal structure. The definition itself is very interesting and motivated to apply.

Let A = {a_0, a_1, \ldots, a_n} be an alphabet such that |A| be a prime number. Let x \in {2, 3, \ldots, |A|} be the value of one of the letters of the alphabet, k \geqslant 2 be an key. Then

y = x k ( mod | A | ) ,

where y be the value of one of the letters of the alphabet be an encrypted letter.

Now, assume we have encrypted letter y. Then we get a decrypted letter x by a formula

x = ( y + ( k − d ) ⋅ | A | ) ⋅ k − 1 ,

where d be the remainder of dividing y by k.

Proof.

x = y + ( k − y ( mod k ) ) | A | k = x k ( mod | A | ) + ( ( k − ( x k ( mod | A | ) ) ) ( mod k ) ) | A | k = x

As proposed in [12](Introduction of section 3), this cipher can be generalized to a complete algebraic structure. It is enough to adopt the infinite alphabet as in [12], x be transformed into the principal ideal ( x ) , k be transformed into the principal ideal ( k ) , y into the principal ideal ( y ) . This way we get algebraic encryption where the key ( k ) be the fractional ideal in the Dedekind's ring, in this case Z .

VII. THE ALPHABET AS A FRACTIONAL IDEAL

Let A be a set of characters. Assume | A | is equal to any prime number. Secretly establish a second alphabet A ′ such that A ′ ⊂ A with a prime length.

Let m 1 m 2 m 3 … m n be a message, we want to encrypt.

A secret short alphabet A ′ divides a large public alphabet into zones. We skip the extra characters such that 0, 1. So we have a clean alphabet from 2. Let's move one over, so we have 1. Suppose p = A | , q = A ′ | . We have ⌈ p q ⌉ zones. Zero zone, includes the alphabet from 1 to q . The first zone, i.e. the alphabet from q + 1 to 2 q and so on. The last zone ( ⌈ p q ⌉ − 1 ) includes the alphabet from ⌈ p q ⌉ q to p .

Let's extend the message values with random numbers informing us about a given zone of a given letter (this information denote by z i ):

z 1 m 1 z 2 m 2 … z n m n

Notes

Denote by k the key. Multiply each value of the message (not the information about the zone) by k and use the modulo q.

Hence ciphertext is:

z 1 d 1 z 2 d 2 … z n d n ,

where d 1 d 2 … d n be a encrypted message.

Now let's decode the message.

z 1 d 1 z 2 d 3 … z n d n

by dividing it into blocks (each block contains a zone and a message).

Let's apply the formula:

m i = d i + ( z i + t i ⋅ k ) | A | k ,

where m i is the decoded letter, d i encrypted letter, z is a number satisfies a congruence | A | − 1 z i ≡ d i ( mod k ) , k be the key, t be a zone.

Of course, this cryptosystem can also be easily generalized by turning individual elements into ideals.

VIII. APPLICATIONS OF POLYNOMIAL COMPOSITES IN CRYPTOLOGY

Finally, we will show cryptosystems based on polynomial composites and monoid domains.

Lemma 8.1. Let f = a 0 + a 1 X + ⋯ + a n − 1 X n − 1 + ∑ j = n m a j X j , g = b 0 + b 1 X + ⋯ + b n − 1 X n − 1 + ∑ j = n m b j X j , where a i , b i ∈ A i for i = 0 , 1 , … , n − 1 and a j , b j ∈ B for j = n , n + 1 , … , m . Then

f g ∈ A 0 + X B [ X ] .

Put A i , B j ( i , j = 0 , 1 , … , n − 1 ) be different encryption systems. Then we have f and g are composition of encryption systems. No consider B .

To improve security, let's fix that deg ⁡ f = n − 1 , deg ⁡ g = n − k , where k ∈ { 2 , … , n − 1 } . And such f , g Alice and Bob agree before the message is sent.

Alice and Bob multiply these composites to form one. We have f g = ( A 0 + A 1 X + … A k X k ) ( B 0 + B 1 X + ⋯ + B l X l ) = A 0 B 0 + ( A 0 B 1 + A 1 B 0 ) X + ⋯ + A k B l X k + l .

Note that the sum and product of the encryption systems must be defined in the formula above. Definitions we leave Alice and Bob. But in this section we can put S i S j : x → ( x ) S i ( x ) S j and S i + S j : x → ( ( x ) S i ) S j . We can define the product and the sum of cryptosystems completely differently.

So in the product we encrypt the letter as two letters, the first in the first system and the second in the second system. And in the sum we encrypt the letter using the first system and then the second system. Of course, we can define completely different, at our discretion.

Assume that degree of fg is m and text to encrypt consists of more letters then m + 1 . Then we divide the text into blocks of length m + 1 . We can assume that f g ( 0 ) encrypts the first letter of each block. Expression at X of fg encrypts the second letter of each block, and expression at X 2 of fg encrypts the third letter and so on.

Now, let's see how to decrypt in this idea.

Assume that we have an encrypted message M 0 M 1 … M n . If our key is degree m, then we divide message on m + 1 partition. And every partion divide to two. Every two letters are one letter of message.

Earlier we define S i S j : x → ( x ) S i ( x ) S j and S i + S j : x → ( ( x ) S i ) S j . Then decryption of two letters M l M l + 1 ( l = 0 , 2 , 4 , … ) are M l M l + 1 = ( M l ) S i ( M l + 1 ) S j = N l , l + 1 (one letter) and M l = ( ( M l ) S i ) S j = ( N l ) i j (one letter).

The use of many cryptosystems in various configurations in a polynomial composite increases our security. The security here lies in the fact that the encrypted message is resistant to breaking under many cryptanalyst criteria.

It is very easy to decrypt the message when you know the key.

IX. APPLICATIONS OF MONOID DOMAINS IN CRYPTOLOGY

Any alphabet of characters creates a finite set. Most ciphers are based on finite sets. But we can have the idea of using the infinite alphabet A, although in reality they can be cyclical sets with an index that would mean a given cycle. For example, A 0 − 0 , B 0 − 1 , … , Z 0 − 25 , A 1 − 0 , B 1 − 1 , … , where A i = A , … , Z i = Z for i = 0 , 1 , … . We see that this is isomorphic to a monoid N 0 non-negative integers by a formula

f : A → N , f ( m i ) = i .

Then we can use a monoid domain by a map

φ : A → F [ A ] , φ ( m 0 , m 1 , … , m n ) = a 0 X m 0 + … a n X m n .

We want to encrypt the message m 0 m 1 m 2 … m n (the letters transform to numbers by a function φ ). We establish the secret key X. Let F be a field. We determine any coefficients from this field: a 0 , a 1 , … , a n . Then the message m 0 m 1 m 2 … m n be transformed into a polynomial of the form:

a 0 X m 0 + a 1 X m 1 + ⋯ + a n X m n .

We compute for i = 0 , 1 , … , n : d i = a i X m i ( mod | A | ) ( | A | must be prime) and then we have a decrypt message d 0 d 1 … d n .

Notes To decrypt it we need to use a formula (for i = 0 , 1 , … , n ):

m i = log X ⁡ d i a i ( mod | A | ) .

Proof.

log X ⁡ a i X m i a i = m i ( mod | A | ) .

References

17 Cites in Article
  1. 1. D. Anderson,David Anderson,Muhammad Zafrullah (1990). Factorization in integral domains. Journal of Pure and Applied Algebra, 69(1), 1-19.
  2. 2. D. Anderson,D. Anderson,M. Zafrullah,Rings D[X],K[X],Houston Mathematics (1991). Rings between D[X] and K[X].
  3. 3. D. Anderson,A. Ryckaert,The class group of D+M,J. Algebra (1988). The class group of D + M.
  4. 4. J. Brewer,E. Rutter (1976). D + M construction with general overrings. Mich. Math. J, 23, 33{42.
  5. 5. Costa,J. Mott,M. Zafrullah (1978). The construction D + XDS[X. J. Algebra
  6. 6. P. Jr (1968). The converse to a well known theorem on Noetherian rings.
  7. 7. M. Fontana,S. Kabbaj,On Krull,J. Algebra (1990). On the krull and valuative dimension of D + XDs[X] domains.
  8. 8. Kim (2001). FACTORIZATION IN MONOID DOMAINS.
  9. 9. Andy Magid (2014). The Separable Galois Theory of Commutative Rings, Chapman & Hall/CRC, Boca Raton, 2014.
  10. 10. (2020). Ł. Matysiak, On properties of composites and monoid domains, Accepted for printing in Advances and Applications in Mathematical Sciences, . pdf, (2020).
  11. 11. (2020). Ł. Matysiak, ACCP and atomic properties of composites and monoid domains, Accepted for printing in Indian Journal of Mathematics, . pdf, (2020).
  12. 12. Ł. Matysiak (2021). Generalized RSA cipher and Diffe-Hellman protocol. J. Appl. Math. & Informatics, 39
  13. 13. Ł. Matysiak (2021). On some properties of polynomial composites. arXiv
  14. 14. Ł. Matysiak (2021). Polynomial composites and certain types of fields extensions.
  15. 15. M. Jankowska,L. Matysiak (2021). Matysiak, A structure of Dedekind in the cryptosystem.
  16. 16. T. Shah,W. Khan (2010). On Factorization properties of monoid S and monoid domain D[S. International Mathematical Forum
  17. 17. M. Zafrullah,J. Algebra (1988). The D + XDS[X] construction from GCD-domains.

Funding

No external funding was declared for this work.

Conflict of Interest

The authors declare no conflict of interest.

Ethical Approval

No ethics committee approval was required for this article type.

Data Availability

Not applicable for this article.

How to Cite This Article

Magdalena Jankowska, Lukasz Matysiak. 2021. "A Polynomial Composites and Monoid Domains as Algebraic Structures and their Applications". Global Journal of Science Frontier Research - F: Mathematics & Decision GJSFR-F Volume 21 (GJSFR Volume 21 Issue 17 (F3)).

More Citation Formats

Download Citation

Issue Cover
GJSFR Volume 21 Issue 17 (F3)
Pg. 93-111
Journal Specifications

Crossref Journal DOI 10.17406/GJSFR

Print ISSN 0975-5896

e-ISSN 2249-4626

Keywords
Classification
GJSFR-F Classification MSC 2010: 08A40
Version of record
v1.2

Issue date
June 8, 2021

Language
English
Order Article Reprint
Experience in AR

Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.

Read in 3D

Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.

Article Matrices
Total Views: 882
Total Downloads: 64
All Trends

This is the heading

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.

High-quality academic research articles on global topics and journals.

A Polynomial Composites and Monoid Domains as Algebraic Structures and their Applications

Magdalena Jankowska
Magdalena Jankowska Kazimierz Wielki University
Lukasz Matysiak
Lukasz Matysiak

Request Access

Please fill out the form below to request access to this research paper. Your request will be reviewed by the editorial or author team.
X