Finite fields
Planar Functions and Planes of Lenz-Barlotti Class II
Designs, Codes and Cryptography
The MAGMA algebra system I: the user language
Journal of Symbolic Computation - Special issue on computational algebra and number theory: proceedings of the first MAGMA conference
Handbook of Coding Theory
Journal of Complexity - Special issue on coding and cryptography
A family of skew Hadamard difference sets
Journal of Combinatorial Theory Series A
Planar polynomials for commutative semifields with specified nuclei
Designs, Codes and Cryptography
New Perfect Nonlinear Multinomials over F$_{p^{2k}}$ for Any Odd Prime p
SETA '08 Proceedings of the 5th international conference on Sequences and Their Applications
A New Tool for Assurance of Perfect Nonlinearity
SETA '08 Proceedings of the 5th international conference on Sequences and Their Applications
New Commutative Semifields and Their Nuclei
AAECC-18 '09 Proceedings of the 18th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
On the covering structures of two classes of linear codes from perfect nonlinear functions
IEEE Transactions on Information Theory
Nonlinear functions in abelian groups and relative difference sets
Discrete Applied Mathematics
New semifields, PN and APN functions
Designs, Codes and Cryptography
The permutation group of affine-invariant extended cyclic codes
IEEE Transactions on Information Theory - Part 2
New classes of almost bent and almost perfect nonlinear polynomials
IEEE Transactions on Information Theory
Perfect nonlinear binomials and their semifields
Finite Fields and Their Applications
Sequences and functions derived from projective planes and their difference sets
WAIFI'12 Proceedings of the 4th international conference on Arithmetic of Finite Fields
Hi-index | 0.00 |
A function f : Fpn → Fpn is planar, if f(x+a)-f(x) = b has precisely one solution for all a, b ε Fpn, a ≠ 0. In this paper, we discuss possible extensions of the switching idea developed in [1] to the case of planar functions. We show that some of the known planar functions can be constructed from each other by switching.