On Cryptographic Complexity of Boolean Functions