Deterministic encryption with the Thorp shuffle
From MaRDI portal
Publication:1753170
DOI10.1007/s00145-017-9262-zzbMath1444.94092OpenAlexW2747244659WikidataQ123140182 ScholiaQ123140182MaRDI QIDQ1753170
Phillip Rogaway, Ben Morris, 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
couplingcard shufflingsymmetric encryptionmodes of operationformat-preserving encryptionThorp shuffleunbalanced Feistel network
Cryptography (94A60) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved mixing time bounds for the Thorp shuffle and \(L\)-reversal chain
- On the construction of pseudorandom permutations: Luby-Rackoff revisited
- Fast generation of random permutations via networks simulation
- The Mix-and-Cut Shuffle: Small-Domain Encryption Secure against N Queries
- Foiling Birthday Attacks in Length-Doubling Transformations
- An Enciphering Scheme Based on a Card Shuffle
- Robust Authenticated-Encryption AEZ and the Problem That It Solves
- How to Encipher Messages on a Small Domain
- A Proof of Security in O(2 n ) for the Benes Scheme
- Perfect Block Ciphers with Small Blocks
- On Generalized Feistel Networks
- Mathematical Aspects of Mixing Times in Markov Chains
- Indistinguishability Amplification
- Pseudorandom Permutation Families over Abelian Groups
- The Mixing Time of the Thorp Shuffle
- Format-Preserving Encryption
- How to Construct Pseudorandom Permutations from Pseudorandom Functions
- Unbalanced Feistel networks and block cipher design
- Improved Mixing Time Bounds for the Thorp Shuffle
- An Asymptotically Tight Security Analysis of the Iterated Even-Mansour Cipher
- Nonrandom Shuffling with Applications to the Game of Faro
- Advances in Cryptology – CRYPTO 2004
- Sometimes-Recurse Shuffle
- Advances in Cryptology - CRYPTO 2003
- Linear Cryptanalysis of Non Binary Ciphers
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
