Counting and characterising functions with ``fast points for differential attacks

DOI10.1007/s12095-015-0166-1zbMath1362.94050DBLPjournals/ccds/SalageanM17OpenAlexW2256579980WikidataQ59615123 ScholiaQ59615123MaRDI QIDQ505073

Matei Mandache-Sălăgean, Ana 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

zbMATH Keywords

cryptanalysispolynomials over finite fieldshigher order derivativehigher order differential attacks

Mathematics Subject Classification ID

Cryptography (94A60) Polynomials over finite fields (11T06)

Related Items (3)

Probabilistic estimation of the algebraic degree of Boolean functions ⋮ Three basic questions on Boolean functions ⋮ Counting Boolean functions with faster points

Cites Work

• Distinguishing properties and applications of higher order derivatives of Boolean functions
• Differential cryptanalysis of DES-like cryptosystems
• High order differential attacks on stream ciphers
• Cube Attacks on Tweakable Black Box Polynomials
• Higher Order Derivatives and Differential Cryptanalysis

This page was built for publication: Counting and characterising functions with ``fast points for differential attacks