Results 41 to 50 of about 17,450 (322)
State Complexity of Multiple Catenations
Fundamenta Informaticae, 2018 We improve some results relative to the state complexity of the multiple catenations described by Gao and Yu. In particular we nearly divide by 2 the size of the alphabet needed for witnesses. We also give some refinements to the algebraic expression of the state complexity, which is especially complex with this operation.
Caron, Pascal +2 more
openaire +3 more sources
The multiplicative complexity of interval checking
IACR Cryptol. ePrint Arch., 2022 We determine the exact AND-gate cost of checking if $a\leq x < b$, where $a$ and $b$ are constant integers. Perhaps surprisingly, we find that the cost of interval checking never exceeds that of a single comparison and, in some cases, it is even lower.
Thomas Häner, Mathias Soeken
openaire +3 more sources
A Low-Overhead Countermeasure against Differential Power Analysis for AES Block Cipher
Applied Sciences, 2021 This paper presents the employment of a DPA attack on the NIST (National Institute of Standards and Technology) standardized AES (advance encryption standard) protocol for key retrieval and prevention.
Muhammad Asfand Hafeez +5 more
doaj +1 more source
A Note on 5-bit Quadratic Permutations’ Classification
IACR Transactions on Symmetric Cryptology, 2017 Classification of vectorial Boolean functions up to affine equivalence is used widely to analyze various cryptographic and implementation properties of symmetric-key algorithms.
Dušan Božilov +2 more
doaj +1 more source
Symmetry of Information from Meta-Complexity [PDF]
, 2022 Symmetry of information for time-bounded Kolmogorov complexity is a hypothetical inequality that relates time-bounded Kolmogorov complexity and its conditional analogue.
Hirahara, Shuichi
core +1 more source
A Tool for Lightweight (AND, XOR) Implementations of Large-Degree S-boxes
Transactions on Cryptographic Hardware and Embedded SystemsWe propose a new ad hoc automatic tool to look for lightweight implementations of non-linear functions on up to 7 variables. This tool is mainly aimed at finding implementations of arbitrary cryptographic S-boxes, with the goal of enabling lightweight ...
Marie Bolzer +2 more
doaj +1 more source
The multiplicative complexity of discrete cosine transforms
, 1992 We obtain the multiplicative complexity of discrete cosine transforms in all cases. It is given as a function of the multiplicative complexity of discrete Fourier transforms.
Feig, Ephraim, Linzer, Elliot
core +1 more source
UnifiedFace: A Uniform Margin Loss Function for Face Recognition
Applied Sciences, 2023 Face recognition has achieved great success due to the development of deep convolutional neural networks (DCNNs) and loss functions based on margin. However, complex DCNNs bring a large number of parameters as well as computational effort, which pose a ...
Feng Zhao +3 more
doaj +1 more source
Concrete Multiplicative Complexity of Symmetric Functions
, 2006 The multiplicative complexity of a Boolean function f is defined as the minimum number of binary conjunction (AND) gates required to construct a circuit representing f, when only exclusive-or, conjunction and negation gates may be used.
Peralta, Rene +3 more
core +1 more source
On complexity of lobbying in multiple referenda [PDF]
Review of Economic Design, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
CHRISTIAN,Robin +3 more
openaire +4 more sources