research-article

Avalanche Characteristics of Substitution-Permutation Encryption Networks

Authors:

Stafford E. Tavares,

Howard M. HeysAuthors Info & Claims

IEEE Transactions on Computers, Volume 44, Issue 9

Pages 1131 - 1139

https://doi.org/10.1109/12.464391

Published: 01 September 1995 Publication History

Abstract

This paper develops analytical models for the avalanche characteristics of a class of block ciphers usually referred to as substitution-permutation encryption networks or SPNs. An SPN is considered to display good avalanche characteristics if a one bit change in the plaintext input is expected to result in close to half the ciphertext output bits changing. Good avalanche characteristics are important to ensure that a cipher is not susceptible to statistical attacks and the strength of an SPN s avalanche characteristics may be considered as a measure of the randomness of the ciphertext. The results presented in this paper demonstrate that the avalanche behavior of encryption networks can be improved by using larger S-boxes. As well, it is shown that increasing the diffusion properties of the S-boxes or replacing the permutations by diffusive linear transformations is effective in improving the network avalanche characteristics.

References

[1]

National Bureau of Standards, “Data encryption standard (DES),” Federal Information Processing Standard Publication 46, 1977.

[2]

W. Diffie and M. Hellman, “Exhaustive cryptanalysis of the NBS data encryption standard,” Computer, vol. 10, pp. 74-84, 1977.

Digital Library

[3]

M.J. Wiener, “Efficient DES key search,” technical report, School of Computer Science, Carleton Univ., Ottawa, Canada, May 1994. Presented at the Rump Session of CRYPTO ’93.

[4]

W. Diffie and M.E. Hellman, “Privacy and authentication: An introduction to cryptography,” Proc. IEEE, vol. 67, no. 3, pp. 397-427, 1979.

[5]

H.M. Heys and S.E. Tavares, “Key clustering in substitution-permutation network cryptosystems,” Workshop Selected Areas in Cryptography (SAC ’94), Queen’s Univ., Kingston, Canada, May 1994.

[6]

H. Feistel, “Cryptography and computer privacy,” Scientific American, vol. 228, no. 5, pp. 15-23, 1973.

[7]

C.E. Shannon, “Communication theory of secrecy systems,” Bell System Technical J., vol. 28, pp. 656-715, 1949.

[8]

J.B. Kam and G.I. Davida, “A structured design of substitution-permutation encryption networks,” IEEE Trans. Computers, vol. 28, no. 10, pp. 747-753, 1979.

Digital Library

[9]

H.M. Heys and S.E. Tavares, “Substitution-permutation networks resistant to differential and linearcryptanalysis,” accepted for publication J. Cryptology, vol. 8, no. 4, 1995 (to appear).

[10]

E. Biham and A. Shamir, “Differential cryptanalysis of DES-like cryptosystems,” J. Cryptology, vol. 4, no. 1, pp. 3-72, 1991.

Digital Library

[11]

M. Matsui, “Linear cryptanalysis method for DES cipher,” Advances in Cryptology: Proc. EUROCRYPT ’93, pp. 386-397, Berlin, Springer-Verlag, 1994.

Digital Library

[12]

A. Shimizu and S. Miyaguchi, “Fast data encipherment algorithm: FEAL,” Advances in Cryptology: Proc. EUROCRYPT ’87, pp. 267-278, Berlin, Springer-Verlag, 1988.

[13]

L. Brown, J. Pieprzyk, and J. Seberry, “LOKI—A cryptographic primitive for authentication and secrecyapplications,” Advances in Cryptology: Proc. AUSCRYPT ’90, pp. 229-236, Berlin, Springer-Verlag, 1990.

Digital Library

[14]

L. Brown, M. Kwan, J. Pieprzyk, and J. Seberry, “Improving resistance to differential cryptanalysis and the redesign ofLOKI,” Advances in Cryptology: Proc. ASIACRYPT ’91, pp. 36-50, Berlin, Springer-Verlag, 1993.

Digital Library

[15]

X. Lai and J. Massey, “A proposal for a new block encryption standard,” Advances in Cryptology: Proc. EUROCRYPT ’90, pp. 389-404, Berlin, Springer-Verlag, 1991.

