Linear Approximations of Pseudo-Hadamard Transform  

作　　者：WANG Bin WU Chunming CHANG Yaqing 

机构地区：[1]Computer Science College,Zhejiang University,Hangzhou 310027,China

出　　处：《Chinese Journal of Electronics》2012年第4期715-718,共4页电子学报（英文版）

基　　金：This work is supported by the National Natural Science Foundation of China （No.61103200, No.61070157）, the National Basic Research Program of China （973 Program） （No.2012CB315903）.

摘　　要：In FSE 2003, Johan Wallen proposed efficient log-time algorithms for computing linear approximations of addition modulo 2^n. They posed that his algorithms can be generalized to more complex functions such as Pseudo-Hadamard Transform, but didn＇t to the readers. In this paper, we present a formula for computing linear correlation of Pseudo-Hadamard Transform.

关 键 词：Linear approximations CORRELATION Pseudo-Hadamard Transform Linear cryptanalysis. 

分 类 号：TP387[自动化与计算机技术—计算机系统结构] TN918.1[自动化与计算机技术—计算机科学与技术]