Abstract
It is argued that a boolean function f: Z n2 → Z m2 is resistant to statistical analysis if there is no significant static and dynamic leakage between its inputs and outputs. In this paper, we derive expressions for the expected value of the information leakage of randomly selected boolean functions and for the interesting cases of randomly selected balanced, and randomly selected injective boolean functions. It is shown that the expected value of different forms of information leakage decreases dramatically with the number of input variables n. For example, for a single output boolean function, we show that the expected value of different forms of leakage goes down exponentially with n.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
C.M. Adams. A Formal and Practical Design Procedure for Substitution-Permutation Network Cryptosystems. PhD thesis, Queen's University, Kingston, Ontario, Canada, September, 1990.
E. Biham and A. Shamir. Differential cryptanalysis of DES-like cryptosystems. Journal of Cryptology, vol. 4, no. 1, pp. 3–72, 1991.
L. Brynielsson. The information leakage through a randomly generated function. Advances in Cryptology: Proc. of EUROCRYPT '91, Springer-Verlag, Berlin, pp. 552–553, 1991.
B. Chor, O. Goldreich, J. Hastad, J. Friedman, S. Rudich, and R. Smolensky. The bit extraction problem or t-resilient functions. Proc. 26th IEEE Symposium on Foundation of Computer Science, pp. 396–407, 1985.
T.M. Cover and J.A. Thomas. Elements of Information Theory. John Wiely & Sons Inc, 1991.
M.H. Dawson and S.E. Tavares. An expanded set of S-box design criteria based on information theory and its relation to differential attacks. Advances in Cryptology: Proc. of EUROCRYPT '91, Springer-Verlag, pp. 352–365, 1992.
R. Forré. The strict avalanche criterion: Spectral properties of boolean functions and an extended definition. Advances in Cryptology: Proc. of CRYPTO '88, Springer-Verlag, pp. 450–468, 1989.
R. Forré. Methods and instruments for designing S-boxes. Journal of Cryptology, Vol. 2, No.3 pp. 115–130, 1990.
J. Gordon and H. Retkin. Are big S-boxes best ? Lecture Notes in Computer Science: Proc. of the Workshop on Cryptography, Springer-Verlag, Berlin, pp. 257–262, 1982.
J.B. Kam and G.I. Davida. Structured design of substitution-permutation encryption networks. IEEE Trans. Comp. C-28, pp.747–753, 1979.
M. Matsui. Linear cryptanalysis method for DES cipher. Advances in Cryptology: Proc. of EUROCRYPT '93, Springer-Verlag, Berlin, pp. 386–397, 1994.
W. Meier and O. Staffelbach. Nonlinearity criteria for cryptographic functions. Advances in Cryptology: Proc. of EUROCRYPT 89, Springer-Verlag, pp. 549–562, 1990.
K. Nyberg. Perfect nonlinear S-boxes. Advances in Cryptology: Proc. of EURO-CRYPT '91, Springer-Verlag, pp. 378–386, 1992.
B. Preneel, W.V. Leekwijk, L.V. Linden, R.Govaerts, and J. Vandewalle. Propagation charachteristic of boolean functions. Advances in Cryptology: Proc. of EUROCRYPT '90, Springer-Verlag, pp. 161–173, 1991.
F.S. Roberts. Applied Combinatorics. Englewood Cliffs, N.J.: Prentice-Hall, 1984.
O.S Rothaus. On bent functions. Journal of Combinatorial Theory, Vol. 20(A):300–305, 1976.
T. Siegenthaler. Decrypting a class of stream ciphers using ciphertext only. IEEE Trans. Comput., Vol.C-34, No. 1, pp. 81:85, 1985.
T. Siegenthaler. Correlation-immunity of nonlinear combining functions forcryptographic applications. IEEE Trans. on Inform. Theory, Vol.IT-30, No.5, pp. 776:780, Sept. 1984.
M. Sivabalan, S.E. Tavares, and L.E. Peppard. On the design of SP networks from an information theoretic point of view. Advances in Cryptology: Proc. of CRYPTO '92, Springer-Verlag, Berlin, pp. 260–279, 1993.
A.F. Webster. Plaintext / ciphertext bit dependencies in cryptographic systems. Master's thesis, Queen's University, Kingston, Ontario, Canada, December, 1985.
A.F. Webster and S.E. Tavares. On the design of S-boxes. Advances in Cryptology: Proc. of CRYPTO '85, Springer-Verlag, pp. 523–534, 1986.
A.M. Youssef and S.E. Tavares. Spectral properties and information leakage of multi-output boolean functions. In Proceedings of the IEEE International Symposium On Information Theory. Whistler, B.C., Canada, Sep. 17–22, 1995.
A.M. Youssef, S.E. Tavares, S. Mister, and C.M. Adams. Linear approximation of injective s-boxes. IEE Electronics Letters, Vol. 31, No. 25, pp. 2168–2169, 1995.
M. Zhang, S.E. Tavares, and L.L. Campbell. Information leakage of boolean functions and its relationship to other cryptographic criteria. Proceedings of 2nd ACM Conference on Computer and Communications Security, Fairfax, Virgina, pp. 156–165., 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Youssef, A.M., Tavares, S.E. (1996). Information leakage of a randomly selected boolean function. In: Chouinard, JY., Fortier, P., Gulliver, T.A. (eds) Information Theory and Applications II. CWIT 1995. Lecture Notes in Computer Science, vol 1133. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0025134
Download citation
DOI: https://doi.org/10.1007/BFb0025134
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61748-8
Online ISBN: 978-3-540-70647-2
eBook Packages: Springer Book Archive