More permutations and involutions for constructing bent functions
From MaRDI portal
Publication:2119853
DOI10.1007/s12095-021-00482-2OpenAlexW3149064242MaRDI QIDQ2119853
Longjiang Qu, Yubo Li, Kangquan Li, Sihem Mesnager
Publication date: 30 March 2022
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-021-00482-2
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Further constructions of infinite families of bent functions from new permutations and their duals
- Four decades of research on bent functions
- Strongly regular graphs associated with ternary bent functions
- On ``bent functions
- AG codes and AG quantum codes from the GGS curve
- Vectorial Boolean functions with very low differential-linear uniformity using Maiorana-McFarland type construction
- Several new classes of self-dual bent functions derived from involutions
- Involutions Over the Galois Field
- Optimal Codebooks From Binary Codes Meeting the Levenshtein Bound
- New Families of Codebooks Achieving the Levenstein Bound
- Several New Infinite Families of Bent Functions and Their Duals
- On Existence (Based on an Arithmetical Problem) and Constructions of Bent Functions
- The Geometry of Two-Weight Codes
- Bent-function sequences
- Modifying Maiorana--McFarland Type Bent Functions for Good Cryptographic Properties and Efficient Implementation
- Boolean Functions for Cryptography and Coding Theory
- Bent Functions
- New Bent Functions from Permutations and Linear Translators
- Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
This page was built for publication: More permutations and involutions for constructing bent functions