Deterministic encryption with the Thorp shuffle

DOI10.1007/S00145-017-9262-ZMaRDI QIDQ1753170zbMATH OpenOpenAlexWikidataFDO

Authors Ben Morris, Phillip Rogaway, Till Stegers

Publication date 28 May 2018

Published in Journal of Cryptology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00145-017-9262-z

zbMATH Keywords

card shufflingcouplingsymmetric encryptionmodes of operationformat-preserving encryptionThorp shuffleunbalanced Feistel network

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Cryptography (94A60)

Recommendations

• How to Encipher Messages on a Small Domain
• An enciphering scheme based on a card shuffle
• Improved mixing time bounds for the Thorp shuffle
• Thorp shuffling, butterflies, and non-Markovian couplings
• Partition and mix: generalizing the swap-or-not shuffle

Cites work

• scientific article; zbMATH DE number 1583802 (Why is no real title available?)
• scientific article; zbMATH DE number 1942411 (Why is no real title available?)
• scientific article; zbMATH DE number 2009979 (Why is no real title available?)
• scientific article; zbMATH DE number 2042290 (Why is no real title available?)
• scientific article; zbMATH DE number 2079924 (Why is no real title available?)
• scientific article; zbMATH DE number 2081068 (Why is no real title available?)
• scientific article; zbMATH DE number 4185033 (Why is no real title available?)
• A Proof of Security in O(2 n ) for the Benes Scheme
• Advances in Cryptology - CRYPTO 2003
• Advances in Cryptology – CRYPTO 2004
• An asymptotically tight security analysis of the iterated Even-Mansour cipher
• An enciphering scheme based on a card shuffle
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
• Fast generation of random permutations via networks simulation
• Foiling birthday attacks in length-doubling transformations
• Format-preserving encryption
• How to Construct Pseudorandom Permutations from Pseudorandom Functions
• How to Encipher Messages on a Small Domain
• Improved mixing time bounds for the Thorp shuffle
• Improved mixing time bounds for the Thorp shuffle and \(L\)-reversal chain
• Indistinguishability Amplification
• Linear Cryptanalysis of Non Binary Ciphers
• Mathematical aspects of mixing times in Markov chains.
• Nonrandom Shuffling with Applications to the Game of Faro
• On generalized Feistel networks
• On the construction of pseudorandom permutations: Luby-Rackoff revisited
• Perfect Block Ciphers with Small Blocks
• Pseudorandom Permutation Families over Abelian Groups
• Robust authenticated-encryption AEZ and the problem that it solves
• Sometimes-recurse shuffle. Almost-random permutations in logarithmic expected time
• The Mixing Time of the Thorp Shuffle
• The mix-and-cut shuffle: small-domain encryption secure against \(N\) queries
• Unbalanced Feistel networks and block cipher design

Cited in

(7)

• scientific article; zbMATH DE number 5773656 (Why is no real title available?)
• Partition and mix: generalizing the swap-or-not shuffle
• Format-preserving encryption: a survey
• How to Encipher Messages on a Small Domain
• Mitigation Techniques for Attacks on 1-Dimensional Databases that Support Range Queries
• An enciphering scheme based on a card shuffle
• Revisiting linearly extended discrete functions

This page was built for publication: Deterministic encryption with the Thorp shuffle

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