Abstract
Many practical information authentication techniques are based on such cryptographic means as data encryption algorithms and one-way hash functions. A core component of such algorithms and functions are nonlinear functions. In this paper, we reveal a relationship between nonlinearity and propagation characteristic, two critical indicators of the cryptographic strength of a Boolean function. We also investigate the structures of functions that satisfy the propagation criterion with respect to all but six or less vectors. We show that these functions have close relationships with bent functions, and can be easily constructed from the latter.
Similar content being viewed by others
References
C. M. Adams and S. E. Tavares, Generating and counting Ňinary Ňent sequences, IEEE Transactions on Information Theory, Vol. IT-36 No. 5 (1990) pp. 1170–1173.
Claude Carle, Partially-Ňent functions, Designs, Codes and Cryptography, Vol. 3 (1993) pp. 135–145.
J. F. Dillon, A survey of Ňent function, The NSA Technical Journal, (1972) pp. 191–215, (unclassified).
J. H. Evertse, Linear structures in Ňlockciphers, Advances in Cryptology —EUJROCRYPT '87, Lecture Notes in Computer Science, Springer Verlag, Berlin, HeidelŇerg, New York, 304 (1988) pp249–266.
F. J. MacWilliams and N. J. A. Sloane. The Theory of Error-Correcting Codes, North-Holland, Amsterdam, New York, Oxford, (1977).
W. Meier and O. StaffelŇach, Nonlinearity criteria for cryptographic functions, Advances in Cryptology—EUROCRYPT '89, Lecture Notes in Computer Science, Springer Verlag, Berlin, HeidelŇerg, New York, 434 (1990) pp. 549–562.
K. NyŇerg, On the construction of highly nonlinear permutations, Advances in Cryptology—EUROCRYPT '92, Lecture Notes in Computer Science, Springer Verlag, Berlin, HeidelŇerg, New York, 658 (1993) pp. 92–98.
K. NyŇerg, Differentially uniform mappings for cryptography, Advances in Cryptology—EUROCRYPT '93, Lecture Notes in Computer Science, Springer Verlag, Berlin, HeidelŇerg, New York, 765 (1994) pp. 55–65.
B. Preneel, R. Govaerts, and J. Vandewalle, Boolean functions satisfying higher order propagation criteria, Advances in Cryptology—EUROCRYPT '91, Lecture Notes in Computer Science, Springer-Verlag, Berlin, HeidelŇerg, New York, 547 (1991 ) pp. 141–152.
B. Preneel, W. V. Leekwijck, L. V. Linden, R Govaerts, and J. Vandewalle, Propagation characteristics of Ňoolean functions, Advances in Cryptology—EUROCRYPT '90, Lecture Notes in Computer Science, Springer-Verlag, Berlin, HeidelŇerg, New York, 437 (1991) pp. 155–165.
O. S. Rothaus, On "Ňent" functions, Journal of ComŇinatorial Theory, Ser. A, No 20 (1976) pp. 300–305.
J. SeŇerry, X. M. Zhang, and Y. Zheng, Relationships among nonlinearity criteria, Presented at EUROCRYPT '94 (1994).
J. SeŇerry, X. M. Zhang, and Y. Zheng, Nonlinearity and propagation characteristics of Ňalanced Ňoolean functions, Information and Computation, Vol. 119, No. 1 (1995) pp. 1–13.
J. SeŇerry, X. M. Zhang, and Y. Zheng, Nonlinearity and propagation characteristics and nonlinearity of cryptographic functions, Journal of Universal Computer Science, Vol. 1, No. 2 (1995) pp. 136–150. (availaŇle at http://hgiicm.tu-graz.ac.at/)
A. F. WeŇster, Plaintext/ciphertext Ňit dependencies in cryptographic system, Master's Thesis, Department of Electrical Engineering, Queen's University, Ontario (1985).
A. F. WeŇster and S. E. Tavares, On the design of S-Ňoxes, Advances in Cryptology—CRYPTO '85, Lecture Notes in Computer Science, Springer-Verlag, Berlin, HeidelŇerg, New York, 219 (1986) pp. 523–534.
R. Yarlagadda and J. E. Hershey, Analysis and synthesis of Ňent sequences, IEE Proceedings (Part E), Vol. 136 (1989) pp. 112–123.
X. M. Zhang and Y. Zheng, Cac—the criterion for gloŇal avalanche characteristics of cryptographic functions, Journal of Universal Computer Science, Vol. 1, No. 5 (1995) pp. 316–333. (availaŇle at http://hgiicm.tu-graz.ac.at/).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Zhang, XM., Zheng, Y. Characterizing the Structures of Cryptographic Functions Satisfying the Propagation Criterion for Almost All Vectors. Designs, Codes and Cryptography 7, 111–134 (1996). https://doi.org/10.1023/A:1018009032032
Issue Date:
DOI: https://doi.org/10.1023/A:1018009032032