首页 | 本学科首页   官方微博 | 高级检索  
     

模2~n减法最佳线性逼近研究
引用本文:薛帅,戚文峰. 模2~n减法最佳线性逼近研究[J]. 信息工程大学学报, 2013, 0(1): 1-6
作者姓名:薛帅  戚文峰
作者单位:信息工程大学网络空间安全学院
基金项目:国家自然科学基金资助项目(61070178)
摘    要:研究了模2n减法运算的最佳线性逼近问题。利用模2n加减法线性逼近相关值之间的关系,给出了模2n减法最佳线性逼近相关值的计算公式;构造了模2n减法最佳线性逼近集的递归算法。文章的研究从理论上更清楚地刻画了模2n减法最佳线性逼近的内在规律,有助于更好地利用该线性逼近关系实现对实际密码算法的有效分析。

关 键 词:密码学  相关值  最佳线性逼近  模2n减法

Research on the Best Linear Approximation of Subtraction Modulo 2~n
XUE Shuai,QI Wen-feng. Research on the Best Linear Approximation of Subtraction Modulo 2~n[J]. , 2013, 0(1): 1-6
Authors:XUE Shuai  QI Wen-feng
Affiliation:(Institute of Cyberspace Security,Information Engineering University,Zhengzhou 450001,China)
Abstract:The best linear approximation of subtraction modulo 2n is studied in this paper. Firstly, the formula for maximum correlations of subtraction modulo 2n is proposed by using the relation be- tween linear approximation of subtraction and addition modulo 2n. Moreover,a recursive algorithm to construct the best linear approximation set of subtraction modulo 2n is provided. The paper charac- terizes the inner principle of best linear approximation of subtraction modulo 2n theoretically,which will help to use the linear approximation relation to realize an effective analysis of cryptographic algo- rithms.
Keywords:cryptography  correlation  best linear approximation  subtraction modulo 2n
本文献已被 CNKI 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号