✦ LIBER ✦

Permutation Polynomials Modulo 2w

✍ Scribed by Ronald L. Rivest

Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 235 KB
Volume: 7
Category: Article
ISSN: 1071-5797
DOI: 10.1006/ffta.2000.0282

No coin nor oath required. For personal study only.

✦ Synopsis

We give an exact characterization of permutation polynomials modulo n"2U, w52:

) is even, and (a #a #a #2) is even. We also characterize polynomials de"ning latin squares modulo n"2U, but prove that polynomial multipermutations (that is, a pair of polynomials de"ning a pair of orthogonal latin squares) modulo n"2U do not exist.

📜 SIMILAR VOLUMES

On Permutation Polynomials

✍ Luyan Wang 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 92 KB

Permutation polynomials on matrices

✍ N.S. James; R. Lidl 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 539 KB

Roots of Polynomials Modulo Prime Powers

✍ Bruce Dearden; Jerry Metzger 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 202 KB

In general , not every set of values modulo n will be the set of roots modulo n of some polynomial . In this note , some characteristics of those sets which are root sets modulo a prime power are developed , and these characteristics are used to determine the number of dif ferent sets of integers wh

Permutation polynomials on symmetric mat

Permutation polynomials on symmetric matrices

✍ Timothy C. Teitloff 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 109 KB

This paper contains a general characterization for the permutation polynomials of the symmetric matrices over any ®eld. Speci®c characterizations are for symmetric matrices over algebraically closed ®elds, principal axis ®elds, and ®nite ®elds. In the latter case enumeration formulas are established

Cryptological Applications of Permutatio

Cryptological Applications of Permutation Polynomials

✍ Indivar Gupta; Laxmi Narain; C.E. Veni Madhavan 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 76 KB

Root Sets of Polynomials Modulo Prime Po

Root Sets of Polynomials Modulo Prime Powers

✍ Davesh Maulik 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 194 KB

A subset R of the integers modulo n is defined to be a root set if it is the set of roots of some polynomial. Using the Chinese Remainder Theorem, the question of finding and counting root sets mod n is reduced to finding root sets modulo a prime power. In this paper, we provide a recursive construc