Partition and mix: generalizing the swap-or-not shuffle

DOI10.1007/S10623-023-01199-4zbMATH Open1515.94076MaRDI QIDQ6041586FDOQ6041586

Authors: Nam-Su Jho, Jooyoung Lee 

Publication date: 31 May 2023

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Recommendations

• An enciphering scheme based on a card shuffle
• The mix-and-cut shuffle: small-domain encryption secure against \(N\) queries
• How to Encipher Messages on a Small Domain
• Sometimes-recurse shuffle. Almost-random permutations in logarithmic expected time
• Deterministic encryption with the Thorp shuffle

zbMATH Keywords

block cipherindistinguishabilityformat preserving encryptioncard shuffle

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• A construction of a cipher from a single pseudorandom permutation.
• Tight security bounds for key-alternating ciphers
• Nonrandom Shuffling with Applications to the Game of Faro
• Advances in Cryptology – CRYPTO 2004
• Advances in Cryptology - CRYPTO 2003
• Indistinguishability Amplification
• The SKINNY Family of Block Ciphers and Its Low-Latency Variant MANTIS
• Sometimes-recurse shuffle. Almost-random permutations in logarithmic expected time
• How to Encipher Messages on a Small Domain
• Format-preserving encryption
• A domain extender for the ideal cipher
• An enciphering scheme based on a card shuffle
• The mix-and-cut shuffle: small-domain encryption secure against \(N\) queries

Cited In (5)

• Sometimes-recurse shuffle. Almost-random permutations in logarithmic expected time
• The mix-and-cut shuffle: small-domain encryption secure against \(N\) queries
• Deterministic encryption with the Thorp shuffle
• How to Encipher Messages on a Small Domain
• An enciphering scheme based on a card shuffle

This page was built for publication: Partition and mix: generalizing the swap-or-not shuffle

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