Complexity Measures of Cryptographically Secure Boolean Functions

View Sample PDF

Author(s): Chungath Srinivasan (Amrita Vishwa Vidyapeetham, India), K.V. Lakshmy (Amrita Vishwa Vidyapeetham, India)and M. Sethumadhavan (Amrita Vishwa Vidyapeetham, India)
Copyright: 2011
Pages: 11
Source title: Cyber Security, Cyber Crime and Cyber Forensics: Applications and Perspectives
Source Author(s)/Editor(s): Raghu Santanam (Arizona State University, USA), M. Sethumadhavan (Amrita University, India)and Mohit Virendra (Brocade Communications Systems, USA)
DOI: 10.4018/978-1-60960-123-2.ch015

Keywords: Digital Crime & Forensics / Information Science Reference / IT Security and Ethics / Security & Forensics

Purchase

View Complexity Measures of Cryptographically Secure Boolean Functions on the publisher's website for pricing and purchasing information.

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 nonlinearity, 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.

The IRMA Community

Research IRM

Complexity Measures of Cryptographically Secure Boolean Functions

Purchase

Abstract

Related Content

IRMA Sponsors