#### Filter Results:

- Full text PDF available (8)

#### Publication Year

2012

2016

- This year (0)
- Last 5 years (9)
- Last 10 years (10)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Joan Boyar, Magnus Find
- FCT
- 2013

We study the notion of “cancellation-free” circuits. This is a restriction of linear Boolean circuits (XOR circuits), but can be considered as being equivalent to previously studied models of… (More)

- Joan Boyar, Magnus Find
- ArXiv
- 2012

We continue to study the notion of cancellation-free linear circuits. We show that every matrix can be computed by a cancellationfree circuit, and almost all of these are at most a constant factor… (More)

- Joan Boyar, Magnus Find, René Peralta
- IACR Cryptology ePrint Archive
- 2013

Cryptographic applications, such as hashing, block ciphers and stream ciphers, make use of functions which are simple by some criteria (such as circuit implementations), yet hard to invert almost… (More)

- Magnus Find, Alexander Golovnev, Edward A. Hirsch, Alexander S. Kulikov
- 2016 IEEE 57th Annual Symposium on Foundations of…
- 2015

We consider Boolean circuits over the full binary basis. We prove a (3+1/86)n-o(n) lower bound on the size of such a circuit for an explicitly defined predicate, namely an affine disperser for… (More)

- Magnus Find
- CSR
- 2014

We study the computational complexity of two Boolean non-linearity measures: the nonlinearity and the multiplicative complexity. We show that if one-way functions exist, no algorithm can compute the… (More)

- Joan Boyar, Magnus Find
- FCT
- 2015

We study the relationship between two measures of Boolean functions; algebraic thickness and normality. For a function f , the algebraic thickness is a variant of the sparsity, the number of nonzero… (More)

- Joan Boyar, Magnus Find
- MFCS
- 2014

We consider the multiplicative complexity of Boolean functions with multiple bits of output, studying how large a multiplicative complexity is necessary and sufficient to provide a desired… (More)

- Magnus Find, Daniel Smith-Tone, Meltem Sönmez Turan
- IACR Cryptology ePrint Archive
- 2015

Multiplicative complexity is a complexity measure defined as the minimum number of AND gates required to implement a given primitive by a circuit over the basis (AND, XOR, NOT). Implementations of… (More)

- Joan Boyar, Magnus Find, René Peralta
- Cryptography and Communications
- 2015

A necessary condition for the security of cryptographic functions is to be “sufficiently distant” from linear, and cryptographers have proposed several measures for this distance. In this paper, we… (More)

- Magnus Find, Mika Göös, Matti Järvisalo, Petteri Kaski, Mikko Koivisto, Janne H. Korhonen
- J. Comput. Syst. Sci.
- 2016

Given a boolean n × n matrix A we consider arithmetic circuits for computing the transformation x ↦ Ax over different semirings. Namely, we study three circuit models: monotone OR-circuits, monotone… (More)

- ‹
- 1
- ›