Abstract
Open problems about enumerating Boolean functions of cryptographic significance are (partially) solved in this paper.
Article PDF
Similar content being viewed by others
References
C. J. Mitchell. Enumerating Boolean functions of cryptographic significance. Journal of Cryptology, 2:155–170, 1990.
A. Tucker, Applied Combinatorics, Wiley, New York, 1984.
Author information
Authors and Affiliations
Additional information
Communicated by Ueli M. Maurer
Project supported by Trans-Century Training Programme Foundation for the Talents by the State Education Commission.
Rights and permissions
About this article
Cite this article
XianYang, Y., Guo, B. Further enumerating boolean functions of cryptographic significance. J. Cryptology 8, 115–122 (1995). https://doi.org/10.1007/BF00202268
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00202268