Advertisement

Inclusion Relations of Boolean Functions Satisfying PC(l) of Order k

  • Tetsu Iwata
  • Kaoru Kurosawa
Conference paper
Part of the Discrete Mathematics and Theoretical Computer Science book series (DISCMATH)

Abstract

PC(l) of order k is an important cryptographic criterion of Boolean functions. Denote by PC n,(l, k ) the set of Boolean functions satisfying PC(l) of order k with n input bits. Recently, Carlet and Hirose proved that PC n,(l 1, k 1) = PC n,(l 2, k 2) for some class of l 1, k1, l2 and k 2. In this paper, we prove that PC n(l 1,k 1PC n(l 2, k 2) for a large class of l 1, k 1, l 2 and k 2. Our result can be considered as a complement of their results.

Keywords

Boolean Function Linear Code Block Cipher Binary Matrix Inclusion Relation 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    C. Carlet. On the propagation criterion of degree 1 and order k. In Advances in Cryptology — EUROCRYPT ‘88 Proceedings, Lecture Notes in Computer Science 1403, pages 462–474. Springer-Verlag, 1998.Google Scholar
  2. 2.
    J.F. Dillon. Elementary Hadamard difference sets. Ph. D. Thesis. Univ. of Maryland. 1974.Google Scholar
  3. 3.
    R. Forré. The strict avalanche criterion: spectral properties of Boolean functions and an extend definition. In Advances in Cryptology — CRYPTO ‘88 Proceedings, Lecture Notes in Computer Science 403, pages 450–468. Springer-Verlag, 1990.Google Scholar
  4. 4.
    S. Hirose. Boolean functions related to cryptography and their complexity. Doctoral dissertation. Kyoto Univ. Japan. February 1995.Google Scholar
  5. 5.
    K. Kurosawa and T. Satoh. Design of SAC/PC(1) of order k Boolean functions and three other cryptographic criteria. In Advances in Cryptology — EUROCRYPT ‘87 Proceedings, Lecture Notes in Computer Science 1233, pages 434–449. Springer-Verlag, 1997.Google Scholar
  6. 6.
    W. Meier and O. Staffelbach. Nonlinearity criteria for cryptographic functions. In Advances in Cryptology — EUROCRYPT ‘89 Proceedings, Lecture Notes in Computer Science 434, pages 549–562. Springer-Verlag, 1990.Google Scholar
  7. 7.
    B. Preneel, W. van Leekwijck, L. van Linden, R. Govaerts, and J. Vandewalle. Propagation characteristics of Boolean functions. In Advances in Cryptology — EUROCRYPT ‘80 Proceedings, Lecture Notes in Computer Science 473, pages 161–173. Springer-Verlag, 1991.Google Scholar
  8. 8.
    J. Seberry, X. Zhang and Y. Zheng. Nonlinearity and propagation characteristics of Boolean functions. In Information and Computation, vol. 119, No. 1, pages 1–13, 1995.MathSciNetMATHCrossRefGoogle Scholar
  9. 9.
    A.F. Webster and S.E. Tavares. On the design of S-boxes. In Advances in Cryptology — CRYPTO ‘85 Proceedings, Lecture Notes in Computer Science 218, pages 523–534. Springer-Verlag, 1986.Google Scholar

Copyright information

© Springer-Verlag London 1999

Authors and Affiliations

  • Tetsu Iwata
    • 1
  • Kaoru Kurosawa
    • 1
  1. 1.Department of Electrical and Electronic Engineering Faculty of EngineeringTokyo Institute of TechnologyMeguro-ku, TokyoJapan

Personalised recommendations