韦永壮2,,,
刘争红1
1.桂林电子科技大学认知无线电与信息处理省部共建教育部重点实验室 桂林 541004
2.桂林电子科技大学广西密码学与信息安全重点实验室 桂林 541004
3.桂林电子科技大学数学与计算科学学院 桂林 541004
基金项目:国家自然科学基金(61572148, 61872103)，广西科技计划项目基金(桂科AB18281019)，广西自然科学基金(2017GXNSFBA198056)，认知无线电与信息处理省部共建教育部重点实验室主任基金(CRKL180107)，广西密码学与信息安全重点实验室基金(GCIS201706)
详细信息
作者简介:赵海霞：女，1981年生，博士生，研究方向为密码函数、分组密码分析
韦永壮：男，1976年生，教授，博士生导师，研究方向为密码函数、分组密码分析
刘争红：男，1979年生，高级实验师，硕士生导师，研究方向为通信信息安全
通讯作者:韦永壮 walker_wyz@guet.edu.cn
中图分类号:TN918.2; TP309计量
文章访问数:1620
HTML全文浏览量:518
PDF下载量:40
被引次数:0
出版历程
收稿日期:2019-07-10
修回日期:2020-03-08
网络出版日期:2020-03-20
刊出日期:2020-07-23
A Variant BISON Block Cipher Algorithm and Its Analysis
Haixia ZHAO1, 2, 3,Yongzhuang WEI2,,,
Zhenghong LIU1
1. Key Laboratory of Cognitive Radio and Information Processing, Ministry of Education, Guilin University of Electronic Technology, Guilin 541004, China
2. Guangxi Key Laboratory of Cryptography and Information Security, Guilin University of Electronic Technology, Guilin 541004, China
3. School of Mathematics and Computational Science, Guilin University of Electronic Technology, Guilin 541004, China
Funds:The National Natural Science Foundation of China (61572148, 61872103), The Foundation of Guangxi Science and Technology Program (Guike AB18281019). The Natural Science Foundation of Guangxi (2017GXNSFBA198056), The Foundation of Key Laboratory of Cognitive Radio and Information Processing, Ministry of Education (Guilin University of Electronic Technology) (CRKL180107), The Foundation of Guangxi Key Laboratory of Cryptography and Information Security (GCIS201706)
摘要
摘要:该文基于Whitened Swap?or?Not(WSN)的结构特点，分析了Canteaut 等人提出的Bent whItened Swap Or Not –like (BISON-like) 算法的最大期望差分概率值(MEDP)及其(使用平衡函数时)抵御线性密码分析的能力；针对BISON算法迭代轮数异常高(一般为3n轮，n为数据分组长度)且密钥信息的异或操作由不平衡Bent函数决定的情况，该文采用了一类较小绝对值指标、高非线性度、较高代数次数的平衡布尔函数替换BISON算法中的Bent函数，评估了新变体BISON算法抵御差分密码分析和线性密码分析的能力。研究结果表明：新的变体BISON算法仅需迭代n轮；当n较大时(如n=128或256)，其抵御差分攻击和线性攻击的能力均接近理想值。且其密钥信息的异或操作由平衡函数来决定，故具有更好的算法局部平衡性。
关键词:差分密码分析/
线性密码分析/
WSN结构/
BISON-like分组密码算法/
变体BISON分组密码算法
Abstract:Based on the characteristics of Whitened Swap?or?Not (WSN) construction, the maximum expected differential probability (MEDP) of Bent whItened Swap Or Not -like (BISON-like) algorithm proposed by Canteaut et al. is analyzed in this paper. In particular, the ability of BISON-like algorithm with balanced nonlinear components against linear cryptanalysis is also investigated. Notice that the number of iteration rounds of BISON algorithm is rather high (It needs usually to iterate 3n rounds, n is the block length of data) and Bent function (unbalanced) is directly used to XOR with the secret key bits. In order to overcome these shortcomings, a kind of balanced Boolean functions that has small absolute value indicator, high nonlinearity and high algebraic degree is selected to replace the Bent functions used in BISON algorithm. Moreover, the abilities of this new variant BISON algorithm against both the differential cryptanalysis and the linear cryptanalysis are estimated. It is shown that the new variant BISON algorithm only needs to iterate n-round function operations; If n is relative large (e.g. n=128 or n=256), Its abilities against both the differential cryptanalysis and the linear cryptanalysis almost achieve ideal value. Furthermore, due to the balanced function is directly XORed with the secret key bits of the variant algorithm, it attains a better local balance indeed.
Key words:Differential cryptanalysis/
Linear cryptanalysis/
Whitened Swap-Or-Not construction/
Bent whItened Swap Or Not -like block cipher algorithm/
Variant BISON block cipher algorithm
PDF全文下载地址:
https://jeit.ac.cn/article/exportPdf?id=0e2d2d95-6cbb-4098-8076-0e2c3fab30b2
