On the Design of SP Networks From an Information Theoretic Point of View

Authors:
M. Sivabalan;Stafford E. Tavares;Lloyd E. Peppard
Affiliations:
-;-;-
Venue:
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Year:
1992

Citing 10
Cited 2

On the design of S-boxes

Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Structure in the S-boxes of the DES

Proceedings on Advances in cryptology---CRYPTO '86
Methods and instruments for designing S-Boxes

Journal of Cryptology
LOKI—a cryptographic primitive for authentication and secrecy applications

AUSCRYPT '90 Proceedings of the international conference on cryptology on Advances in cryptology
The structured design of cryptographically good s-boxes

Journal of Cryptology
On immunity against Biham and Shamir's “differential cryptanalysis”

Information Processing Letters
Structured Design of Substitution-Permutation Encryption Networks

IEEE Transactions on Computers
Markov ciphers and differential cryptanalysis

EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
An expanded set of S-box design criteria based on information theory and its relation to differential-like attacks

EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Fast data encipherment algorithm FEAL

EUROCRYPT'87 Proceedings of the 6th annual international conference on Theory and application of cryptographic techniques

Information leakage of boolean functions and its relationship to other cryptographic criteria

CCS '94 Proceedings of the 2nd ACM Conference on Computer and communications security
Constructing Symmetric Ciphers Using the CAST Design Procedure

Designs, Codes and Cryptography - Special issue: selected areas in cryptography I

Quantified Score

Hi-index	0.00

Visualization

Abstract

The cryptographic strength of an SP network depends crucially on the strength of its substitution boxes (S-boxes). In this paper we use the concept of information leakage to evaluate the strength of S-boxes and SP networks. We define an equivalence class on n脳n S-boxes that is invariant in information leakage. Simulation results for a 16脳16 SP network suggest that after a sufficient number of rounds the distribution of the output XOR in the SP network looks random. We further present simulation results to show that the information leakage for an SP network diminishes more rapidly with the number of rounds when the S-boxes are cryptographically strong.