TY  - JOUR
AU  - Brandao, Luis
AU  - Calik, Cagdas
AU  - Turan, Meltem Sonmez
AU  - Peralta, Rene
C2  - Cryptography and Communication
DA  - 2019-08-17 00:08:00
DO  - https://doi.org/10.1007/s12095-019-00377-3
LA  - en
PB  - Cryptography and Communication
PY  - 2019
TI  - Upper Bounds on the Multiplicative Complexity of Symmetric Boolean Functions
UR  - https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=926913
ER  -