IACR
2016
8 years 1 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...
IACR
2016
8 years 1 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 ...
IACR
2016
8 years 1 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...
IACR
2016
8 years 1 months ago
2016
IACR
2016
8 years 1 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...
IACR
2016
8 years 1 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...
IACR
2016
8 years 1 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...
IACR
2016
8 years 1 months ago
2016
It is widely accepted that higher-order masking is a sound countermeasure to protect implementations of block ciphers against side-channel attacks. The main issue while designing s...
IACR
2016
8 years 1 months ago
2016
Implementations of white-box cryptography aim to protect a secret key in a white-box environment in which an adversary has full control over the execution process and the entire en...
IACR
2016
8 years 1 months ago
2016
The security of many cryptographic schemes has been based on special instances of the Learning with Errors (LWE) problem, e.g., Ring-LWE, LWE with binary secret, or LWE with ternar...