Skip to Main content Skip to Navigation

Security of Modes of Operation and other provably secure cryptographic schemes

Abstract : This thesis is about symmetric, or private key, cryptography. It has a focus on modes of operation and, more generally, on all cryptographic schemes that admit a formal proof of security with an accent on the cryptanalysis of such constructions. There are multiple contributions shown in this work. Firstly, we show an attack that recovers a secret information that has been encrypted via the counter mode (CTR) with a total complexity close to the known distinguisher. We also mount the first non-trivial forgeries on a variety of MACs following the Double-block Hash-then-Sum construction and whose data complexity was later proved to be optimal. Then, we propose a new authenticated encryption scheme (ANYDAE) which is derived from MONDAE, and we prove its security under to a more robust security notion. As for other cryptographic schemes, we establish a link between the famous 3-XOR problem and the cryptanalysis of two rounds of the Even-Mansour construction which allows us to build new attacks that are especially competitive in terms of data and memory complexities. Finally, we show a generic cryptanalysis on the iterated tweakable FX strategy that notably proves the optimality of the XHX2 security proof.
Complete list of metadatas
Contributor : Ferdinand Sibleyras <>
Submitted on : Friday, January 22, 2021 - 12:03:04 PM
Last modification on : Saturday, January 23, 2021 - 3:29:45 AM


Files produced by the author(s)


  • HAL Id : tel-03058306, version 1


Ferdinand Sibleyras. Security of Modes of Operation and other provably secure cryptographic schemes. Computer Science [cs]. Sorbonne Université, 2020. English. ⟨tel-03058306⟩



Record views


Files downloads