Algebraic nonlinearity and its applications to cryptography

DOI10.1007/BF00203964zbMath0811.94029MaRDI QIDQ1340195

Luke O'Connor, Andrew Klapper

Publication date: 10 May 1995

Published in: Journal of Cryptology (Search for Journal in Brave)

zbMATH Keywords

cryptographyBoolean functionexpectationalgebraic nonlinearitypartially linearlinear structure

Mathematics Subject Classification ID

Cryptography (94A60) Boolean functions (06E30)

Related Items

On various nonlinearity measures for Boolean functions, A quantum related-key attack based on the Bernstein-Vazirani algorithm, A quantum algorithm to approximate the linear structures of Boolean functions, Comment on ``Bounds on the number of functions satisfying the Strict Avalanche Criterion, Improved BV-based quantum attack on block ciphers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Differential cryptanalysis of DES-like cryptosystems
• Enumerating Boolean functions of cryptographic significance
• Methods and instruments for designing S-boxes
• The structured design of cryptographically good s-boxes
• Analysis and design of stream ciphers
• On ``bent functions
• Des has no Per Round Linear Factors
• Correlation-immunity of nonlinear combining functions for cryptographic applications (Corresp.)
• Communication Theory of Secrecy Systems*
• Structured Design of Substitution-Permutation Encryption Networks
• Enumerating Nondegenerate Permutations
• Perfect nonlinear S-boxes
• Statistical Complexity of Algorithms for Boolean Function Minimization
• The Production of Completion Signals by Asynchronous, Iterative Networks