Name
Abstract | ||
|---|---|---|
We introduce the swap-or-not shuffle and show that the technique gives rise to a new method to convert a pseudorandom function (PRF) into a pseudorandom permutation (PRP) (or, alternatively, to directly build a confusion/diffusion blockcipher). We then prove that swap-or-not has excellent quantitative security bounds, giving a Luby-Rackoff type result that ensures security (assuming an ideal round function) to a number of adversarial queries that is nearly the size of the construction's domain. Swap-or-not provides a direct solution for building a small-domain cipher and achieving format-preserving encryption, yielding the best bounds known for a practical scheme for enciphering credit-card numbers. The analysis of swap-or-not is based on the theory of mixing times of Markov chains. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/978-3-642-32009-5_1 | ADVANCES IN CRYPTOLOGY - CRYPTO 2012 |
Keywords | DocType | Volume |
Blockciphers,Feistel network,Luby-Rackoff,Markov chain,PRF-to-PRP conversion,pseudorandom permutations,swap-or-not | Conference | 7417 |
ISSN | Citations | PageRank |
0302-9743 | 24 | 1.20 |
References | Authors | |
20 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Viet Tung Hoang | 1 | 468 | 19.15 |
| Ben Morris | 2 | 127 | 8.78 |
| Phillip Rogaway | 3 | 10591 | 920.07 |