© Amrita Vishwa Vidyapeetham Amritapuri | Bengaluru | Chennai | Coimbatore | Kochi | Mysuru
Boolean functions are used in modern cryptosystems for providing confusion and diffusion. To achieve required security by resistance to various attacks such as
algebraic attacks, correlation attacks, linear, differential attacks, several criteria for Boolean functions have been established over years by cryptographic community. These criteria include non linearity, avalanche criterion and correlation immunity and the like. The chapter is an attempt to present state of the art on properties of such Boolean functions and to suggest several directions for further research.
Dr. Srinivasan C., K.V., L., and Dr. M. Sethumadhavan, “Complexity Measures of Cryptographically Secure Boolean Functions”, in Cyber Security, Cyber Crime and Cyber Forensics: Applications and Perspectives, IGI Global, 2010.