Results 21 to 30 of about 17,450 (322)
Construction of a Low Multiplicative Complexity GF (24) Inversion Circuit for Compact AES S-Box
IEEE Region 10 Conference, 2018 In this work, we construct a compact composite AES S-Box by deriving a new low multiplicative complexity GF (2 4 ) inversion circuit. A deterministic tree search algorithm is applied to search for constructions that are optimum in terms of multiplicative
Jia Jun Tay +9 more
core +2 more sources
Upper Bounds on the Multiplicative Complexity of Symmetric Boolean Functions. [PDF]
Cryptogr Commun, 2019 A special metric of interest about Boolean functions is multiplicative complexity (MC): the minimum number of AND gates sufficient to implement a function with a Boolean circuit over the basis {XOR, AND, NOT}.
Brandão LTAN +3 more
europepmc +2 more sources
Cryptography and Communications, 2023 The multiplicative complexity of an S-box over a finite field is the minimum number of multiplications needed to implement the S-box as an arithmetic circuit.
M. Steiner
semanticscholar +1 more source
Provable Security of SP Networks with Partial Non-Linear Layers
IACR Transactions on Symmetric Cryptology, 2021 Motivated by the recent trend towards low multiplicative complexity blockciphers (e.g., Zorro, CHES 2013; LowMC, EUROCRYPT 2015; HADES, EUROCRYPT 2020; MALICIOUS, CRYPTO 2020), we study their underlying structure partial SPNs, i.e., Substitution ...
Chun Guo +4 more
doaj +1 more source
Additive-error fine-grained quantum supremacy [PDF]
Quantum, 2020 It is known that several sub-universal quantum computing models, such as the IQP model, the Boson sampling model, the one-clean qubit model, and the random circuit model, cannot be classically simulated in polynomial time under certain conjectures in ...
Tomoyuki Morimae, Suguru Tamaki
doaj +1 more source
Nonbinary polar coding with low decoding latency and complexity
Journal of Information and Intelligence, 2023 In this paper, we propose a new class of nonbinary polar codes, where the symbol-level polarization is achieved by using a 2 × 2 q-ary matrix 10β1 as the kernel.
Peiyao Chen, Baoming Bai, Xiao Ma
doaj +1 more source
Direct multiplicative methods for sparse matrices. Linear programming [PDF]
Компьютерные исследования и моделирование, 2017 Multiplicative methods for sparse matrices are best suited to reduce the complexity of operations solving systems of linear equations performed on each iteration of the simplex method.
Anastasiya Borisovna Sviridenko
doaj +1 more source
On the Complexity of Multiple Sequence Alignment [PDF]
Journal of Computational Biology, 1994 We study the computational complexity of two popular problems in multiple sequence alignment: multiple alignment with SP-score and multiple tree alignment. It is shown that the first problem is NP-complete and the second is MAX SNP-hard. The complexity of tree alignment with a given phylogeny is also considered.
Lusheng Wang 0001, Tao Jiang 0001
openaire +2 more sources
Linear Expected Complexity for Directional and Multiplicative Voronoi Diagrams [PDF]
, 2020 While the standard unweighted Voronoi diagram in the plane has linear worst-case complexity, many of its natural generalizations do not. This paper considers two such previously studied generalizations, namely multiplicative and semi Voronoi diagrams ...
Fan, Chenglin, Raichel, Benjamin
core +1 more source
The complexity of iterated multiplication
[1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference, 1995 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Immerman, N, LANDAU, S
openaire +2 more sources