Nonsingular plane cubic curves over finite fields
Journal of Combinatorial Theory Series A
A course in computational algebraic number theory
A course in computational algebraic number theory
Elliptic curves and their applications to cryptography: an introduction
Elliptic curves and their applications to cryptography: an introduction
On Z_4-Linear Goethals Codes and KloostermanSums
Designs, Codes and Cryptography - Special issue on designs and codes—a memorial tribute to Ed Assmus
Elliptic curves in cryptography
Elliptic curves in cryptography
Constructing Elliptic Curve Cryptosystems in Characteristic 2
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
ASIACRYPT '94 Proceedings of the 4th International Conference on the Theory and Applications of Cryptology: Advances in Cryptology
On the Connection between Kloosterman Sums and Elliptic Curves
SETA '08 Proceedings of the 5th international conference on Sequences and Their Applications
A New Family of Hyper-Bent Boolean Functions in Polynomial Form
Cryptography and Coding '09 Proceedings of the 12th IMA International Conference on Cryptography and Coding
Faster multiplication in GF(2)[x]
ANTS-VIII'08 Proceedings of the 8th international conference on Algorithmic number theory
Matters Computational: Ideas, Algorithms, Source Code
Matters Computational: Ideas, Algorithms, Source Code
A new class of bent and hyper-bent Boolean functions in polynomial forms
Designs, Codes and Cryptography
IEEE Transactions on Information Theory
Constructions of quadratic bent functions in polynomial forms
IEEE Transactions on Information Theory
Hyperbent Functions, Kloosterman Sums, and Dickson Polynomials
IEEE Transactions on Information Theory
Semibent Functions From Dillon and Niho Exponents, Kloosterman Sums, and Dickson Polynomials
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
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.