Counting and characterising functions with ``fast points for differential attacks
From MaRDI portal
Publication:505073
DOI10.1007/S12095-015-0166-1zbMATH Open1362.94050DBLPjournals/ccds/SalageanM17OpenAlexW2256579980WikidataQ59615123 ScholiaQ59615123MaRDI QIDQ505073FDOQ505073
Authors: Ana Sălăgean, Matei Mandache-Sălăgean
Publication date: 19 January 2017
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-015-0166-1
Recommendations
Cites Work
Cited In (8)
- Higher Order Derivatives and Differential Cryptanalysis
- The linear structures and fast points of rotation symmetric Boolean functions
- Higher order differentiation over finite fields with applications to generalising the cube attack
- Discrete antiderivatives for functions over \(\mathbb{F}_p^n\)
- Counting Boolean functions with faster points
- Probabilistic estimation of the algebraic degree of Boolean functions
- Three basic questions on Boolean functions
- Distinguishing properties and applications of higher order derivatives of Boolean functions
This page was built for publication: Counting and characterising functions with ``fast points for differential attacks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q505073)