Description
In November 2004, the European Network of Excellence for Cryptology (ECRYPT) launched a call for new stream cipher primitives. Authors from academia as well as industry submitted 34 designs, and in May 2008, 8 ciphers were chosen for the eSTREAM final portfolio. In this talk, we look back at the history of stream ciphers to understand the design choices made by cryptographers today. We start by reviewing "historical" designs based on linear feedback shift registers, such as the GSM A5/1 cipher. We explain basic cryptanalytic techniques - such as guess-and-determine attacks and correlation attacks - used to break LFSR-based ciphers. We also stop briefly to examine the importance of state size and key/IV length w.r.t. time-memory trade-offs. We then move on to the beginning of 2000s, which brought us new designs from the NESSIE research project, including SNOW 2.0, later to become the 3G mobile standard SNOW 3G. We discuss how new cryptanalytic tools, most notably algebraic cryptanalysis, reshaped design principles in modern ciphers, and review some of the eSTREAM submissions.<br/> In the second part of this talk, we focus on the cryptanalysis of one of the eSTREAM finalists, Moustique. We give a step-by-step overview of our attack that allows to recover the full 96-bit key in 2^{38} steps, using related keys, and allows to speed up exhaustive search in the standard case (without related keys) by a factor 28. Here, we invite the audience to interact, identify weaknesses that lead to the break and propose tweaks to thwart the attack. Cryptanalysis of Moustique is joint work with Vincent Rijmen, Tor E. Bjorstad, Christian Rechberger, Matt Robshaw and Gautham Sekar.
Next sessions
-
Some applications of linear programming to Dilithium
Speaker : Paco AZEVEDO OLIVEIRA - Thales & UVSQ
Dilithium is a signature algorithm, considered post-quantum, and recently standardized under the name ML-DSA by NIST. Due to its security and performance, it is recommended in most use cases. During this presentation, I will outline the main ideas behind two studies, conducted in collaboration with Andersson Calle-Vierra, Benoît Cogliati, and Louis Goubin, which provide a better understanding of[…] -
Wagner’s Algorithm Provably Runs in Subexponential Time for SIS^∞
Speaker : Johanna Loyer - Inria Saclay
At CRYPTO 2015, Kirchner and Fouque claimed that a carefully tuned variant of the Blum-Kalai-Wasserman (BKW) algorithm (JACM 2003) should solve the Learning with Errors problem (LWE) in slightly subexponential time for modulus q = poly(n) and narrow error distribution, when given enough LWE samples. Taking a modular view, one may regard BKW as a combination of Wagner’s algorithm (CRYPTO 2002), run[…]-
Cryptography
-
-
CryptoVerif: a computationally-sound security protocol verifier
Speaker : Bruno Blanchet - Inria
CryptoVerif is a security protocol verifier sound in the computational model of cryptography. It produces proofs by sequences of games, like those done manually by cryptographers. It has an automatic proof strategy and can also be guided by the user. It provides a generic method for specifying security assumptions on many cryptographic primitives, and can prove secrecy, authentication, and[…]-
Cryptography
-
-
Structured-Seed Local Pseudorandom Generators and their Applications
Speaker : Nikolas Melissaris - IRIF
We introduce structured‑seed local pseudorandom generators (SSL-PRGs), pseudorandom generators whose seed is drawn from an efficiently sampleable, structured distribution rather than uniformly. This seemingly modest relaxation turns out to capture many known applications of local PRGs, yet it can be realized from a broader family of hardness assumptions. Our main technical contribution is a[…]-
Cryptography
-