Concept
Running key cipher
Related publications (23)
Near Collision Attack Against Grain V1
Daniel Patrick Collins, Subhadeep Banik, Willi Meier
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 ...
2023Cryptanalysis 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 ...
RUHR-UNIV BOCHUM, HORST GORTZ INST IT-SICHERHEIT2020Misuse Attacks on Post-quantum Cryptosystems
Serge Vaudenay, Loïs Evan Huguenin-Dumittan, Abdullah Talayhan, Fatma Betül Durak, Ciprian Baetu
Many post-quantum cryptosystems which have been proposed in the National Institute of Standards and Technology (NISI) standardization process follow the same meta-algorithm, but in different algebras or different encoding methods. They usually propose two ...
SPRINGER INTERNATIONAL PUBLISHING AG2019Algebraic Cryptanalysis of Deterministic Symmetric Encryption
Deterministic symmetric encryption is widely used in many cryptographic applications. The security of deterministic block and stream ciphers is evaluated using cryptanalysis. Cryptanalysis is divided into two main categories: statistical cryptanalysis and ...
EPFL2015Efficient Recursive Diffusion Layers for Block Ciphers, and Hash Functions
Many modern block ciphers use maximum distance separable (MDS) matrices as the main part of their diffusion layers. In this paper, we propose a very efficient new class of diffusion layers constructed from several rounds of Feistel-like structures whose ro ...
Springer2015Revisiting Iterated Attacks in the Context of Decorrelation Theory
Serge Vaudenay, Atefeh Mashatan, Asli Bay
Iterated attacks are comprised of iterating adversaries who can make d plaintext queries, in each iteration to compute a bit, and are trying to distinguish between a random cipher C and the perfect cipher C* based on all bits. Vaudenay showed that a 2d-dec ...
2014Resistance against Adaptive Plaintext-Ciphertext Iterated Distinguishers
Serge Vaudenay, Atefeh Mashatan, Asli Bay
Decorrelation Theory deals with general adversaries who are mounting iterated attacks, i.e., attacks in which an adversary is allowed to make d queries in each iteration with the aim of distinguishing a random cipher C from the ideal random cipher C^*. A b ...
2012Resistance Against Iterated Attacks by Decorrelation Revisited
Serge Vaudenay, Atefeh Mashatan, Asli Bay
Iterated attacks are comprised of iterating adversaries who can make plaintext queries, in each iteration to compute a bit, and are trying to distinguish between a random cipher and the ideal random cipher based on all bits. In EUROCRYPT '99, ...
Springer2012