Results 1 to 10 of about 17,450 (322)
The multiplicative complexity of 6-variable Boolean functions [PDF]
Cryptography and Communications, 2018 The multiplicative complexity of a Boolean function is the minimum number of AND gates that are necessary and sufficient to implement the function over the basis (AND, XOR, NOT).
çağdaş Çalik +2 more
exaly +5 more sources
Rings of Low Multiplicative Complexity
Finite Fields and Their Applications, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Silverman, Joseph H.
exaly +3 more sources
Boolean functions with multiplicative complexity 3 and 4 [PDF]
Cryptography and Communications, 2020 çağdaş Çalik +2 more
exaly +2 more sources
VLSI-Friendly Filtering Algorithms for Deep Neural Networks
Applied Sciences, 2023 The paper introduces a range of efficient algorithmic solutions for implementing the fundamental filtering operation in convolutional layers of convolutional neural networks on fully parallel hardware.
Aleksandr Cariow +2 more
doaj +1 more source
Efficient Algorithm for Finding Roots of Error-Locator Polynomials
IEEE Access, 2021 A novel method for finding roots of polynomials over finite fields has been proposed. This method is based on the cyclotomic discrete Fourier transform algorithm. The improvement is achieved by using the normalized cyclic convolutions, which have a small
Sergei Valentinovich Fedorenko
doaj +1 more source
The Consistency and Complexity of Multiplicative Additive System Virtual [PDF]
Scientific Annals of Computer Science, 2015 This paper investigates the proof theory of multiplicative additive system virtual (MAV). MAV combines two established proof calculi: multiplicative additive linear logic (MALL) and basic system virtual (BV).
R. Horne
doaj +1 more source
Low AND Depth and Efficient Inverses: a Guide on S-boxes for Low-latency Masking
IACR Transactions on Symmetric Cryptology, 2020 In this work, we perform an extensive investigation and construct a portfolio of S-boxes suitable for secure lightweight implementations, which aligns well with the ongoing NIST Lightweight Cryptography competition.
Begül Bilgin +4 more
doaj +1 more source
Dasta – Alternative Linear Layer for Rasta
IACR Transactions on Symmetric Cryptology, 2020 Progress in the areas of multi-party computation (MPC) and fully homomorphic encryption (FHE) caused the demand of new design strategies, that minimize the number of multiplications in symmetric primitives.
Phil Hebborn, Gregor Leander
doaj +1 more source
Testing identity of collections of quantum states: sample complexity analysis [PDF]
Quantum, 2023 We study the problem of testing identity of a collection of unknown quantum states given sample access to this collection, each state appearing with some known probability. We show that for a collection of $d$-dimensional quantum states of cardinality $N$
Marco Fanizza +2 more
doaj +1 more source
Sublogarithmic uniform Boolean proof nets [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 Using a proofs-as-programs correspondence, Terui was able to compare two models of parallel computation: Boolean circuits and proof nets for multiplicative linear logic. Mogbil et. al.
Clément Aubert
doaj +1 more source