FR-FPE:有限基保留格式加密算法OA
FR-FPE:finite radix oriented format-preserving encryption algorithm
针对现有保留格式加密算法难以应对滑动关联及线性密码分析攻击且效率不高的问题,提出了有限基保留格式加密FR-FPE算法.通过设计基于CBC模式的参数向量加密机制和结构化调整参数全关联加密模型,有效抵御滑动关联及线性密码分析攻击.通过设计轻量化确定性加密结构,支持对不超过192 bit的明文和96 bit的调整参数进行加密,在保证算法与NIST FF1相同安全强度的同时,分组加密的调用次数比FF1减少45%(9次).基于Game-Hopping博弈模型,给出了FR-FPE算法强伪随机置换(SPRP)安全性证明,并量化分析了算法抵御滑动关联及线性密码分析攻击的能力.实验结果表明,针对radix=36的数字字母混合数据集,FR-FPE的每秒加密次数比FF1平均高26.55%,加密数据吞吐率平均高21.25%.
Existing format-preserving encryption algorithms were vulnerable to slide attack and linear cryptanalysis at-tack,and had low efficiency.A finite radix oriented format-preserving encryption(FR-FPE)algorithm was proposed.It designed a CBC mode based on initial vector encryption mechanism and a fully associated encryption model with struc-tured tweak parameters,which could effectively defend against slide attack and linear cryptanalysis attack.A lightweight and deterministic encryption structure was designed to support plaintexts up to 192 bit and tweak parameters up to 96 bit.While ensuring the same security strength as NIST FF1,the number of block encryption calls was reduced by 45%(9 times)compared with FF1.Based on the Game-Hopping game model,the security proof of strong pseudorandom permu-tation(SPRP)for the FR-FPE algorithm was given,and the ability of the algorithm to resist sliding attacks and linear cryptanalytic attacks was quantitatively analyzed.Experimental results show that for a mixed alphanumeric dataset with radix=36,FR-FPE achieves an average increase of 26.55%in encryption times per second and 21.25%in encrypted data throughput compared to FF1.
王小峰;叶军;刘文正;孙兵;吴华晖;郭佳朴
国防科技大学计算机学院,湖南 长沙 410073湖南安方信息技术有限公司,湖南 长沙 410221长沙理工大学计算机学院,湖南 长沙 410015国防科技大学理学院,湖南 长沙 410073湖南省农村信用社联合社,湖南 长沙 410013国防科技大学计算机学院,湖南 长沙 410073
信息技术与安全科学
保留格式加密滑动关联攻击线性密码分析攻击强伪随机置换
format-preserving encryptionslide attacklinear cryptanalysis attackSPRP
《通信学报》 2026 (4)
54-66,13
评论