Galois rings and algebraic cryptography (Q3982901)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 24978
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Galois rings and algebraic cryptography |
scientific article; zbMATH DE number 24978 |
Statements
Galois rings and algebraic cryptography (English)
0 references
26 June 1992
0 references
permutation polynomials
0 references
Galois ring
0 references
Dickson polynomials
0 references
public key cryptosystems
0 references
0.846639096736908
0 references
Let \(R\) be a finite local commutative ring with maximal ideal \(M\) and residue field \(k=R/M\). The polynomial \(f\in R[x]\) is monic irreducible if \(\mu f\) is irreducible in \(k[x]\) where \(\mu\) is the natural projection from \(R[x]\) to \(k[x]\). For \(p\) prime and \(n\), \(m\) integers, the Galois ring \(\mathrm{GR}(p^n,m)\) can be viewed as \((\mathbb{Z}/\mathbb{Z}_{p^n})[x]/(f)\). The Dickson polynomial \(g_d(x,a)\) of degree \(d\) over a commutative ring with identity \(R\) is \[ g_d(x,a) = \sum^{[d/2]}_{t=0}\frac{d}{d- t}\binom{d-t}{t}(-a)^tx^{d-2t} \] where \([\cdot]\) is the greatest integer function. Conditions under which Dickson polynomials permute \(\mathrm{GR}(p^n,m)\) are studied. It is shown that for \(a\) a unit in \(\mathrm{GR}(p^n,m)\), the set \({\mathcal P}(a) = \{g_d(x,a): g_d(x,a)\) permutes \(\mathrm{GR}(p^n,m)\}\) is closed under composition iff \(a=\pm 1\). The application of these results to public key cryptosystems is studied.
0 references