IACR
2016
9 years 12 months ago
2016
We first prove the truthfulness of a conjecture on the nonlinearity of monotone Boolean functions in even dimension, proposed in the recent paper “Cryptographic properties of mo...
IACR
2016
9 years 12 months ago
2016
Recent observations on polynomial structures of AES-like round functions are analysed in this note. We present computational evidence that input/output bits of AESlike 2-round tra...
89
Voted
IACR
2016
9 years 12 months ago
2016
108
Voted
IACR
2016
9 years 12 months ago
2016
The block cipher Simon has a very simple round function. This simplicity allows us to compute the correlation matrix of the round function. Despite its simplicity, Simon exhibits s...
104
Voted
IACR
2016
9 years 12 months ago
2016
The Russian Federation’s standardization agency has recently published a hash function called Streebog and a 128-bit block cipher called Kuznyechik. Both of these algorithms use ...
101
Voted
IACR
2016
9 years 12 months ago
2016
There are many kinds of attacks that can be mounted on block ciphers: differential attacks, impossible differential attacks, truncated differential attacks, boomerang attacks. W...
91
Voted
IACR
2016
9 years 12 months ago
2016
105
Voted
IACR
2016
9 years 12 months ago
2016
We introduce a new technique for tight security proofs called work factor partitioning. Using this technique in a modified version of the framework of D¨ottling and Schr¨oder (C...
94
Voted
IACR
2016
9 years 12 months ago
2016
—Modular multiplication is the fundamental and compute-intense operation in many Public-Key crypto-systems. This paper presents two modular multipliers with their efficient arch...
102
Voted
IACR
2016
9 years 12 months ago
2016
In universal composability frameworks, adversaries (or environments) and protocols/ideal functionalities often have to exchange meta-information on the network interface, such as a...