Linear approximations of addition modulo 2n

被引：0
|
作者：
Wallén, Johan [1 ]
机构：
[1] Laboratory for Theoretical Computer Science, Helsinki University of Technology, P.O.Box 5400, FIN-02015 HUT, Espoo, Finland
来源：
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2003年 / 2887卷
关键词：
Cryptography - Computation theory;
D O I：
10.1007/978-3-540-39887-5_20
中图分类号：
学科分类号：
摘要：
We present an in-depth algorithmic study of the linear approximations of addition modulo 2n. Our results are based on a fairly simple classification of the linear approximations of the carry function. Using this classification, we derive an θ(log n)-time algorithm for computing the correlation of linear approximation of addition modulo 2n, an optimal algorithm for generating all linear approximations with a given non-zero correlation coefficient, and determine the distribution of the correlation coefficients. In the generation algorithms, one or two of the selection vectors can optionally be fixed. The algorithms are practical and easy to implement. © International Association for Cryptologic Research 2003.
引用
收藏
页码：261 / 273
相关论文
共 50 条
12345