Algebraic construction of near-bent function with application to cryptography
From MaRDI portal
Publication:5035103
DOI10.1080/09720529.2021.1897214zbMATH Open1484.94042OpenAlexW3155017453MaRDI QIDQ5035103FDOQ5035103
Vadiraja G. R. Bhatta, Shashi Kant Pandey, Harikrishnan Panackal, Prasanna Poojary
Publication date: 21 February 2022
Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/09720529.2021.1897214
Cites Work
- Construction of bent functions from near-bent functions
- On ``bent functions
- A new characterization of semi-bent and bent functions on finite fields
- On Bent and Semi-Bent Quadratic Boolean Functions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bent Functions
- Fast Software Encryption
- Title not available (Why is that?)
- Boolean and Vectorial Plateaued Functions and APN Functions
- Boolean functions and their applications in cryptography
- Title not available (Why is that?)
- Near bent functions on a hyperplane
- Title not available (Why is that?)
- Spectra of Boolean Functions, Subspaces of Matrices, and Going Up Versus Going Down
- From near-bent to bent: A special case
- Design methods for semi-bent functions
- Algebraic construction of near-bent and APN functions
- Title not available (Why is that?)
- A Parallel Efficient Architecture for Large Cryptographically Robust n × k (k>n/2) Mappings
- On maximally nonlinear and extremal balanced Boolean functions
- Correlation immunity of three-valued logic functions
- Symmetric key end to end Cryptosystem using Plateaued functions and Hadamard matrix
Cited In (1)
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)
