Deciding EA-equivalence via invariants
From MaRDI portal
Publication:2130042
DOI10.1007/s12095-021-00513-yzbMath1495.94170OpenAlexW3186520020MaRDI QIDQ2130042
Publication date: 25 April 2022
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-021-00513-y
CCZ-equivalencevectorial Boolean functionsalmost perfect nonlinear (APN) functionsextended affine equivalence (EAequivalence)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A matrix approach for constructing quadratic APN functions
- Differential cryptanalysis of DES-like cryptosystems
- Codes, bent functions and permutations suitable for DES-like cryptosystems
- The Magma algebra system. I: The user language
- Equivalences of quadratic APN functions
- A new almost perfect nonlinear function which is not quadratic
- CCZ equivalence of power functions
- On Verification of Restricted Extended Affine Equivalence of Vectorial Boolean Functions
- Breaking Grain-128 with Dynamic Cube Attacks
- Verification of Restricted EA-Equivalence for Vectorial Boolean Functions
- New classes of almost bent and almost perfect nonlinear polynomials
- New Instances of Quadratic APN Functions
- On the Distance Between APN Functions
This page was built for publication: Deciding EA-equivalence via invariants