Semi-bent functions with multiple trace terms and hyperelliptic curves

Authors:
Sihem Mesnager
Affiliations:
LAGA (Laboratoire Analyse, Géometrie et Applications), UMR 7539, CNRS, Department of Mathematics, University of Paris XIII and University of Paris VIII, Saint-Denis Cedex, France
Venue:
LATINCRYPT'12 Proceedings of the 2nd international conference on Cryptology and Information Security in Latin America
Year:
2012

Citing 12
Cited 0

Fast correlation attacks on stream ciphers

Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
Linear cryptanalysis method for DES cipher

EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Plateaued Functions

ICICS '99 Proceedings of the Second International Conference on Information and Communication Security
Elliptic Curves and Resilient Functions

ICISC '00 Proceedings of the Third International Conference on Information Security and Cryptology
Semi-bent Functions

ASIACRYPT '94 Proceedings of the 4th International Conference on the Theory and Applications of Cryptology: Advances in Cryptology
Construction of bent functions via Niho power functions

Journal of Combinatorial Theory Series A
Hyper-bent Boolean functions with multiple trace terms

WAIFI'10 Proceedings of the Third international conference on Arithmetic of finite fields
A new class of bent and hyper-bent Boolean functions in polynomial forms

Designs, Codes and Cryptography
On cryptographic properties of the cosets of R(1, m)

IEEE Transactions on Information Theory
On bent and semi-bent quadratic Boolean functions

IEEE Transactions on Information Theory
An Efficient Characterization of a Family of Hyperbent Functions

IEEE Transactions on Information Theory
Semibent Functions From Dillon and Niho Exponents, Kloosterman Sums, and Dickson Polynomials

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

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 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.