Complexity Measures of Cryptographically Secure Boolean Functions

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]

@incollection{SrinivasanLS11,
  title = {Complexity Measures of Cryptographically Secure Boolean Functions},
  author = {Chungath Srinivasan and K. V. Lakshmy and M. Sethumadhavan},
  year = {2011},
  doi = {10.4018/978-1-60960-123-2.ch015},
  url = {http://dx.doi.org/10.4018/978-1-60960-123-2.ch015},
  researchr = {https://researchr.org/publication/SrinivasanLS11},
  cites = {0},
  citedby = {0},
  pages = {220-230},
  booktitle = {Cyber Security, Cyber Crime and Cyber Forensics - Applications and Perspectives},
  editor = {Raghu Santanam and M. Sethumadhavan and Mohit Virendra},
  publisher = {IGI Global},
  isbn = {978-1-60960-123-2},
}