Results 11 to 20 of about 17,450 (322)
Multiplicative Complexity of Autosymmetric Functions: Theory and Applications to Security [PDF]
Design Automation Conference, 2020 The multiplicative complexity of a Boolean function is the minimum number of AND gates (i.e., multiplications) that are sufficient to represent the function over the basis {AND, XOR, NOT}.
Cimato, Stelvio +7 more
core +3 more sources
A Logic Synthesis Toolbox for Reducing the Multiplicative Complexity in Logic Networks [PDF]
Design, Automation and Test in Europe, 2020 Logic synthesis is a fundamental step in the realization of modern integrated circuits. It has traditionally been employed for the optimization of CMOS-based designs, as well as for emerging technologies and quantum computing.
Riener, Heinz +9 more
core +2 more sources
Multiplicative Complexity and Algebraic Structure
Journal of Computer and System Sciences, 1983 AbstractThe classical structure theory of an (associative unitary) algebra A over a field F is invoked to determine upper bounds on the (bilinear) multiplicative complexity π(A) of A over F. The upper bound problem for matrix multiplication over a finite extension F of the rational numbers is related to the multiplicative complexity problem for a ...
Riffelmacher, Dave, Dave Riffelmacher
openaire +2 more sources
The role of multiplicative complexity in compiling Low T-count Oracle circuits [PDF]
2019 IEEE/ACM International Conference on Computer-Aided Design (ICCAD), 2019 We present a constructive method to create quantum circuits that implement oracles |x〉|y〉|0〉 k →|x〉|y⊕f(x)〉|0〉 k for n-variable Boolean functions f with low T-count. In our method f is given as a 2-regular Boolean logic network over the gate basis {∧, ⊕,
De Micheli, Giovanni +14 more
core +3 more sources
The multiplicative complexity of quadratic boolean forms
Theoretical Computer Science, 1992 Let the multiplicative complexity L(f) of a boolean function f be the minimal number of ∧-gates that are sufficient to evaluate f by circuits over the basis ∧, ⊕, 1.
Mirwald, R. +3 more
core +2 more sources
The Relationship between Multiplicative Complexity and Nonlinearity
International Symposium on Mathematical Foundations of Computer Science, 2014 We consider the relationship between nonlinearity and multiplicative complexity for Boolean functions with multiple outputs, studying how large a multiplicative complexity is necessary and sufficient to provide a desired nonlinearity.
Joan Boyar +3 more
core +2 more sources
MiMC:Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity [PDF]
International Conference on the Theory and Application of Cryptology and Information Security, 2016 We explore cryptographic primitives with low multiplicative complexity. This is motivated by recent progress in practical applications of secure multi-party computation (MPC), fully homomorphic encryption (FHE), and zero-knowledge proofs (ZK) where ...
Albrecht, Martin +9 more
core +2 more sources
On the multiplicative complexity of Boolean functions over the basis (∧,⊕,1)
Theoretical Computer Science, 2000 The multiplicative complexity c∧(f) of a Boolean function f is the minimum number of AND gates in a circuit representing f which employs only AND, XOR and NOT gates.
Peralta, René +8 more
core +3 more sources
Algebras of Minimal Multiplicative Complexity [PDF]
2012 IEEE 27th Conference on Computational Complexity, 2012 We prove that an associative algebra $A$ has minimal rank if and only if the Alder -- Strassen bound is also tight for the multiplicative complexity of $A$, that is, the multiplicative complexity of $A$ is $2 \dim A - t_A$ where $t_A$ denotes the number of maximal two sided ideals of $A$. This generalizes a result by E.
Markus Bläser, Bekhan Chokaev
openaire +2 more sources
On the multiplicative complexity of the Discrete Fourier Transform
, 1979 Most results in multiplicative complexity assume that the functions to be computed are in the field of constants extended by indeterminates, that is, the variables satisfy no algebraic relation.
Winograd, S
core +2 more sources