On the Link of Some Semi-bent Functions with Kloosterman Sums

DOI10.1007/978-3-642-20901-7_17zbMath1272.94101MaRDI QIDQ3005595

Sihem Mesnager, Gérard D. Cohen

Publication date: 8 June 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-20901-7_17

zbMATH Keywords

Kloosterman sums; Boolean function; Walsh-Hadamard transformation; semi-bent function

Mathematics Subject Classification ID

11T71: Algebraic coding theory; cryptography (number-theoretic aspects)

11L05: Gauss and Kloosterman sums; generalizations

Related Items

Four decades of research on bent functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• New cyclic difference sets with Singer parameters
• The divisibility modulo 24 of Kloosterman sums on \(\text{GF}(2^m)\), \(m\) odd
• Fast correlation attacks on certain stream ciphers
• Some results about the cross-correlation function between two maximal linear sequences
• A new characterization of semi-bent and bent functions on finite fields
• Construction of bent functions via Niho power functions
• The weights of the orthogonals of the extended quadratic binary Goppa codes
• On Bent and Semi-Bent Quadratic Boolean Functions
• Monomial bent functions
• The covering radius of the (128,8) Reed-Muller code is 56 (Corresp.)
• Explicit evaluation of certain exponential sums.
• On binary cyclic codes with codewords of weight three and binary sequences with the trinomial property
• The covering radius of the<tex>(2^{15}, 16)</tex>Reed-Muller code is at least 16276
• Maximal recursive sequences with 3-valued recursive cross-correlation functions (Corresp.)