How to Enrich the Message Space of a Cipher

DOI10.1007/978-3-540-74619-5_7MaRDI QIDQ3524884zbMATH OpenOpenAlexWikidataFDO

Authors 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

deterministic encryptionenciphering schemelength-preserving encryptionmultipermutationsymmetric encryption

Mathematics Subject Classification ID

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

Recommendations

• Towards restricting plaintext space in public key encryption
• Cryptanalysis of Enhanced MORE
• scientific article; zbMATH DE number 2085419
• Enhanced chosen-ciphertext security and applications
• Efficient key dependent message security amplification against chosen ciphertext attacks
• Tweaking Even-Mansour ciphers
• Length-doubling ciphers and tweakable ciphers
• scientific article; zbMATH DE number 1583788
• Amplification of Chosen-Ciphertext Security
• scientific article; zbMATH DE number 1951605

Cited in

(10)

• Generalized mix functions and orthogonal equitable rectangles
• The existence of generalized mix functions
• On orthogonal generalized equitable rectangles
• Quantum algorithms for the \(k\)-XOR problem
• Balanced equi-n-squares
• Online ciphers from tweakable blockciphers
• Building blockcipher from tweakable blockcipher: extending FSE 2009 proposal
• scientific article; zbMATH DE number 2079924 (Why is no real title available?)
• Diagonally cyclic equitable rectangles
• How to Build a Hash Function from Any Collision-Resistant Function

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3524884)