How to Enrich the Message Space of a Cipher

DOI10.1007/978-3-540-74619-5_7zbMath1186.94468OpenAlexW2135245935WikidataQ56475239 ScholiaQ56475239MaRDI QIDQ3524884

Thomas Ristenpart, Phillip Rogaway

Publication date: 16 September 2008

Published in: Fast Software Encryption (Search for Journal in Brave)

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

zbMATH Keywords

symmetric encryptiondeterministic encryptionmultipermutationenciphering schemelength-preserving encryption

Mathematics Subject Classification ID

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

Related Items (9)

Quantum algorithms for the \(k\)-XOR problem ⋮ Balanced equi-\(n\)-squares ⋮ How to Build a Hash Function from Any Collision-Resistant Function ⋮ Diagonally cyclic equitable rectangles ⋮ Online Ciphers from Tweakable Blockciphers ⋮ Generalized mix functions and orthogonal equitable rectangles ⋮ The existence of generalized mix functions ⋮ On orthogonal generalized equitable rectangles ⋮ Building Blockcipher from Tweakable Blockcipher: Extending FSE 2009 Proposal

This page was built for publication: How to Enrich the Message Space of a Cipher