The mix-and-cut shuffle: small-domain encryption secure against N queries

DOI10.1007/978-3-642-40041-4_22MaRDI QIDQ2845685zbMATH OpenOpenAlexFDO

Authors Thomas Ristenpart, Scott Yilek

Publication date 2 September 2013

Published in Advances in Cryptology – CRYPTO 2013 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-40041-4_22

zbMATH Keywords

shufflestweakable block cipherssmall-block encryption

Mathematics Subject Classification ID

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

Recommendations

• An enciphering scheme based on a card shuffle
• Partition and mix: generalizing the swap-or-not shuffle
• How to Encipher Messages on a Small Domain
• Sometimes-recurse shuffle. Almost-random permutations in logarithmic expected time
• Targeted ciphers for format-preserving encryption

Cited in

(14)

• eSPF: A Family of Format-Preserving Encryption Algorithms Using MDS Matrices
• Reverse cycle walking and its applications
• Modifying an enciphering scheme after deployment
• Deterministic encryption with the Thorp shuffle
• Partition and mix: generalizing the swap-or-not shuffle
• Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time
• Perfect Block Ciphers with Small Blocks
• How to Encipher Messages on a Small Domain
• Efficient pre-processing PIR without public-key cryptography
• Hardness-preserving reductions via cuckoo hashing
• Targeted ciphers for format-preserving encryption
• An enciphering scheme based on a card shuffle
• Format-preserving encryption algorithms using families of tweakable blockciphers
• Cycle slicer: an algorithm for building permutations on special domains

This page was built for publication: The mix-and-cut shuffle: small-domain encryption secure against \(N\) queries

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