Tittel: Provable security of authenticated encryption schemes

Veileder: Jiaxin Pan

Sammendrag: This bachelor thesis studies the provable security of the randomized counter mode (RCM) and the Galois counter mode (GCM). This is done by making use of sequences of games to structure our proofs. We will prove that the randomized counter mode is CPA-secure under the PRF assumption, and we will prove that the GCM is nonce-based AEAD-secure under the assumption that the underlying block cipher is a secure PRF and that the keyed hash function GHASH is an XOR-DUF.