An efficient characterization of a family of hyper-bent functions with multiple trace terms

DOI10.1515/jmc-2012-0013zbMath1316.94136OpenAlexW2165064480MaRDI QIDQ2846949

Sihem Mesnager, Jean-Pierre Flori

Publication date: 4 September 2013

Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/jmc-2012-0013

zbMATH Keywords

hyperelliptic curvesBoolean functionsmaximum nonlinearityWalsh-Hadamard transformDickson polynomialshyperbent functions

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (5)

Constructing Hyper-Bent Functions from Boolean Functions with the Walsh Spectrum Taking the Same Value Twice ⋮ Möbius transformations and characterizations of hyper-bent functions from Dillon-like exponents with coefficients in extension fields ⋮ On generalized hyper-bent functions ⋮ Four decades of research on bent functions ⋮ A class of hyper-bent functions and Kloosterman sums

Uses Software

• Magma

This page was built for publication: An efficient characterization of a family of hyper-bent functions with multiple trace terms