You are looking at a specific version 20110710:025438 of this paper. See the latest version.

Paper 2011/364

The Value $4$ of Binary Kloosterman Sums

Jean-Pierre Flori and Sihem Mesnager and Gérard Cohen

Abstract

Kloosterman sums have recently become the focus of much research, most notably due to their applications in cryptography and their relations to coding theory. Very recently Mesnager has showed that the value $4$ of binary Kloosterman sums gives rise to several infinite classes of bent functions, hyper-bent functions and semi-bent functions in even dimension. In this paper we analyze the different strategies used to find zeros of binary Kloosterman sums to develop and implement an algorithm to find the value $4$ of such sums. We then present experimental results showing that the value $4$ of binary Kloosterman sums gives rise to bent functions for small dimensions, a case with no mathematical solution so far.

Metadata
Available format(s)
PDF
Category
Foundations
Publication info
Published elsewhere. Unknown where it was published
Keywords
Kloosterman sumselliptic curvesBoolean functionsWalsh-Hadamard transformbent functions
Contact author(s)
flori @ enst fr
History
2011-07-10: received
Short URL
https://ia.cr/2011/364
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.