Magnus Find

IEEE Trans. Computers, 2019

Small low-depth circuits for cryptographic applications.

[BibT_eX]

[DOI]

Cryptogr. Commun., 2019

2018

Multiplicative complexity of vector valued Boolean functions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

2017

The number of boolean functions with multiplicative complexity 2.

[BibT_eX]

[DOI]

Daniel Smith-Tone

Meltem Sönmez Turan

Int. J. Inf. Coding Theory, 2017

2016

Separating OR, SUM, and XOR circuits.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2016

On various nonlinearity measures for boolean functions.

[BibT_eX]

[DOI]

Cryptogr. Commun., 2016

2015

Cancellation-free circuits in unbounded and bounded depth.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

A better-than-3n lower bound for the circuit complexity of an explicit function.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2015

Constructive Relationships Between Algebraic Thickness and Normality.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory - 20th International Symposium, 2015

2014

The Relationship between Multiplicative Complexity and Nonlinearity.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

On the Complexity of Computing Two Nonlinearity Measures.

[BibT_eX]

[DOI]

Proceedings of the Computer Science - Theory and Applications, 2014

2013

Four Measures of Nonlinearity.

[BibT_eX]

[DOI]

Magnus Find

IACR Cryptol. ePrint Arch., 2013

2012

Cancellation-free circuits: An approach for proving superlinear lower bounds for linear Boolean operators

[BibT_eX]

[DOI]