Determining the Multiplicative Complexity of Boolean Functions using SAT

Mathias Soeken. Determining the Multiplicative Complexity of Boolean Functions using SAT. IACR Cryptology ePrint Archive, 2020:530, 2020. [doi]

Authors

Mathias Soeken

This author has not been identified. Look up 'Mathias Soeken' in Google