Magnus Gausdal Find

Publication Activity (10 Years)

Years Active: 2013-2023
Publications (10 Years): 11

Top Topics

Boolean Functions

Top Venues

Cryptogr. Commun.

Theor. Comput. Sci.

Publications

Magnus Gausdal Find, Alexander Golovnev, Edward A. Hirsch, Alexander S. Kulikov
Improving 3N Circuit Complexity Lower Bounds. Comput. Complex. 32 (2) (2023)
Magnus Gausdal Find, René Peralta
Better Circuits for Binary Polynomial Multiplication. IEEE Trans. Computers 68 (4) (2019)
Joan Boyar, Magnus Gausdal Find, René Peralta
Small low-depth circuits for cryptographic applications. Cryptogr. Commun. 11 (1) (2019)
Joan Boyar, Magnus Gausdal Find
Multiplicative complexity of vector valued Boolean functions. Theor. Comput. Sci. 720 (2018)
Magnus Gausdal Find, Daniel Smith-Tone, Meltem Sönmez Turan
The number of boolean functions with multiplicative complexity 2. Int. J. Inf. Coding Theory 4 (4) (2017)
Joan Boyar, Magnus Gausdal Find, René Peralta
On various nonlinearity measures for boolean functions. Cryptogr. Commun. 8 (3) (2016)
Magnus Gausdal Find, Alexander Golovnev, Edward A. Hirsch, Alexander S. Kulikov
A Better-Than-3n Lower Bound for the Circuit Complexity of an Explicit Function. FOCS (2016)
Magnus Gausdal Find, Daniel Smith-Tone, Meltem Sönmez Turan
The Number of Boolean Functions with Multiplicative Complexity 2. IACR Cryptol. ePrint Arch. 2015 (2015)
Joan Boyar, Magnus Gausdal Find
Cancellation-free circuits in unbounded and bounded depth. Theor. Comput. Sci. 590 (2015)
Magnus Gausdal Find, Alexander Golovnev, Edward A. Hirsch, Alexander S. Kulikov
A better-than-3n lower bound for the circuit complexity of an explicit function. Electron. Colloquium Comput. Complex. 22 (2015)
Joan Boyar, Magnus Gausdal Find
Constructive Relationships Between Algebraic Thickness and Normality. FCT (2015)
Joan Boyar, Magnus Gausdal Find
The Relationship between Multiplicative Complexity and Nonlinearity. MFCS (2) (2014)
Joan Boyar, Magnus Gausdal Find
Constructive Relationships Between Algebraic Thickness and Normality. CoRR (2014)
Magnus Gausdal Find
On the Complexity of Computing Two Nonlinearity Measures. CSR (2014)
Joan Boyar, Magnus Gausdal Find
The Relationship Between Multiplicative Complexity and Nonlinearity. CoRR (2014)
Magnus Gausdal Find
On the Complexity of Computing Two Nonlinearity Measures. CoRR (2014)
Joan Boyar, Magnus Gausdal Find
Cancellation-Free Circuits in Unbounded and Bounded Depth. FCT (2013)