Title :
Decision trees of cryptographic Boolean functions
Author :
Youssef, A.M. ; Tavares, S.E.
Author_Institution :
Dept. of Elec. and Comm. Eng, Cairo University, Egypt
Abstract :
In this paper, we investigate the use of decision trees as a measure of the cryptographic strength of Boolean functions. In particular, we consider the univariate decision trees and the multivariate linear decision trees. Trees with bounded errors are also considered. We also introduce the concept of the entropy profile of Boolean functions. Experimental upper bounds are evaluated for several tree complexity measures of cryptographic Boolean functions of interest such as the coordinate functions of the DES and Rijndael (AES) s-boxes.
Keywords :
Boolean functions; computational complexity; cryptography; decision trees; entropy; AES; DES coordinate functions; Rijndael s-boxes; bounded error trees; cryptographic Boolean functions; cryptographic strength; entropy profile; multivariate linear decision trees; tree complexity measures; univariate decision trees; Boolean functions; Coordinate measuring machines; Cryptography; Data security; Decision trees; Entropy; Hardware; Linearity; Particle measurements; Upper bound;
Conference_Titel :
Electrical and Computer Engineering, 2004. Canadian Conference on
Print_ISBN :
0-7803-8253-6
DOI :
10.1109/CCECE.2004.1345040
