Concept

RC4

Publications associées (28)

Near Collision Attack Against Grain V1

Subhadeep Banik, Willi Meier, Daniel Patrick Collins

A near collision attack against the Grain v1 stream cipher was proposed by Zhang et al. in Eurocrypt 18. The attack uses the fact that two internal states of the stream cipher with very low hamming distance between them, produce similar keystream sequences ...

2023

Bridging the gap between theoretical and practical privacy technologies for at-risk populations

Kasra Edalatnejadkhamene

With the pervasive digitalization of modern life, we benefit from efficient access to information and services. Yet, this digitalization poses severe privacy challenges, especially for special-needs individuals. Beyond being a fundamental human right, priv ...

EPFL2023

Green Cryptography and Other Optimisations

Andrea Felice Caforio

The spectral decomposition of cryptography into its life-giving components yields an interlaced network of tangential and orthogonal disciplines that are nonetheless invariably grounded by the same denominator: their implementation on commodity computing p ...

EPFL2023

Revisiting the Indifferentiability of the Sum of Permutations

Ritam Bhaumik

The sum of two n-bit pseudorandom permutations is known to behave like a pseudorandom function with n bits of security. A recent line of research has investigated the security of two public n-bit permutations and its degree of indifferentiability. Mandal e ...

Springer2023

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

Power Yoga: Variable-Stretch Security of CCM for Energy-Efficient Lightweight IoT

Damian Vizár, Reza Reyhanitabar, Emiljano Gjiriti

The currently ongoing NIST LWC project aims at identifying new standardization targets for lightweight authenticated encryption with associated data (AEAD) and (optionally) lightweight cryptographic hashing. NIST has deemed it important for performance and ...

2021

Atom: A Stream Cipher with Double Key Filter

Subhadeep Banik, Willi Meier, Andrea Felice Caforio

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

Melting SNOW-V: improved lightweight architectures

Subhadeep Banik, Muhammed Fatih Balli, Andrea Felice Caforio

SNOW-V is a stream cipher proposed by Ekdahl et al. at IACR ToSC 2019(3) with an objective to be deployed as the encryption primitive in 5G systems. The stream cipher offers 256-bit security and is ready for deployment in the post-quantum era, in which as ...

2022

Cryptanalysis of LowMC instances using single plaintext/ciphertext pair

Serge Vaudenay, Subhadeep Banik, Fatma Betül Durak, Khashayar Barooti

Arguably one of the main applications of the LowMC family ciphers is in the post-quantum signature scheme PICNIC. Although LowMC family ciphers have been studied from a cryptanalytic point of view before, none of these studies were directly concerned with ...

2020

Cryptanalysis of Plantlet

Subhadeep Banik, Khashayar Barooti

Plantlet is a lightweight stream cipher designed by Mikhalev, Armknecht and Muller in IACR ToSC 2017. It has a Grain-like structure with two state registers of size 40 and 61 bits. In spite of this, the cipher does not seem to lose in security against gene ...

2019

Beyond Conventional Security in Sponge-Based Authenticated Encryption Modes

Philipp Svetolik Jovanovic

The Sponge function is known to achieve 2c/2 security, where c is its capacity. This bound was carried over to its keyed variants, such as SpongeWrap, to achieve a min{2c/2,2 kappa} security bound, with kappa the key length. Similarly, many CAESAR competit ...

SPRINGER2019

Some Proofs of Conditional and Joint Biases in RC4 Stream Cipher

Subhadeep Banik

In this paper we present proofs for the new biases in RC4 which were experimentally found and listed out (without theoretical justifi- cations and proofs) in a paper by Vanhoef et al. in USENIX 2015. Their purpose was to exploit the vulnerabilities of RC4 ...

2018

Theoretical Understanding of Some Conditional and Joint Biases in RC4 Stream Cipher

Subhadeep Banik

In this paper we present proofs for the new biases in RC4 which were experimentally found and listed out (without theoretical justifications and proofs) in a paper by Vanhoef et al. in USENIX 2015. Their purpose was to exploit the vulnerabilities of RC4 in ...

IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG2018

On Design of Robust Lightweight Stream Cipher with Short Internal State

Subhadeep Banik

The stream cipher Sprout with a short internal state was proposed in FSE 2015. Although the construction guaranteed resistance to generic Time Memory Data Tradeoff attacks, there were some weaknesses in the design and the cipher was completely broken. In t ...

2018

Scalable Bias-Resistant Distributed Randomness

Bryan Alexander Ford, Linus Gasser, Eleftherios Kokoris Kogias, Philipp Svetolik Jovanovic, Nicolas Gailly, Ismail Khoffi

Bias-resistant public randomness is a critical component in many (distributed) protocols. Existing solutions do not scale to hundreds or thousands of participants, as is needed in many decentralized systems. We propose two large-scale distributed protocols ...

IEEE2017

Some Cryptanalytic Results on Lizard

Subhadeep Banik

Lizard is a lightweight stream cipher proposed by Hamann, Krause and Meier in IACR ToSC 2017. It has a Grain-like structure with two state registers of size 90 and 31 bits. The cipher uses a 120 bit secret key and a 64 bit IV. The authors claim that Lizard ...

2017

Seeking Anonymity in an Internet Panopticon

Bryan Alexander Ford

Internet, users often need to assume, by default, that their every statement or action online is monitored and tracked. The Dissent project at Yale University takes a collective approach to online anonymity, based on different algorithmic foundations from ...

2015

Misuse-Resistant Variants of the OMD Authenticated Encryption Mode

Serge Vaudenay, Damian Vizár, Reza Reyhanitabar

We present two variants of OMD which are robust against nonce misuse. Security of OMD---a CAESAR candidate---relies on the assumption that implementations always ensure correct use of nonce (a.k.a. message number); namely that, the nonce never gets repeate ...

Springer-Verlag Berlin2014

On the Key Schedule of Lightweight Block Ciphers

Serge Vaudenay, Jialin Huang

Key schedules in lightweight block ciphers are often highly simplified, which causes weakness that can be exploited in many attacks. Today it remains an open problem on how to use limited operations to guarantee enough diffusion of key bits in lightweight ...

Springer-Verlag Berlin2014

Efficient Non-malleable Codes and Key-Derivation for Poly-size Tampering Circuits

Sebastian Faust

Non-malleable codes, defined by Dziembowski, Pietrzak and Wichs (ICS ’10), provide roughly the following guarantee: if a codeword c encoding some message x is tampered to c' = f(c) such that c c, then the tampered message x contained in c reveals no inf ...

Springer2014