An improved upper bound for the number of plateaued binary mappings

MaRDI QIDQ6901213zbMATH OpenFDO

Authors Konstantin N. Pankov

Publication date 12 November 2025

Published in Prikladnaya Diskretnaya Matematika. Supplement (Search for Journal in Brave)

zbMATH Keywords

cryptographyinformation securitylocal limit theoremplateaued binary mappingspectral coefficientupper bound

Mathematics Subject Classification ID

Limit theorems in probability theory (60F99) Boolean functions (94D10)

Cites work

• Approximation of plateaued Boolean functions by monomial ones
• Asymptotic estimates for numbers of Boolean mappings with given cryptographic properties
• Boolean functions in coding theory and cryptography. Translated from the Russian by Svetla Nikova
• Generalized Plateaued Functions and Admissible (Plateaued) Functions
• Improved estimates for the number of (n, m, k)-resilient and correlation-immune Boolean mappings
• Local limit theorem for the distribution of incomplete vector formed by the weights of subfunctions of random binary mapping components
• On some recursive construction of plateaued resilient Boolean functions with step in 3 variables
• Plateaued functions on finite nonabelian groups
• Some conditions for the applicability of the integral cryptanalysis to 4-rounds of AES-like ciphers
• Speeds of convergence in limit theorems for joint distributions of some random binary mappings characteristics
• Vectorial Boolean functions for cryptography

This page was built for publication: An improved upper bound for the number of plateaued binary mappings

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