搜索结果: 1-5 共查到“密码学 Multiplicative Complexity”相关记录5条 . 查询时间(0.097 秒)
The Multiplicative Complexity of 6-variable Boolean Functions
Affine equivalence Boolean functions Circuit complexity
2018/1/12
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). Finding the multiplic...
On the Multiplicative Complexity of Boolean Functions and Bitsliced Higher-Order Masking
Higher-Order Masking Boolean Functions Multiplicative Complexity
2016/6/6
Higher-order masking is a widely used countermeasure to
make software implementations of blockciphers achieve high security levels
against side-channel attacks. Unfortunately, it often comes with a
...
MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity
distributed cryptography cryptanalysis block ciphers
2016/5/23
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 encryp...
The Multiplicative Complexity of Boolean Functions on Four and Five Variables
Affine transformation Boolean functions Circuit complexity
2015/12/23
A generic way to design lightweight cryptographic primitives is to construct simple rounds
using small nonlinear components such as 4x4 S-boxes and use these iteratively (e.g., PRESENT [1]
and SPONG...
The Number of Boolean Functions with Multiplicative Complexity 2
Affine equivalence Boolean functions Cryptography
2015/12/22
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 ...