Concept
Caesar cipher
Related publications (23)
Melting SNOW-V: improved lightweight architectures
Andrea Felice Caforio, Subhadeep Banik, Muhammed Fatih Balli
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 ...
2020Cryptanalysis 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-SICHERHEIT2020A Study of Persistent Fault Analysis
Andrea Felice Caforio, Subhadeep Banik
Persistent faults mark a new class of injections that perturb lookup tables within block ciphers with the overall goal of recovering the encryption key. Unlike earlier fault types persistent faults remain intact over many encryptions until the affected dev ...
Springer2019On Design of Robust Lightweight Stream Cipher with Short Internal State
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 ...
2018Can Caesar Beat Galois?
The Competition for Authenticated Encryption: Security, Applicability and Robustness (CAESAR) has as its official goal to “identify a portfolio of authenticated ciphers that offer advantages over [the Galois-Counter Mode with AES]” and are suitable for wid ...
2018Some Cryptanalytic Results on Lizard
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 ...
2017Protecting against Multidimensional Linear and Truncated Differential Cryptanalysis by Decorrelation
The decorrelation theory provides a different point of view on the security of block cipher primitives. Results on some statistical attacks obtained in this context can support or provide new insight on the security of symmetric cryptographic primitives. I ...
Springer-Verlag Berlin2015Revisiting 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 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