An efficient characterization of a family of hyper-bent functions with multiple trace terms
نویسندگان
چکیده
Lisoněk recently reformulated the characterization of Charpin and Gong of a large class of hyper-bent functions in terms of cardinalities of hyperelliptic curves following previous ideas of Lachaud and Wolfmann, and Katz and Livné. In this paper, we present a generic approach of such ideas and show that it applies naturally to a distinct family of functions proposed by Mesnager. Doing so, a polynomial time and space test for the hyper-bentness of functions in this family is obtained. We then show how this reformulation can be transformed to obtain a more efficient test leading to a substantial practical gain. We finally elaborate on an open problem about hyperelliptic curves related to a family of Boolean functions studied by charpin and Gong.
منابع مشابه
Dickson Polynomials, Hyperelliptic Curves and Hyper-bent Functions
In this paper, we study the action of Dickson polynomials on subsets of finite fields of even characteristic related to the trace of the inverse of an element and provide an alternate proof of a not so well-known result. Such properties are then applied to the study of a family of Boolean functions and a characterization of their hyper-bentness in terms of exponential sums recently proposed by ...
متن کاملA note on hyper-bent functions via Dillon-like exponents
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 ...
متن کاملA new class of hyper-bent functions and Kloosterman sums
This paper is devoted to the characterization of hyper-bent functions. Several classes of hyper-bent functions have been studied, such as Charpin and Gong’s ∑ r∈R Tr1 (arx r(2m−1)) and Mesnager’s ∑ r∈R Tr1 (arx r(2m−1)) + Tr1(bx 2n−1 3 ), where R is a set of representations of the cyclotomic cosets modulo 2 + 1 of full size n and ar ∈ F2m . In this paper, we generalize their results and conside...
متن کاملSemi-bent Functions with Multiple Trace Terms and Hyperelliptic Curves
Semi-bent functions with even number of variables are a class of important Boolean functions whose Hadamard transform takes three values. In this note we are interested in the property of semi-bentness of Boolean functions defined on the Galois field F2n (n even) with multiple trace terms obtained via Niho functions and two Dillon-like functions (the first one has been studied by Mesnager and t...
متن کاملHyper-bent Boolean Functions with Multiple Trace Terms
Introduced by Rothaus in 1976 as interesting combinatorial objects, bent functions are maximally nonlinear Boolean functions with even numbers of variables whose Hamming distance to the set of all affine functions equals 2n−1 ± 2 n 2 −1. Not only bent functions are applied in cryptography, such as applications in components of S-box, block cipher and stream cipher, but also they have relations ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Mathematical Cryptology
دوره 7 شماره
صفحات -
تاریخ انتشار 2013