Format-preserving encryption algorithms using families of tweakable blockciphers

6Citations
Citations of this article
18Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present two new algorithms, FEA-1 and FEA-2, for secure and efficient format-preserving encryption. Each algorithm is built from a family of dedicated tweakable blockciphers supporting various block bit-lengths. The tweakable blockciphers in the same family have similar structures and are based on common building blocks, enabling security analyses in the same frameworks. Their security follows largely from the structures, the round functions, and the tweak schedules. Their structures are new tweakable Feistel schemes, which are shown to be indistinguishable from tweakable random permutations against adaptive chosen tweak, plaintext, and ciphertext attacks. Their building blocks are shown to have cryptographically strong properties. The proposed algorithms outperform existing ones. They are several times faster than FF1-AES on test platforms.

Cite

CITATION STYLE

APA

Lee, J. K., Koo, B., Roh, D., Kim, W. H., & Kwon, D. (2014). Format-preserving encryption algorithms using families of tweakable blockciphers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8949, pp. 132–159). Springer Verlag. https://doi.org/10.1007/978-3-319-15943-0_9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free