CryptoDB
The Number of Boolean Functions with Multiplicative Complexity 2
Authors: | |
---|---|
Download: |
BibTeX
@article{eprint-2015-26708, title={The Number of Boolean Functions with Multiplicative Complexity 2}, journal={IACR Cryptology ePrint Archive}, volume={2015}, pages={1041}, url={https://eprint.iacr.org/2015/1041}, author={Magnus Gausdal Find and Daniel Smith-Tone and Meltem Sönmez Turan}, year=2015 }