Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Privacy amplification by public discussion
SIAM Journal on Computing - Special issue on cryptography
Fast correlation attacks on certain stream ciphers
Journal of Cryptology
The strict avalanche criterion: spectral properties of boolean functions and an extended definition
CRYPTO '88 Proceedings on Advances in cryptology
Methods and instruments for designing S-Boxes
Journal of Cryptology
Counting functions satisfying a higher order strict avalanche criterion
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Nonlinearity criteria for cryptographic functions
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Propagation characteristics of Boolean functions
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Elements of information theory
Elements of information theory
On immunity against Biham and Shamir's “differential cryptanalysis”
Information Processing Letters
Linear cryptanalysis method for DES cipher
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
On the Design of SP Networks From an Information Theoretic Point of View
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Policy transformations for preventing leakage of sensitive information in email systems
DBSEC'06 Proceedings of the 20th IFIP WG 11.3 working conference on Data and Applications Security
Hi-index | 0.00 |
This paper presents some results on the cryptographic strength of Boolean functions from the information theoretic point of view. It is argued that a Boolean function is resistant to statistical analysis if there is no significant static and dynamic information leakage between its inputs and its output(s). In particular we relate information leakage to nonlinearity, higher order SAC, correlation immunity and resilient functions. It is shown that reducing information leakage increases resistance to the differential attack and the linear attack. We note that some conventional cryptographic criteria require zero static or dynamic information leakage in only one domain. Such a requirement can result in a large information leakage in another domain. To avoid this weakness, it is better to jointly constrain all kinds of information leakage in the function. In fact, we claim that information leakage can be used as a fundamental measure of the strength of a cryptographic algorithm.