Abstract
A Boolean function f satisfies PC(l) of order k if f(x) ⊕ f(x ⊕ α) is balanced for any α such that 1 ≤ W(α) ≤ l even if any k input bits are kept constant, where W(α) denotes the Hamming weight of α. This paper shows the first design method of such functions which provides deg(f) ≥ 3. More than that, we show how to design “balanced” such functions. High nonlinearity and large degree are also obtained. Further, we present balanced SAC(k) functions which achieve the maximum degree. Finally, we extend our technique to vector output Boolean functions.
This author was supported by the Telecommunications Advancement Foundation, Japan.
Chapter PDF
Similar content being viewed by others
References
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.
T. Jakobsen and L.R. Knudsen. The interpolation attack on block ciphers. In Preproc. of Fast Software Encryption, pages 28–40. January, 1997.
K. Kurosawa and T. Satoh. Generalization of higher order SAC to vector output Boolean functions. In Advances in Cryptology — ASIACRYPT’ 96 Proceedings, Lecture Notes in Computer Science 1163, pages 218–231. Springer-Verlag, 1996.
S. Lidl and Niederreiter. Finite Fields, Encyclopedia of Mathematics and Its Applications 20. Cambridge University Press, 1983.
S. Lloyd. Counting binary functions with certain cryptographic properties. Journal of Cryptology, 5:107–131, 1992.
F. J. MacWilliams and N. J. A. Sloane. The theory of error-correcting codes. North-Holland Publishing Company, 1977.
M. Matsui. Linear cryptanalysis method for DES cipher. In Advances in Cryptology — EUROCRYPT’ 93 Proceedings, Lecture Notes in Computer Science 765, pages 386–397. Springer-Verlag, 1994.
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.
K. Nyberg. Perfect nonlinear S-boxes. In Advances in Cryptology — EUROCRYPT’ 91 Proceedings, Lecture Notes in Computer Science 547, pages 378–386. Springer-Verlag, 1991.
J. Pieprzyk and G. Finkelstein. Towards effective nonlinear cryptosystem design. IEE Proceedings Part E, 35(6):325–335, November 1988.
B. Preneel, W. Van Leekwijck, L. Van Linden, R. Govaerts, and J. Vandewalle. Propagation characteristics of Boolean functions. In Advances in Cryptology — EUROCRYPT’ 90 Proceedings, Lecture Notes in Computer Science 473, pages 161–173. Springer-Verlag, 1991.
B. Preneel, R. Govaerts, and J. Vandewalle. Boolean functions satisfying higher order propagation criteria. In Advances in Cryptology — EUROCRYPT’ 91 Proceedings, Lecture Notes in Computer Science 547, pages 141–152. Springer-Verlag, 1991.
O. S. Rothaus. On bent functions. Journal of Combinatorial Theory (A), 20:300–305, 1976.
J. Seberry and X.M. Zhang. Highly nonlinear 0–1 balanced Boolean functions satisfying strict avalanche criterion. In Advances in Cryptology — AUSCRYPT’ 92 Proceedings, Lecture Notes in Computer Science 718. Springer-Verlag, 1993.
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.
A. M. Youssef, T. W. Cusick, P. StĂnicĂ, and S. E. Tavares. New bounds on the number of functions satisfying the strict avalanche criterion. In Third Annual Workshop on Selected Areas in Cryptography, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kurosawa, K., Satoh, T. (1997). Design of SAC/PC(l) of Order k Boolean Functions and Three Other Cryptographic Criteria. In: Fumy, W. (eds) Advances in Cryptology — EUROCRYPT ’97. EUROCRYPT 1997. Lecture Notes in Computer Science, vol 1233. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-69053-0_30
Download citation
DOI: https://doi.org/10.1007/3-540-69053-0_30
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62975-7
Online ISBN: 978-3-540-69053-5
eBook Packages: Springer Book Archive