"Complexity Measures of Cryptographically Secure Boolean Functions."

Chungath Srinivasan, K. V. Lakshmy, Madathil Sethumadhavan (2011)

> Home

Details and statistics

DOI: 10.4018/978-1-60960-123-2.CH015

access: closed

type: Part in Book or Collection

metadata version: 2017-05-16

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - books/daglib/p/SrinivasanLS11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/books/daglib/p/SrinivasanLS11
Chungath Srinivasan, K. V. Lakshmy, Madathil Sethumadhavan:
Complexity Measures of Cryptographically Secure Boolean Functions. Cyber Security, Cyber Crime and Cyber Forensics 2011: 220-230

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.