Format-Preserving Encryption

  • Authors:
  • Mihir Bellare;Thomas Ristenpart;Phillip Rogaway;Till Stegers

  • Affiliations:
  • Dept. of Computer Science & Engineering, UC San Diego, La Jolla, USA 92093;Dept. of Computer Science & Engineering, UC San Diego, La Jolla, USA 92093;Dept. of Computer Science, UC Davis, Davis, USA 95616;Dept. of Computer Science, UC Davis, Davis, USA 95616

  • Venue:
  • Selected Areas in Cryptography
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Format-preserving encryption (FPE) encrypts a plaintext of some specified format into a ciphertext of identical format--for example, encrypting a valid credit-card number into a valid credit-card number. The problem has been known for some time, but it has lacked a fully general and rigorous treatment. We provide one, starting off by formally defining FPE and security goals for it. We investigate the natural approach for achieving FPE on complex domains, the "rank-then-encipher" approach, and explore what it can and cannot do. We describe two flavors of unbalanced Feistel networks that can be used for achieving FPE, and we prove new security results for each. We revisit the cycle-walking approach for enciphering on a non-sparse subset of an encipherable domain, showing that the timing information that may be divulged by cycle walking is not a damaging thing to leak.