Complexity Measures of Cryptographically Secure Boolean Functions - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Chungath Srinivasan, K. V. Lakshmy, M. Sethumadhavan. Complexity Measures of Cryptographically Secure Boolean Functions. In Raghu Santanam, M. Sethumadhavan, Mohit Virendra, editors, Cyber Security, Cyber Crime and Cyber Forensics - Applications and Perspectives. pages 220-230, IGI Global, 2011. [doi]

This author has not been identified. Look up 'Chungath Srinivasan' in GoogleThis author has not been identified. Look up 'K. V. Lakshmy' in GoogleThis author has not been identified. Look up 'M. Sethumadhavan' in Google

runs on WebDSL