Luís T. A. N. Brandão, Çagdas Çalik, Meltem Sönmez Turan, René Peralta. Upper Bounds on the Multiplicative Complexity of Symmetric Boolean Functions. IACR Cryptology ePrint Archive, 2019:708, 2019. [doi]
No references recorded for this publication.
No citations of this publication recorded.