Algebraic construction of near-bent function with application to cryptography
From MaRDI portal
Publication:5035103
Recommendations
Cites work
- scientific article; zbMATH DE number 6508183 (Why is no real title available?)
- scientific article; zbMATH DE number 4083539 (Why is no real title available?)
- scientific article; zbMATH DE number 1024089 (Why is no real title available?)
- scientific article; zbMATH DE number 2009966 (Why is no real title available?)
- scientific article; zbMATH DE number 1418253 (Why is no real title available?)
- scientific article; zbMATH DE number 4195884 (Why is no real title available?)
- A Parallel Efficient Architecture for Large Cryptographically Robust n × k (k>n/2) Mappings
- A new characterization of semi-bent and bent functions on finite fields
- Algebraic construction of near-bent and APN functions
- Bent functions. Fundamentals and results
- Boolean and vectorial plateaued functions and APN functions
- Boolean functions and their applications in cryptography
- Construction of bent functions from near-bent functions
- Correlation immunity of three-valued logic functions
- Design methods for semi-bent functions
- Fast Software Encryption
- From near-bent to bent: a special case
- Near bent functions on a hyperplane
- On Bent and Semi-Bent Quadratic Boolean Functions
- On ``bent functions
- On maximally nonlinear and extremal balanced Boolean functions
- Spectra of Boolean Functions, Subspaces of Matrices, and Going Up Versus Going Down
- Symmetric key end to end Cryptosystem using Plateaued functions and Hadamard matrix
Cited in
(2)
This page was built for publication: Algebraic construction of near-bent function with application to cryptography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5035103)