Multiplicative complexity of vector valued Boolean functions
From MaRDI portal
Publication:1704580
DOI10.1016/j.tcs.2018.02.023zbMath1391.94909arXiv1407.6169OpenAlexW2962749896WikidataQ130190369 ScholiaQ130190369MaRDI QIDQ1704580
Magnus Gausdal Find, Joan. Boyar
Publication date: 12 March 2018
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1407.6169
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On various nonlinearity measures for Boolean functions
- Financial cryptography and data security. FC 2013 workshops, USEC and WAHC 2013, Okinawa, Japan, April 1, 2013. Revised selected papers
- Boolean function complexity. Advances and frontiers.
- Polynomial multiplication over finite fields: from quadratic to straight-line complexity
- Tight bounds for the multiplicative complexity of symmetric functions
- Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
- On the complexity of multiplication in finite fields
- The multiplicative complexity of quadratic boolean forms
- Restriction, terms and nonlinearity of Boolean functions
- On the multiplicative complexity of Boolean functions over the basis (\(\land,\oplus,1)\).
- Financial cryptography and data security. FC 2014 workshops, BITCOIN and WAHC 2014, Christ Church, Barbados, March 7, 2014. Revised selected papers
- Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten
- Ciphers for MPC and FHE
- Extremal Combinatorics
- Improved Garbled Circuit: Free XOR Gates and Applications
- Multiplicative complexity of polynomial multiplication over finite fields
- An Improved Lower Bound on Polynomial Multiplication
- New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
- Computing Blindfolded: New Developments in Fully Homomorphic Encryption
This page was built for publication: Multiplicative complexity of vector valued Boolean functions
