On Diffusion Layers of SPN Based Format Preserving Encryption Schemes: Format Preserving Sets Revisited

被引:1
作者
Barua, Rana [1 ]
Gupta, Kishan Chand [2 ]
Pandey, Sumit Kumar [3 ]
Ray, Indranil Ghosh [4 ]
机构
[1] Indian Stat Inst, RC Bose Ctr Cryptol & Secur, 203 BT Rd, Kolkata 700108, India
[2] Indian Stat Inst, Appl Stat Unit, 203 BT Rd, Kolkata 700108, India
[3] Ashoka Univ, Sonepat, Haryana, India
[4] City Univ London, Dept Elect & Elect Engn, London, England
来源
PROGRESS IN CRYPTOLOGY, INDOCRYPT 2018 | 2018年 / 11356卷
关键词
Diffusion layer; Format preserving encryption; Format preserving set; CONSTRUCTION;
D O I
10.1007/978-3-030-05378-9_5
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In Inscrypt 2016, Chang et al. proposed a new family of substitution-permutation (SPN) based format preserving encryption algorithms in which a non-MDS (Maximum Distance Separable) matrix was used in its diffusion layer. In the same year in Indocrypt 2016 Gupta et al., in their attempt to provide a reason for choosing non-MDS over MDS matrices, introduced an algebraic structure called format preserving sets (FPS). They formalised the notion of this structure with respect to a matrix both of whose elements are coming from some finite field F-q. Many interesting properties of format preserving sets S subset of F-q with respect to a matrix M(F-q) were derived. Nevertheless, a complete characterisation of such sets could not be derived. In this paper, we fill that gap and give a complete characterisation of format preserving sets when the underlying algebraic structure is a finite field. Our results not only generalise and subsume those of Gupta et al., but also obtain some of these results over a more generic algebraic structure viz. ring R. We obtain a complete characterisation of format preserving sets over rings when the sets are closed under addition. Finally, we provide examples of format preserving sets of cardinalities 103 and 263 with respect to 4 x 4 MDS matrices over some rings which are not possible over any finite field.
引用
收藏
页码:91 / 104
页数:14
相关论文
共 16 条
[1]  
[Anonymous], 1978, The Theory of Error-Correcting Codes
[2]  
Bellarc M, 2009, LECT NOTES COMPUT SC, V5867, P295, DOI 10.1007/978-3-642-05445-7_19
[3]  
Bellare M, 1999, LECT NOTES COMPUT SC, V1636, P231
[4]  
Black J., 2002, Topics in Cryptology - CT-RSA 2002. Cryptographers' Track at the RSA Conference 2002. Proceedings (Lecture Notes in Computer Science Vol.2271), P114
[5]  
Brightwell M., 1997, 20 NISSC P, P141
[6]  
Donghoon Chang, 2017, Information Security and Cryptology. 12th International Conference, Inscrypt 2016. Revised Selected Papers: LNCS 10143, P64, DOI 10.1007/978-3-319-54705-3_5
[7]  
Grillet P., 1995, SEMIGROUPS INTRO STR
[8]   Towards a general construction of recursive MDS diffusion layers [J].
Gupta, Kishan Chand ;
Pandey, Sumit Kumar ;
Venkateswarlu, Ayineedi .
DESIGNS CODES AND CRYPTOGRAPHY, 2017, 82 (1-2) :179-195
[9]   Format Preserving Sets: On Diffusion Layers of Format Preserving Encryption Schemes [J].
Gupta, Kishan Chand ;
Pandey, Sumit Kumar ;
Ray, Indranil Ghosh .
PROGRESS IN CRYPTOLOGY - INDOCRYPT 2016, 2016, 10095 :411-428
[10]  
Halevi S, 2004, LECT NOTES COMPUT SC, V2964, P292