An Enciphering Scheme Based on a Card Shuffle

  • Viet Tung Hoang
  • Ben Morris
  • Phillip Rogaway
Conference paper

DOI: 10.1007/978-3-642-32009-5_1

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7417)
Cite this paper as:
Hoang V.T., Morris B., Rogaway P. (2012) An Enciphering Scheme Based on a Card Shuffle. In: Safavi-Naini R., Canetti R. (eds) Advances in Cryptology – CRYPTO 2012. Lecture Notes in Computer Science, vol 7417. Springer, Berlin, Heidelberg

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.

Keywords

Blockciphers Feistel network Luby-Rackoff Markov chain PRF-to-PRP conversion pseudorandom permutations swap-or-not 
Download to read the full conference paper text

Copyright information

© International Association for Cryptologic Research 2012 2012

Authors and Affiliations

  • Viet Tung Hoang
    • 1
  • Ben Morris
    • 2
  • Phillip Rogaway
    • 1
  1. 1.Dept. of Computer ScienceUniversity of CaliforniaDavisUSA
  2. 2.Dept. of MathematicsUniversity of CaliforniaDavisUSA

Personalised recommendations