✦ LIBER ✦

Cryptological Applications of Permutation Polynomials

✍ Scribed by Indivar Gupta; Laxmi Narain; C.E. Veni Madhavan

Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 76 KB
Volume: 15
Category: Article
ISSN: 1571-0653
DOI: 10.1016/s1571-0653(04)00541-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Groups of Permutation Polynomials over F

Groups of Permutation Polynomials over Finite Fields

✍ Richard M. Stafford 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 195 KB

Let F be a finite field. We apply a result of Thierry Berger (1996, Designs Codes Cryptography, 7, 215-221) to determine the structure of all groups of permutations on F generated by the permutations induced by the linear polynomials and any power map which induces a permutation on F.

Computing Bases for Rings of Permutation

Computing Bases for Rings of Permutation-invariant Polynomials

✍ Manfred Göbel 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 225 KB

Let \(R\) be a commutative ring with 1 , let \(R\left[X_{1}, \ldots, X_{n}\right]\) be the polynomial ring in \(X_{1}, \ldots, X_{n}\) over \(R\) and let \(G\) be an arbitrary group of permutations of \(\left\{X_{1}, \ldots, X_{n}\right\}\). The paper presents an algorithm for computing a small fini

Permutation polynomials of Abelian group

Permutation polynomials of Abelian group rings over finite fields

✍ Daniel A. Ashlock 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 267 KB

Bases for Polynomial Invariants of Conju

Bases for Polynomial Invariants of Conjugates of Permutation Groups

✍ Samir Khuller; Manfred Göbel; Jochen Walter 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 41 KB

Compositional attractors and enumeration

Compositional attractors and enumeration of permutation polynomials over finite fields

✍ Daniel A. Ashlock 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 560 KB

The major index polynomial for conjugacy

The major index polynomial for conjugacy classes of permutations

✍ Michelle L. Wachs 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 628 KB

Garsia (1988) gives a remarkably simple expression for the major index enumerator for permutations of a fixed cycle type evaluated at a primitive root of unity. He asks for a direct combinatorial proof of this identity. Here we give such a combinatorial derivation.