An analysis of a class of algorithms for \(S\)-box construction
type: Item
instance of: scholarly article
title: An analysis of a class of algorithms for \(S\)-box construction
zbMATH Open document ID: 0814.94017
DOI: 10.1007/BF02318546
author: Luke O'Connor
published in: Journal of Cryptology
publication date: 1994-09-26T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 68W10
zbMATH DE Number: 644808
zbMATH Keywords: product ciphers
zbMATH Keywords: permutations
zbMATH Keywords: cryptosystems
zbMATH Keywords: algorithms
zbMATH Keywords: \(m\)-bit invertible \(S\)-boxes
zbMATH Keywords: bit-by-bit method
MaRDI profile type: Publication
cites work: The structured design of cryptographically good s-boxes
cites work: On the Application of the Borel-Cantelli Lemma
cites work: Q3707915
cites work: An Expanded Set of S-box Design Criteria Based on Information Theory and its Relation to Differential-Like Attacks
cites work: Q5538132
cites work: Methods and instruments for designing S-boxes
cites work: Q3202955
cites work: Q4198056
cites work: Q4040797
cites work: Q3869197
cites work: Q3773321
cites work: Structured Design of Substitution-Permutation Encryption Networks
cites work: Q3779735
cites work: Q3705340
cites work: Q3710461
cites work: Analytic Inequalities
cites work: Perfect nonlinear S-boxes
cites work: Q4036868
cites work: On ``bent'' functions
cites work: Analysis and design of stream ciphers
cites work: Communication Theory of Secrecy Systems*
cites work: Correlation-immunity of nonlinear combining functions for cryptographic applications (Corresp.)
description: scientific article; zbMATH DE number 644808