Access Restriction

Author Mesnager, Sihem ♦ Flori, Jean-Pierre
Source CiteSeerX
Content type Text
File Format PDF
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Dillon-like Exponent ♦ Hyper-bent Function ♦ General Setting ♦ Extension Degree ♦ Multiple Trace Term ♦ Charpin Gong Family ♦ Binomial Function ♦ Original Restriction ♦ New Infinite Class ♦ Mesnager Approach ♦ Boolean Function ♦ Infinite Family ♦ Charpin Gong Criterion ♦ Arbitrary Dillon-like Exponent
Abstract This note is devoted to hyper-bent functions with multiple trace terms (including binomial functions) via Dillon-like exponents. We show how the approach developed by Mesnager to extend the Charpin–Gong family and subsequently extended by Wang et al. fits in a much more general setting. To this end, we first explain how the original restriction for Charpin–Gong criterion can be weakened before generalizing the Mesnager approach to arbitrary Dillon-like exponents. Afterward, we tackle the problem of devising infinite families of extension degrees for which a given exponent is valid and apply these results not only to reprove straightforwardly the results of Mesnager and Wang et al., but also to characterize the hyper-bentness of new infinite classes of Boolean functions.
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research
Education Level UG and PG ♦ Career/Technical Study
Publisher Date 2012-01-01