On binary Kloosterman sums divisible by 3
From MaRDI portal
Publication:1009054
DOI10.1007/s10623-008-9171-0zbMath1196.94084MaRDI QIDQ1009054
Petr Lisoněk, Kseniya Garaschuk
Publication date: 31 March 2009
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-008-9171-0
Related Items
Ternary Kloosterman sums modulo 4, The divisibility modulo 24 of Kloosterman sums on \(\text{GF}(2^m)\), \(m\) even, Divisibility properties of classical binary Kloosterman sums, Some congruences of Kloosterman sums and their characteristic polynomials, An efficient deterministic test for Kloosterman sum zeros
Cites Work
- Unnamed Item
- Unnamed Item
- The divisibility modulo 24 of Kloosterman sums on \(\text{GF}(2^m)\), \(m\) odd
- Codes, bent functions and permutations suitable for DES-like cryptosystems
- Codes, graphs, and schemes from nonlinear functions
- On \(\mathbb{Z}_4\)-linear Goethals codes and Kloosterman sums
- Binary caps with many free pairs of points
- The weights of the orthogonals of the extended quadratic binary Goppa codes
- Families of curves and weight distributions of codes