Boolean Functions Satisfying Higher Order Propagation Criteria

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 547)


Boolean functions that satisfy higher order propagation criteria are studied. A complete characterization is given of the autocorrelation function and Walsh spectrum of second order functions. The number of second order functions satisfying PC(k) is related to a problem in coding theory and can be computed explicitly for k = 1, n − 1 and n. A new interpretation of the number of balanced second order functions is given and a class of functions showing interesting properties is discussed.


Autocorrelation Function Boolean Function Order Function Bend Function Balance Function 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. [For88]
    R. Forré, “The strict avalanche criterion: spectral properties of Boolean functions and an extended definition”, Advances in Cryptology, Proc. Crypto 88, Springer Verlag, 1990, p. 450–468.Google Scholar
  2. [HeSt73]
    H.J. Helgert and R.D. Stinaff, “Minimum-Distance bounds for binary linear codes”, IEEE Trans. Inform. Theory, Vol. IT-19, p. 344–356, May 1973.CrossRefMathSciNetGoogle Scholar
  3. [MWS77]
    F.J. MacWilliams and N.J.A. Sloane, “The theory of error-correcting codes”, North-Holland Publishing Company, Amsterdam, 1977.zbMATHGoogle Scholar
  4. [MS89]
    W. Meier and O. Staffelbach, “Nonlinearity criteria for cryptographic functions”, Advances in Cryptology, Proc. Eurocrypt 89, Springer Verlag, 1990, pp. 549–562.Google Scholar
  5. [PVV90]
    B. Preneel, W. Van Leekwijck, L. Van Linden, R. Govaerts and J. Vandewalle, “Propagation Characteristics of Boolean Functions”, Advances in Cryptology, Proc. Eurocrypt 90, Lecture Notes in Computer Science 473, Springer Verlag, 1991, pp. 161–173.Google Scholar
  6. [Ruep90]
    R.A. Rueppel, “Stream Ciphers”, in Contemporary Cryptology: The Science of Information Integrity, G. Simmons, ed., IEEE Press, to appear.Google Scholar
  7. [Sie84]
    T. Siegenthaler, “Correlation immunity of non-linear combining functions for cryptographic applications”, IEEE Trans. Inform. Theory, Vol. IT-30, p. 776–780, Oct. 1984.CrossRefMathSciNetGoogle Scholar
  8. [VV90]
    W. Van Leekwijck and L. Van Linden, “Cryptographic properties of Boolean functions — in Dutch, Cryptografische eigenschappen van Booleaanse functies”, ESAT Katholieke Universiteit Leuven, Thesis grad. eng., 1990.Google Scholar
  9. [XM88]
    G.-Z. Xiao and J.L. Massey, “A spectral characterization of correlation-immune combining functions”, IEEE Trans. Inform. Theory, Vol. IT-34, p. 569–571, May 1988.CrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  1. 1.Laboratorium ESATKatholieke Universiteit LeuvenHeverleeBelgium

Personalised recommendations