Digital Library

[16]

X. Lai, J. Massey, and S. Murphy, “Markov ciphers and differential cryptanalysis,” Advances in Cryptology: Proc. EUROCRYPT ’91, pp. 17-38, Berlin, Springer-Verlag, 1991.

[17]

H. Feistel, W.A. Notz, and J.L. Smith, “Some cryptographic techniques for machine-to-machine datacommunications,” Proc. IEEE, vol. 63, no. 11, pp. 1,545-1,554, 1975.

[18]

A.F. Webster and S.E. Tavares, “On the design of S-boxes,” Advances in Cryptology: Proc. CRYPTO ’85, pp. 523-534, Berlin, Springer-Verlag, 1986.

Digital Library

[19]

R. Forré, “The strict avalanche criterion: Spectral properties of Boolean functionsand an extended definition,” Advances in Cryptology: Proc. CRYPTO ’88, pp. 450-468, Berlin, Springer-Verlag, 1990.

Digital Library

[20]

C.M. Adams and S.E. Tavares, “The structured design of cryptographically good S-boxes,” J. Cryptology, vol. 3, no. 1, pp. 27-41, 1990.

Digital Library

[21]

S. Lloyd, “Counting functions satisfying a higher order strict avalanchecriterion,” Advances in Cryptology: Proc. EUROCRYPT ’89, pp. 63-74, Berlin, Springer-Verlag, 1990.

Digital Library

[22]

B. Preneel, W. Van Leekwijck, L. Van Linden, R. Govaerts, and J. Vandewalle, “Propagation characteristics of Boolean functions,” Advances in Cryptology: Proc. EUROCRYPT ’90, pp. 161-173, Berlin, Springer-Verlag, 1991.

Digital Library

[23]

K. Kim, T. Matsumoto, and H. Imai, “A recursive construction method of S-boxes satisfying strict avalancecriterion,” Advances in Cryptology: Proc. CRYPTO ’90, pp. 545-553, Berlin, Springer-Verlag, 1991.

Digital Library

[24]

E. Biham and A. Shamir, “Differential cryptanalysis of the full 16-round DES,” Advances in Cryptology: Proc. CRYPTO ’92, pp. 487-496, Berlin, Springer-Verlag, 1993.

Digital Library

[25]

W. Feller, An Introduction to Probability Theory and Its Applications. New York: John Wiley & Sons, Third edition, 1968.

[26]

F.S. Roberts, Applied Combinatorics. Englewood Cliffs, N.J.: Prentice Hall, 1984.

Digital Library

[27]

F. Ayoub, “The design of complete encryption networks using cryptographicallyequivalent permutations,” Computers and Security, vol. 2, pp. 261-267, 1982.

Digital Library

[28]

E.F. Brickell, J.H. Moore, and M.R. Purtill, “Structures in the S-boxes of DES,” Advances in Cryptology: Proc. CRYPTO ’86, pp. 3-8, Berlin, Springer-Verlag, 1987.

Digital Library

[29]

W. Meier and O. Staffelbach, “Nonlinearity criteria for cryptographic functions,” Advances in Cryptology: Proc. EUROCRYPT ’89, pp. 549-562, Berlin, Springer-Verlag, 1990.

Digital Library

Cited By

Asif MAsamoah JHazzazi MAlharbi AAshraf MAlghamdi A(2022)A Novel Image Encryption Technique Based on Cyclic Codes over Galois FieldComputational Intelligence and Neuroscience10.1155/2022/19126032022Online publication date: 1-Jan-2022
https://dl.acm.org/doi/10.1155/2022/1912603
Aljawarneh SYassein MTalafha W(2018)A multithreaded programming approach for multimedia big dataMultimedia Tools and Applications10.1007/s11042-017-4873-977:9(10997-11016)Online publication date: 1-May-2018
https://dl.acm.org/doi/10.1007/s11042-017-4873-9
Aljawarneh SYassein MTalafha W(2017)A resource-efficient encryption algorithm for multimedia big dataMultimedia Tools and Applications10.1007/s11042-016-4333-y76:21(22703-22724)Online publication date: 1-Nov-2017
https://dl.acm.org/doi/10.1007/s11042-016-4333-y
Show More Cited By

