"Format preserving sets: On diffusion layers of format preserving encry" by Kishan Chand Gupta, Sumit Kumar Pandey et al.
 

Format preserving sets: On diffusion layers of format preserving encryption schemes

Document Type

Conference Article

Publication Title

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Abstract

Format preserving encryption refers to a set of techniques for encrypting data such that the ciphertext has the same format as the plaintext. Here, we consider the design of diffusion layers only which can be defined by, in general, a linear transformation. In this paper, we study and explore the format preserving diffusion layers, in particular, the relationship between the n × n diffusion matrix M over the field Fq and the format preserving set S ⊆Fq such that whenever v ∈ Sn, Mv ∈ Sn. It is proved in this paper that if such a set S with respect to a certain type of matrix M contains 0 ∈ Fq, then it is always a vector space over the smallest field containing entries of M. Moreover, some more interesting results are found when this condition, 0 ∈ S, is relaxed. We illustrate our results by a credit card example where plaintext and ciphertext both come from the set {0, · · ·, 9}. We further show that only certain type of 4 × 4 matrices over the field F 24 can be constructed which yield a format preserving set of cardinality 10 which is suited for our credit card example. However, to the best of our knowledge, such matrices do not have any cryptographic significance. Thus, it is impossible to construct any cryptographically significant 4 × 4 matrices over the field F24 in the diffusion layer which yields a format preserving set of cardinality 10.

First Page

411

Last Page

428

DOI

10.1007/978-3-319-49890-4_23

Publication Date

1-1-2016

Link to Full Text

Share

COinS