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

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

• Counting Boolean functions with faster points
• Distinguishing properties and applications of higher order derivatives of Boolean functions
• Higher Order Derivatives and Differential Cryptanalysis
• Fast algebraic immunity of Boolean functions
• scientific article; zbMATH DE number 1455090

zbMATH Keywords

polynomials over finite fieldscryptanalysishigher order derivativehigher order differential attacks

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (5)

• Higher Order Derivatives and Differential Cryptanalysis
• The linear structures and fast points of rotation symmetric Boolean functions
• Counting Boolean functions with faster points
• Probabilistic estimation of the algebraic degree of Boolean functions
• Three basic questions on 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)