Avalanche Characteristics of Substitution-Permutation Encryption Networks

Recommendations

Key-Dependent S-Boxes and Differential Cryptanalysis

Key-dependent S-boxes gained some prominence in block cipher design when Twofish became an AES finalist. In this paper we make some observations on how the cryptanalyst might work with key-dependent S-boxes, we begin to develop a framework for the ...
Known‐key distinguishers on 15‐round 4‐branch type‐2 generalised Feistel networks with single substitution–permutation functions and near‐collision attacks on its hashing modes

Generalised Feistel network (GFN) is a popular design for block ciphers and hash functions. The round function of the network often chooses a substitution–permutation (SP) transformation (consists of a subkey XOR, an S‐boxes layer and a linear layer). In ...
A unified method for finding impossible differentials of block cipher structures

In this paper, we propose a systematic method for finding impossible differentials for block cipher structures, which we call the unified impossible differential finding method or UID-method. It is more effective than the U-method introduced by Kim et ...

Comments

Information & Contributors

Information

Published In

cover image IEEE Transactions on Computers

IEEE Transactions on Computers Volume 44, Issue 9

September 1995

99 pages

ISSN:0018-9340

Issue’s Table of Contents

Copyright © Copyright © 1995 IEEE. All Rights Reserved.

Publisher

IEEE Computer Society

United States

Publication History

Published: 01 September 1995

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

8
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 15 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Asif MAsamoah JHazzazi MAlharbi AAshraf MAlghamdi A(2022)A Novel Image Encryption Technique Based on Cyclic Codes over Galois FieldComputational Intelligence and Neuroscience10.1155/2022/19126032022Online publication date: 1-Jan-2022
https://dl.acm.org/doi/10.1155/2022/1912603
Aljawarneh SYassein MTalafha W(2018)A multithreaded programming approach for multimedia big dataMultimedia Tools and Applications10.1007/s11042-017-4873-977:9(10997-11016)Online publication date: 1-May-2018
https://dl.acm.org/doi/10.1007/s11042-017-4873-9
Aljawarneh SYassein MTalafha W(2017)A resource-efficient encryption algorithm for multimedia big dataMultimedia Tools and Applications10.1007/s11042-016-4333-y76:21(22703-22724)Online publication date: 1-Nov-2017
https://dl.acm.org/doi/10.1007/s11042-016-4333-y
Rajendran JSam MSinanoglu OKarri RSadeghi AGligor VYung M(2013)Security analysis of integrated circuit camouflagingProceedings of the 2013 ACM SIGSAC conference on Computer & communications security10.1145/2508859.2516656(709-720)Online publication date: 4-Nov-2013
https://dl.acm.org/doi/10.1145/2508859.2516656
Arroyo DDiaz JRodriguez F(2013)Cryptanalysis of a one round chaos-based Substitution Permutation NetworkSignal Processing10.1016/j.sigpro.2012.11.01993:5(1358-1364)Online publication date: 1-May-2013
https://dl.acm.org/doi/10.1016/j.sigpro.2012.11.019
Behnia SAkhavan AAkhshani ASamsudin A(2013)Image encryption based on the Jacobian elliptic mapsJournal of Systems and Software10.1016/j.jss.2013.04.08886:9(2429-2438)Online publication date: 1-Sep-2013
https://dl.acm.org/doi/10.1016/j.jss.2013.04.088
Rajendran JPino YSinanoglu OKarri RRosenstiel WMacii E(2012)Logic encryptionProceedings of the Conference on Design, Automation and Test in Europe10.5555/2492708.2492947(953-958)Online publication date: 12-Mar-2012
https://dl.acm.org/doi/10.5555/2492708.2492947
Zivic NFrattasi SMarchetti N(2011)Trust in corrected messages protected by message authentication codesProceedings of the 4th International Symposium on Applied Sciences in Biomedical and Communication Technologies10.1145/2093698.2093764(1-4)Online publication date: 26-Oct-2011
https://dl.acm.org/doi/10.1145/2093698.2093764

View Options

View options

Media

Figures

Other

Tables

View Issue’s Table of Contents