The design of substitution-permutation networks resistant to differential and linear cryptanalysis

Authors:
H. M. Heys;S. E. Tavares
Affiliations:
Electrical Engineering, Memorial University of Newfoundland, St. John's, Newfoundland, Canada;Department of Electrical and Computer Engineering, Queen's University, Kingston, Ontario, Canada
Venue:
CCS '94 Proceedings of the 2nd ACM Conference on Computer and communications security
Year:
1994

Citing 8
Cited 0

Structure in the S-boxes of the DES

Proceedings on Advances in cryptology---CRYPTO '86
Differentially uniform mappings for cryptography

EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
On the distribution of characteristics in bijective mappings

EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Linear cryptanalysis method for DES cipher

EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Differential Cryptanalysis of Snefru, Khafre, REDOC-II, LOKI and Lucifer

CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Differential Cryptanalysis of the Full 16-Round DES

CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
An analysis of product ciphers based on the properties of boolean functions

An analysis of product ciphers based on the properties of boolean functions
Differential cryptanalysis of feal and N-hash

EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we examine a class of product ciphers referred to as substitution-permutation networks. We investigate the resistance of these cryptographic networks to two important attacks: differential cryptanalysis and linear cryptanalysis. In particular, we develop upper bounds on the differential characteristic probability and on the probability of a linear approximation as a function of the number of rounds of substitutions. Further, it is shown that using large S-boxes with good diffusion characteristics and replacing the permutation between rounds by an appropriate linear transformation is effective in improving the cipher security in relation to these two attacks.