Sciweavers

IJNSEC
2010
105views more  IJNSEC 2010»
13 years 6 months ago
A Note on the Constructions of Orthomorphic Permutations
Orthomorphic permutations have important applications in the design of block ciphers. A practical algorithm is derived to generate all orthomorphic permutations over Fm 2 , and it...
Jianqin Zhou
FQ
2003
Springer
14 years 4 months ago
Symplectic Spreads and Permutation Polynomials
Every symplectic spread of PG(3, q), or equivalently every ovoid of Q(4, q), is shown to give a certain family of permutation polynomials of GF(q) and conversely. This leads to an...
Simeon Ball, Michael Zieve