Small low-depth circuits for cryptographic applications J Boyar, MG Find, R Peralta Cryptography and Communications 11, 109-127, 2019 | 22 | 2019 |
Four Measures of Nonlinearity J Boyar, M Find, R Peralta Algorithms and Complexity, 61-72, 2013 | 21 | 2013 |
Better circuits for binary polynomial multiplication MG Find, R Peralta IEEE Transactions on Computers 68 (4), 624-630, 2018 | 13 | 2018 |
A better-than-3n lower bound for the circuit complexity of an explicit function MG Find, A Golovnev, EA Hirsch, AS Kulikov 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS), 89-98, 2016 | 11 | 2016 |
Cancellation-Free circuits in unbounded and bounded depth J Boyar, MG Find Fundamentals of Computation Theory, 159-170, 2013 | 10 | 2013 |
On various nonlinearity measures for boolean functions J Boyar, MG Find, R Peralta Cryptography and Communications 8, 313-330, 2016 | 7 | 2016 |
Multiplicative complexity of vector valued Boolean functions J Boyar, MG Find Theoretical Computer Science 720, 36-46, 2018 | 4 | 2018 |
The Relationship between Multiplicative Complexity and Nonlinearity J Boyar, MG Find Mathematical Foundations of Computer Science 2014, 130-140, 2014 | 4 | 2014 |
The number of Boolean functions with multiplicative complexity 2 MG Find, D Smith-Tone, MS Turan International Journal of Information and Coding Theory 4 (4), 222-236, 2017 | 3 | 2017 |
On the complexity of computing two nonlinearity measures MG Find Computer Science-Theory and Applications: 9th International Computer Science …, 2014 | 3 | 2014 |
Cancellation-free circuits: An approach for proving superlinear lower bounds for linear Boolean operators J Boyar, M Find arXiv preprint arXiv:1207.5321, 2012 | 3 | 2012 |
Separating OR, SUM, and XOR circuits M Find, M Göös, M Järvisalo, P Kaski, M Koivisto, JH Korhonen Journal of computer and system sciences 82 (5), 793-801, 2016 | 2 | 2016 |
Improving Circuit Complexity Lower Bounds MG Find, A Golovnev, EA Hirsch, AS Kulikov computational complexity 32 (2), 13, 2023 | | 2023 |
Multiplicative Complexity of Vector Valued Boolean Functions MG Find, J Boyar arXiv preprint arXiv:1407.6169, 2014 | | 2014 |