Counting Boolean functions with faster points

DOI10.1007/S10623-020-00738-7zbMATH Open1453.94174OpenAlexW3012377106MaRDI QIDQ2200517FDOQ2200517

Ferruh Özbudak, Ana Sălăgean

Publication date: 22 September 2020

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-020-00738-7

Recommendations

• Counting and characterising functions with ``fast points for differential attacks
• Distinguishing properties and applications of higher order derivatives of Boolean functions
• Fast algebraic immunity of Boolean functions
• On the fast algebraic immunity of majority functions
• Publication:4934737

zbMATH Keywords

Boolean functionslinear structuresdifferential attacks

Mathematics Subject Classification ID

Arithmetic theory of polynomial rings over finite fields (11T55) Boolean functions (94D10)

Cites Work

• Cube Attacks on Tweakable Black Box Polynomials
• Higher Order Derivatives and Differential Cryptanalysis
• Some inverse relations
• Title not available (Why is that?)
• Counting and characterising functions with ``fast points for differential attacks
• Distinguishing properties and applications of higher order derivatives of Boolean functions
• Improving Key Recovery to 784 and 799 Rounds of Trivium Using Optimized Cube Attacks
• Cube Testers and Key Recovery Attacks on Reduced-Round MD6 and Trivium
• \(GL(m,2)\) acting on \(R(r,m)/R(r-1,m)\)
• Title not available (Why is that?)

Cited In (2)

• The linear structures and fast points of rotation symmetric Boolean functions
• The \textit{crooked} property

Uses Software

• OEIS

This page was built for publication: Counting Boolean functions with faster points

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2200517)