A class of cubic polynomial semi-bent functions over F₂^n
From MaRDI portal
Publication:7227487
Cites work
- A family of difference sets in non-cyclic groups
- A new class of monomial bent functions
- Binary Linear Codes With Few Weights From Two-to-One Functions
- Boolean functions for cryptography and coding theory
- Cubic Monomial Bent Functions: A Subclass of $\mathcal{M}$
- Four decades of research on bent functions
- Further projective binary linear codes derived from two-to-one functions and their duals
- Further results on semi-bent functions in polynomial form
- Further Study of 2-to-1 Mappings Over F2n
- scientific article; zbMATH DE number 1024089 (Why is no real title available?)
- Linear Codes From Some 2-Designs
- Monomial bent functions
- More About the Corpus of Involutions From Two-to-One Mappings and Related Cryptographic S-Boxes
- On Bent and Semi-Bent Quadratic Boolean Functions
- On cryptographic properties of the cosets of R(1, m)
- On semi-bent functions and related plateaued functions over the Galois field \(\mathbb{F}_{2^n}\)
- On Semibent Boolean Functions
- On Two-to-One Mappings Over Finite Fields
- Semibent Functions From Dillon and Niho Exponents, Kloosterman Sums, and Dickson Polynomials
- Some new three-valued crosscorrelation functions for binary m-sequences
- Some semi-bent functions with polynomial trace form
- The classifications of o-monomials and of 2-to-1 binomials are equivalent
- Two-to-one mappings and involutions without fixed points over \(\mathbb{F}_{2^n}\)
This page was built for publication: A class of cubic polynomial semi-bent functions over \(\mathbb{F}_{2^n}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7227487)
