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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.