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
Codes, Bent Functions and Permutations Suitable For DES-likeCryptosystems
Designs, Codes and Cryptography
Cocyclic Generalised Hadamard Matrices and Central RelativeDifference Sets
Designs, Codes and Cryptography
Discrete Mathematics
A New Construction of Central Relative (pa, pa, pa, 1)-Difference Sets
Designs, Codes and Cryptography
Nonlinear functions in abelian groups and relative difference sets
Discrete Applied Mathematics - Optimal discrete structure and algorithms (ODSA 2000)
Journal of Complexity - Special issue on coding and cryptography
Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)
Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)
A theory of highly nonlinear functions
AAECC'06 Proceedings of the 16th international conference on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Almost perfect nonlinear power functions on GF(2n): the Welch case
IEEE Transactions on Information Theory
A new APN function which is not equivalent to a power mapping
IEEE Transactions on Information Theory
New classes of almost bent and almost perfect nonlinear polynomials
IEEE Transactions on Information Theory
On Almost Perfect Nonlinear Functions Over
IEEE Transactions on Information Theory
Finite Fields and Their Applications
EA and CCZ Equivalence of Functions over GF(2n)
WAIFI '08 Proceedings of the 2nd international workshop on Arithmetic of Finite Fields
Hadamard matrices and their applications: Progress 2007---2010
Cryptography and Communications
Equivalence classes of multiplicative central (pn, pn, pn, 1)-relative difference sets
Cryptography and Communications
On EA-equivalence of certain permutations to power mappings
Designs, Codes and Cryptography
| Hi-index | 0.01 |
Bundles are equivalence classes of functions derived from equivalence classes of transversals. They preserve measures of resistance to differential and linear cryptanalysis. For functions over GF(2 n ), affine bundles coincide with EA-equivalence classes. From equivalence classes ("bundles") of presemifields of order p n , we derive bundles of functions over GF(p n ) of the form 驴(x)*驴(x), where 驴, 驴 are linearised permutation polynomials and * is a presemifield multiplication. We prove there are exactly p bundles of presemifields of order p 2 and give a representative of each. We compute all bundles of presemifields of orders p n 驴 27 and in the isotopism class of GF(32) and we measure the differential uniformity of the derived 驴(x)*驴(x). This technique produces functions with low differential uniformity, including PN functions (p odd), and quadratic APN and differentially 4-uniform functions (p = 2).