Invertible Universal Hashing and the TET Encryption Mode

DOI10.1007/978-3-540-74143-5_23zbMath1215.94049OpenAlexW1525995698MaRDI QIDQ3612562

Shai Halevi

Publication date: 10 March 2009

Published in: Advances in Cryptology - CRYPTO 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74143-5_23

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (16)

Automated proofs of block cipher modes of operation ⋮ Improved security analysis for OMAC as a pseudorandom function ⋮ Beyond-birthday security for permutation-based Feistel networks ⋮ Another look at XCB ⋮ Tweakable enciphering schemes using only the encryption function of a block cipher ⋮ Packed multiplication: how to amortize the cost of side-channel masking? ⋮ An Improved Security Bound for HCTR ⋮ On the optimality of non-linear computations for symmetric key primitives ⋮ Breaking tweakable enciphering schemes using Simon's algorithm ⋮ Computationally sound implementations of equational theories against passive adversaries ⋮ Authenticated Encryption with Small Stretch (or, How to Accelerate AERO) ⋮ Revisiting construction of online cipher in hash-ECB-hash structure ⋮ \textsf{FAST}: disk encryption and beyond ⋮ Building Blockcipher from Tweakable Blockcipher: Extending FSE 2009 Proposal ⋮ A Domain Extender for the Ideal Cipher ⋮ Tweakable Pseudorandom Permutation from Generalized Feistel Structure

This page was built for publication: Invertible Universal Hashing and the TET Encryption Mode