Upper Bounds on the Multiplicative Complexity of Symmetric Boolean Functions - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Luís T. A. N. Brandão' in GoogleThis author has not been identified. Look up 'Çagdas Çalik' in GoogleThis author has not been identified. Look up 'Meltem Sönmez Turan' in GoogleThis author has not been identified. Look up 'René Peralta' in Google

runs on WebDSL