The relationship between the level of affinity and cryptographic parameters of Boolean functions

DOI10.1515/DMA.2008.018zbMath1173.94417MaRDI QIDQ3184536

M. L. Buryakov

Publication date: 21 October 2009

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

Mathematics Subject Classification ID

Cryptography (94A60) Boolean functions (06E30)

Related Items (3)

Asymptotic bounds for the affinity level for almost all Boolean functions ⋮ A LOWER BOUND FOR THE DISTANCE BETWEEN A BIJUNCTIVE FUNCTION AND A FUNCTION WITH THE FIXED ALGEBRAIC IMMUNITY ⋮ Unnamed Item

Cites Work

• On ``bent functions
• Correlation-immunity of nonlinear combining functions for cryptographic applications (Corresp.)
• Cryptanalysis of Block Ciphers with Overdefined Systems of Equations
• On the affinity level of Boolean functions

This page was built for publication: The relationship between the level of affinity and cryptographic parameters of Boolean functions