Concept
Ciphertext
Related publications (25)
Secure and Efficient Cryptographic Algorithms in a Quantum World
Since the advent of internet and mass communication, two public-key cryptographic algorithms have shared the monopoly of data encryption and authentication: Diffie-Hellman and RSA. However, in the last few years, progress made in quantum physics -- and mor ...
EPFL2024Cryptanalysis 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-SICHERHEIT2020Analysis of the BIKE post-quantum cryptographic protocols and the Legendre pseudorandom function
The field of post-quantum cryptography studies cryptographic systems that are secure against an adversary in possession of a quantum computer. In 2017, the National Institute of Standards and Technology (NIST) initiated a process to standardize quantum-res ...
EPFL2020Time in cryptography
Time travel has always been a fascinating topic in literature and physics. In cryptography, one may wonder how to keep data confidential for some time. In this dissertation, we will study how to make private information travel to the future. This dissertat ...
EPFL2020Misuse 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 AG2019Cryptanalysis of ForkAES
Forkciphers are a new kind of primitive proposed recently by Andreeva et al. for efficient encryption and authentication of small messages. They fork the middle state of a cipher and encrypt it twice under two smaller independent permutations. Thus, forkci ...
2019Breaking the FF3 Format Preserving Encryption
Serge Vaudenay, Fatma Betül Durak
The NIST standard FF3 scheme (also known as BPS scheme) is a tweakable block cipher based on a 8-round Feistel Network. We break it with a practical attack. Our attack exploits the bad domain separation in FF3 design. The attack works with chosen plaintext ...
2017Breaking The FF3 Format-Preserving Encryption Standard Over Small Domains
Serge Vaudenay, Fatma Betül Durak
The National Institute of Standards and Technology (NIST) recently published a Format-Preserving Encryption standard accepting two Feistel structure based schemes called FF1 and FF3. Particularly, FF3 is a tweakable block cipher based on an 8-round Feistel ...
2017Cryptanalysis of a Homomorphic Encryption Scheme
Serge Vaudenay, Sonia Mihaela Bogos, John Gaspoz
Homomorphic encryption allows to make specific operations on private data which stays encrypted. While applications such as cloud computing require to have a practical solution, the encryption scheme must be secure. In this article, we detail and analyze i ...
2016Revisiting 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 ...
2014