Concrete mathematics: a foundation for computer science
Concrete mathematics: a foundation for computer science
LOKI—a cryptographic primitive for authentication and secrecy applications
AUSCRYPT '90 Proceedings of the international conference on cryptology on Advances in cryptology
A proposal for a new block encryption standard
EUROCRYPT '90 Proceedings of the 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
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Fast Software Encryption Functions
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference 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
An analysis of product ciphers based on the properties of boolean functions
An analysis of product ciphers based on the properties of boolean functions
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
The design of composite permutations with applications to DES-like S-boxes
Designs, Codes and Cryptography
| Hi-index | 0.00 |
Differential cryptanalysis is a method of attacking iterated mappings which has been applied with varying success to a number of product ciphers and hash functions [1, 2], Let 驴 : Z2c x Z2m 驴 Z2mbe a mapping that consists of c 'control' bits and m 'data' bits. The mapping 驴 mapping contains 2c m-bit permutations 驴 i, : Z2m 驴 Z2m, 0 驴 i 驴 2c - 1, one of which is selected (multiplexed) by the control bits, and a substitution is then performed on the data bits using the selected permutation. Such mappings will be called composite permutations. The S-boxes of DES are composite permutations of the form Si : Z22 x Z24 驴 Z24 with 2 control bits and 4 data bits.In differential cryptanalysis the attacker is interested in the largest entry in a given XOR table, and the fraction of the XOR table that is zero. In this paper we determine the distribution of characteristics in the XOR tables of composite permutations, which leads to approximations for the largest entry in the XOR table and the density of zero entries.