Publications related to Statistical cryptanalysis of block ciphers

Atom: A Stream Cipher with Double Key Filter

Andrea Felice Caforio, Subhadeep Banik, Willi Meier

It has been common knowledge that for a stream cipher to be secure against generic TMD tradeoff attacks, the size of its internal state in bits needs to be at least twice the size of the length of its secret key. In FSE 2015, Armknecht and Mikhalev however ...

2021

Serial Lightweight Implementation Techniques for Block Ciphers

Muhammed Fatih Balli

Most of the cryptographic protocols that we use frequently on the internet are designed in a fashion that they are not necessarily suitable to run in constrained environments. Applications that run on limited-battery, with low computational power, or area ...

EPFL2021

Horizontal side-channel full key recovery on ephemeral SIKE

Natacha Yolande Emmanuel Marie Linard de Guertechin, Aymeric Genet, Novak Kaluderovic

This paper describes the first practical single-trace side-channel power analysis of SIKE. The attack exploits the nature of elliptic curve point addition formulas which require the same function to be executed multiple times. We target the three point lad ...

2021

Orthros: A Low-Latency PRF

Subhadeep Banik

We present Orthros, a 128-bit block pseudorandom function. It is designed with primary focus on latency of fully unrolled circuits. For this purpose, we adopt a parallel structure comprising two keyed permutations. The round function of each permutation is ...

2021

Efficient Bootstrapping for Approximate Homomorphic Encryption with Non-sparse Keys

Jean-Pierre Hubaux, Juan Ramón Troncoso-Pastoriza, Jean-Philippe Léonard Bossuat, Christian Vincent Mouchet

We present a bootstrapping procedure for the full-RNS variant of the approximate homomorphic-encryption scheme of Cheon et al., CKKS (Asiacrypt 17, SAC 18). Compared to the previously proposed procedures (Eurocrypt 18 & 19, CT-RSA 20), our bootstrapping pr ...

SPRINGER INTERNATIONAL PUBLISHING AG2021

Sublinear Bounds on the Distinguishing Advantage for Multiple Samples

Serge Vaudenay

The maximal achievable advantage of a (computationally unbounded) distinguisher to determine whether a source

Z

is distributed according to distribution

P_0

or

P_1

, when given access to one sample of

Z

, is characterized by the statistical distance ...

Springer, Cham2020

Determining the Core Primitive for Optimally Secure Ratcheting

Serge Vaudenay, Muhammed Fatih Balli

After ratcheting attracted attention mostly due to practical real-world protocols, recently a line of work studied ratcheting as a primitive from a theoretic point of view. Literature in this line, pursuing the strongest security of ratcheting one can hope ...

2020

On Polar Coding For Finite Blocklength Secret Key Generation Over Wireless Channels

Yanina Yurina Shkel

We consider the problem of secret key generation from correlated Gaussian random variables in the finite blocklength regime. Such keys could be used to encrypt communication in IoT networks, and have provable secrecy guarantees in contrast to classic crypt ...

IEEE2020

Closing Leaks: Routing Against Crosstalk Side-Channel Attacks

Mirjana Stojilovic, Seyedeh Sharareh Mirzargar, Zeinab Seifoori

This paper presents an extension to PathFinder FPGA routing algorithm, which enables it to deliver FPGA designs free from risks of crosstalk attacks. Crosstalk side-channel attacks are a real threat in large designs assembled from various IPs, where some I ...

2020

Tweaking Key-Alternating Feistel Block Ciphers

Lei Wang, Hailun Yan

Tweakable block cipher as a cryptographic primitive has found wide applications in disk encryption, authenticated encryption mode and message authentication code, etc. One popular approach of designing tweakable block ciphers is to tweak the generic constr ...

Springer, Cham2020

Statistical cryptanalysis of block ciphers

Graph Chatbot

Chat with Graph Search

Atom: A Stream Cipher with Double Key Filter

Serial Lightweight Implementation Techniques for Block Ciphers

Horizontal side-channel full key recovery on ephemeral SIKE

Orthros: A Low-Latency PRF

Efficient Bootstrapping for Approximate Homomorphic Encryption with Non-sparse Keys

Sublinear Bounds on the Distinguishing Advantage for Multiple Samples

Determining the Core Primitive for Optimally Secure Ratcheting

On Polar Coding For Finite Blocklength Secret Key Generation Over Wireless Channels

Closing Leaks: Routing Against Crosstalk Side-Channel Attacks

Tweaking Key-Alternating Feistel Block Ciphers

Determining the Core Primitive for Optimally Secure Ratcheting

On Polar Coding For Finite Blocklength Secret Key Generation Over Wireless Channels

Closing Leaks: Routing Against Crosstalk Side-Channel Attacks

Atom: A Stream Cipher with Double Key Filter

Serial Lightweight Implementation Techniques for Block Ciphers

Sublinear Bounds on the Distinguishing Advantage for Multiple Samples

Tweaking Key-Alternating Feistel Block Ciphers

Efficient Bootstrapping for Approximate Homomorphic Encryption with Non-sparse Keys

Horizontal side-channel full key recovery on ephemeral SIKE

Orthros: A Low-Latency PRF