Cryptographic functions with interesting properties from CCZ-equivalence
From MaRDI portal
Publication:6110157
DOI10.1007/s12095-023-00646-2zbMath1526.94063OpenAlexW4379645305MaRDI QIDQ6110157
Lijing Zheng, Yanjun Li, Haibin Kan, Jie Peng
Publication date: 31 July 2023
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-023-00646-2
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An answer to an open problem of Mesnager on bent functions
- Differential cryptanalysis of DES-like cryptosystems
- Constructing new APN functions from known ones
- On ``bent functions
- Codes, bent functions and permutations suitable for DES-like cryptosystems
- On CCZ-equivalence, extended-affine equivalence, and function twisting
- On constructions and properties of \((n,m)\)-functions with maximal number of bent components
- Several new infinite families of bent functions via second order derivatives
- A new method for secondary constructions of vectorial bent functions
- Further study on the maximum number of bent components of vectorial functions
- CCZ-equivalence of bent vectorial functions and related constructions
- Cryptanalysis of a Theorem: Decomposing the Only Known Solution to the Big APN Problem
- Involutions Over the Galois Field
- Several New Infinite Families of Bent Functions and Their Duals
- New classes of almost bent and almost perfect nonlinear polynomials
- Monomial bent functions
- Cubic Monomial Bent Functions: A Subclass of $\mathcal{M}$
- A Generalisation of Dillon's APN Permutation With the Best Known Differential and Nonlinear Properties for All Fields of Size $2^{4k+2}$
- On the Maximum Number of Bent Components of Vectorial Functions
- Analysis of (n, n)-Functions Obtained From the Maiorana-McFarland Class
- On a Class of Functions With the Maximal Number of Bent Components
- Generic Constructions of (Boolean and Vectorial) Bent Functions and Their Consequences
- Construction and Analysis of Cryptographic Functions
- Boolean Functions for Cryptography and Coding Theory
- Bent Functions
- Maximal recursive sequences with 3-valued recursive cross-correlation functions (Corresp.)
This page was built for publication: Cryptographic functions with interesting properties from CCZ-equivalence
