An Enciphering Scheme Based on a Card Shuffle

DOI10.1007/978-3-642-32009-5_1zbMath1294.94052arXiv1208.1176OpenAlexW1531712325MaRDI QIDQ2914246

Viet Tung Hoang, Ben Morris, Phillip Rogaway

Publication date: 25 September 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1208.1176

zbMATH Keywords

Markov chainFeistel networkpseudorandom permutationsLuby-RackoffblockciphersPRF-to-PRP conversionswap-or-not

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (11)

eSPF: A Family of Format-Preserving Encryption Algorithms Using MDS Matrices ⋮ Compact proofs of retrievability ⋮ Format-Preserving Encryption Algorithms Using Families of Tweakable Blockciphers ⋮ Several proofs of security for a tokenization algorithm ⋮ Partition and mix: generalizing the swap-or-not shuffle ⋮ Targeted invertible pseudorandom functions and deterministic format-transforming encryption ⋮ Impossibility of indifferentiable iterated blockciphers from 3 or less primitive calls ⋮ Hardness-preserving reductions via cuckoo hashing ⋮ Reverse Cycle Walking and Its Applications ⋮ Targeted ciphers for format-preserving encryption ⋮ Deterministic encryption with the Thorp shuffle

This page was built for publication: An Enciphering Scheme Based on a Card Shuffle