Concept
Feistel cipher
Related publications (84)
Green Cryptography and Other Optimisations
The spectral decomposition of cryptography into its life-giving components yields an interlaced network oftangential and orthogonal disciplines that are nonetheless invariably grounded by the same denominator: theirimplementation on commodity computing pla ...
EPFL2023BBB security for 5-round even-Mansour-based key-alternating Feistel ciphers
In this paper, we study the security of the Key-Alternating Feistel (KAF) ciphers, a class of key alternating ciphers with the Feistel structure, where each round of the cipher is instantiated with n-bit public round permutation Pi\documentclass[12pt]{mini ...
SPRINGER2023Six shades lighter: a bit-serial implementation of the AES family
Subhadeep Banik, Muhammed Fatih Balli, Sergio Roldán Lombardía
Recently, cryptographic literature has seen new block cipher designs such as PRESENT, GIFT or SKINNY that aim to be more lightweight than the current standard, i.e., AES. Even though AES family of block ciphers were designed two decades ago, they still rem ...
2021Serial Lightweight Implementation Techniques for Block Ciphers
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 ...
EPFL2021A Deeper Look at the Energy Consumption of Lightweight Block Ciphers
Francesco Regazzoni, Andrea Felice Caforio, Subhadeep Banik, Muhammed Fatih Balli
In the last few years, the field of lightweight cryptography has seen an influx in the number of block ciphers and hash functions being proposed. In the past there have been numerous papers that have looked at circuit level implementation of block ciphers ...
IEEE2021Orthros: A Low-Latency PRF
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 ...
2021Analyzing and Protecting Communication Metadata
Most communication systems (e.g., e-mails, instant messengers, VPNs) use encryption to prevent third parties from learning sensitive information.However, encrypted communications protect the contents but often leak metadata: the amount of data sent and the ...
EPFL2021Atom: 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 ...
2021The Area-Latency Symbiosis: Towards Improved Serial Encryption Circuits
Andrea Felice Caforio, Subhadeep Banik, Muhammed Fatih Balli
The bit-sliding paper of Jean et al. (CHES 2017) showed that the smallest-size circuit for SPN based block ciphers such as AES, SKINNY and PRESENT can be achieved via bit-serial implementations. Their technique decreases the bit size of the datapath and na ...
2020Sublinear Bounds on the Distinguishing Advantage for Multiple Samples
The maximal achievable advantage of a (computationally unbounded) distinguisher to determine whether a source is distributed according to distribution or , when given access to one sample of , is characterized by the statistical distance ...
Springer, Cham2020