An analysis of a class of algorithms for \(S\)-box construction

DOI10.1007/BF02318546zbMath0814.94017MaRDI QIDQ1335025

Luke O'Connor

Publication date: 26 September 1994

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

zbMATH Keywords

permutationsalgorithmscryptosystems\(m\)-bit invertible \(S\)-boxesbit-by-bit methodproduct ciphers

Mathematics Subject Classification ID

Cryptography (94A60) Parallel algorithms in computer science (68W10)

Cites Work

• Methods and instruments for designing S-boxes
• The structured design of cryptographically good s-boxes
• Analysis and design of stream ciphers
• On ``bent functions
• Correlation-immunity of nonlinear combining functions for cryptographic applications (Corresp.)
• Communication Theory of Secrecy Systems*
• Structured Design of Substitution-Permutation Encryption Networks
• An Expanded Set of S-box Design Criteria Based on Information Theory and its Relation to Differential-Like Attacks
• Perfect nonlinear S-boxes
• Analytic Inequalities
• On the Application of the Borel-Cantelli Lemma
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An analysis of a class of algorithms for \(S\)-box construction