Leakage-resilient riffle shuffle

DOI10.1007/978-3-319-72453-9_32MaRDI QIDQ4628511zbMATH OpenOpenAlexFDO

Authors Paweł Lorek, Michal Kulis, Filip Zagórski

Publication date 14 March 2019

Published in Mathematical Aspects of Computer and Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-72453-9_32

zbMATH Keywords

card shuffledistinguisherleakage resilienceMarkov chainsmixing timepseudo-random permutation generatorriffle shufflestream cipher

Mathematics Subject Classification ID

Combinatorial probability (60C05) Cryptography (94A60)

Recommendations

• Improved mixing time bounds for the Thorp shuffle
• Sometimes-recurse shuffle. Almost-random permutations in logarithmic expected time
• An enciphering scheme based on a card shuffle
• Rapid mixing of dealer shuffles and clumpy shuffles
• Information Loss in Riffle Shuffling

Cited in

(6)

• Rifflescrambler -- a memory-hard password storing function
• Randomized stopping times and provably secure pseudorandom permutation generators
• Leakage-Resilient Coin Tossing
• Anonymous card shuffling and its applications to parallel mixnets
• Sometimes-recurse shuffle. Almost-random permutations in logarithmic expected time
• Shuffle invariance of the super-RSK algorithm

This page was built for publication: Leakage-resilient riffle shuffle

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