Boolean functions without prediction

DOI10.1515/DMA.2011.013MaRDI QIDQ3004819zbMATH OpenOpenAlexFDO

Authors S. V. Smyshlyaev

Publication date 3 June 2011

Published in Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/dma.2011.013

zbMATH Keywords

Boolean functionfinite-length barrierperfectly balanced

Mathematics Subject Classification ID

Boolean functions (06E30) Cryptography (94A60)

Recommendations

• Self-predicting Boolean functions
• scientific article; zbMATH DE number 4012691
• Properties of Boolean functions without three-argument implicents
• scientific article; zbMATH DE number 2146625
• On the Boolean functions without upper bijunctive analogues
• Boolean random functions
• Sur la non-linéarité des fonctions booléennes
• On the non-linearity of Boolean functions
• scientific article; zbMATH DE number 3185967
• scientific article; zbMATH DE number 953683

Cites work

• Barriers of perfectly balanced Boolean functions
• New methods of investigation of perfectly balanced Boolean functions

Cited in

(4)

• On 1-stable perfectly balanced Boolean functions
• Barriers of perfectly balanced Boolean functions
• Self-predicting Boolean functions
• On some properties of the curvature and nondegeneracy of Boolean functions

This page was built for publication: Boolean functions without prediction

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