Abstract

Semi-bent functions with even number of variables are a class of important Boolean functions whose Hadamard transform takes three values. Semi-bent functions have been extensively studied due to their applications in cryptography and coding theory. In this paper we are interested in the property of semi-bentness of Boolean functions defined on the Galois field <${\mathbb F}_2^n$ (n even) with multiple trace terms obtained via Niho functions and two Dillon-like functions (the first one has been studied by the author and the second one has been studied very recently by Wang et al. using an approach introduced by the author). We subsequently give a connection between the property of semi-bentness and the number of rational points on some associated hyperelliptic curves. We use the hyperelliptic curve formalism to reduce the computational complexity in order to provide an efficient test of semi-bentness leading to substantial practical gain thanks to the current implementation of point counting over hyperelliptic curves.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call