Distance between vectorial Boolean functions and affine analogues (following the eighth international olympiad in cryptography)
From MaRDI portal
Publication:6598552
DOI10.4213/MVK465MaRDI QIDQ6598552FDOQ6598552
Publication date: 5 September 2024
Published in: Matematicheskie Voprosy Kriptografii (Search for Journal in Brave)
Hamming distancenonlinearityAPN functionbent functiondifferential uniformityvectorial Boolean functionWalsh-Hadamard coefficients
Cites Work
- Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
- Perfect nonlinear S-boxes
- Title not available (Why is that?)
- Nonlinearities of S-boxes
- On nonlinearity of the second type of multi-output Boolean functions
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the nonlinearity of S-boxes and linear codes
- Boolean Functions for Cryptography and Coding Theory
- Bounds on the Nonlinearity of Differentially Uniform Functions by Means of Their Image Set Size, and on Their Distance to Affine Functions
- Title not available (Why is that?)
- К вопросу о приближении векторных функций над конечными полями аффинными аналогами
- Characteristics of nonlinearity of vectorial functions over finite fields
This page was built for publication: Distance between vectorial Boolean functions and affine analogues (following the eighth international olympiad in cryptography)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6598552)
