Name
Abstract | ||
|---|---|---|
We analyze the security of the Thorp shuffle, or, equivalently, a maximally unbalanced Feistel network. Roughly said, the Thorp shuffle on N cards mixes any N 1 驴 1/r of them in $O(r\lg N)$ steps. Correspondingly, making O(r) passes of maximally unbalanced Feistel over an n-bit string ensures CCA-security to 2 n(1 驴 1/r) queries. Our results, which employ Markov-chain techniques, enable the construction of a practical and provably-secure blockcipher-based scheme for deterministically enciphering credit card numbers and the like using a conventional blockcipher. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/978-3-642-03356-8_17 | CRYPTO |
Keywords | Field | DocType |
provably-secure blockcipher-based scheme,encipher messages,deterministically enciphering credit card,markov-chain technique,feistel network,lg n,n card,thorp shuffle,n-bit string,small domain,conventional blockcipher,maximally unbalanced feistel,provable security,markov chain | Total variation,Pseudorandom function family,Discrete mathematics,Round function,Computer science,Format-preserving encryption,Credit card,Theoretical computer science | Conference |
Citations | PageRank | References |
47 | 2.10 | 22 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ben Morris | 1 | 127 | 8.78 |
| Phillip Rogaway | 2 | 10591 | 920.07 |
| Till Stegers | 3 | 126 | 7.41 |