Enumeration of multivariable decipherable Boolean Functions

The paper enumerates the allowable combinations of decipherable boolean functions of certain types, namely functions of a given number of message and key bits. Such an enumeration is based upon decipherable functions property of being one-to-one. Formulas for finding the number of decipherable boolean functions are also given.