ProgramsView all programs
From the news
- Chancellor Amma Addresses the Parliament of World’s Religions
- Amrita Students Qualify for the European Mars Rover Challenge
Publication Type : Book Chapter
Thematic Areas : TIFAC-CORE in Cyber Security
Publisher : Cyber Security, Cyber Crime and Cyber Forensics: Applications and Perspectives
Source : Cyber Security, Cyber Crime and Cyber Forensics: Applications and Perspectives, IGI Global (2010)
Campus : Coimbatore
School : School of Engineering, Centre for Cybersecurity Systems and Networks
Center : TIFAC CORE in Cyber Security
Department : Computer Science, Mathematics, cyber Security
Year : 2010
Abstract : 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.
Cite this Research Publication : 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.