| 模2n加的异或差分概率的快速计算方法 |
| |
| 引用本文： | 张庆贵.模2n加的异或差分概率的快速计算方法[J].计算机工程,2010,36(2):150-151. |
| |
| 作者姓名： | 张庆贵 |
| |
| 作者单位： | 解放军信息工程大学电子技术学院,郑州,450004 |
| |
| 基金项目： | 河南省杰出青年科学基金资助项目(0312001800) |
| |
| 摘 要： | 分析模2n加变换的异或差分概率计算算法的计算复杂性，利用以空间换时间的思想，将该算法中的矩阵乘积运算预先计算并予以存储，从而以查表运算替代多个矩阵乘积运算等方法对模2n加变换的异或差分概率计算算法进行改进，改进后算法的计算复杂性小于现有方法计算复杂性的7.7%。
|
| 关 键 词： | 模2n加 异或差分概率 快速计算 |
| 修稿时间： | |
Fast Computing Method to XOR Differential Probability of Addition Modulo 2~n |
| |
| ZHANG Qing-gui.Fast Computing Method to XOR Differential Probability of Addition Modulo 2~n[J].Computer Engineering,2010,36(2):150-151. |
| |
| Authors: | ZHANG Qing-gui |
| |
| Affiliation: | (Institute of Electronic Technology, PLA Information Engineering University, Zhengzhou 450004) |
| |
| Abstract: | This paper analyzes the computational complexity of the algorithm for computing the XOR differential probability of addition modulo 2n. With the idea of time-memory trade-off, by computing and storing the products of matrices algorithm in advance, and replacing the computing of matrices products with looking up tables, it improves the computing algorithm. The computational complexity of new algorithm is less than 7.7% times of that of the existing method. |
| |
| Keywords: | additional modulo 2n XOR differential probability fast computing |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程》浏览原始摘要信息 |
|
点击此处可从《计算机工程》下载全文 |
