Deciding EA-equivalence via invariants

DOI10.1007/s12095-021-00513-yzbMath1495.94170OpenAlexW3186520020MaRDI QIDQ2130042

Nikolay Kaleyski

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

zbMATH Keywords

CCZ-equivalencevectorial Boolean functionsalmost perfect nonlinear (APN) functionsextended affine equivalence (EAequivalence)

Mathematics Subject Classification ID

Cryptography (94A60) Boolean functions (94D10)

Related Items (2)

Triplicate functions ⋮ Constructing more quadratic APN functions with the QAM method

Uses Software

• Magma

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