共 4 条
- [1] Anderson R. J., 1991, Cryptologia, V15, P194, DOI 10.1080/0161-119191865858
- [2] HEYS HM, 1992, CHOSEN PLAINTEXT ATT
- [3] KAM JB, 1979, IEEE T COMPUT, V28, P747, DOI 10.1109/TC.1979.1675242
- [4] SIVABALAN M, P CRYPTO 92
CRYPTANALYSIS OF TREE-STRUCTURED SUBSTITUTION PERMUTATION NETWORKS
被引：3
作者：
HEYS, HM
TAVARES, SE
机构：
[1] Department of Electrical Engineering, Queen's University, Kingston
关键词：
CRYPTOGRAPHY;
ALGORITHMS;
D O I：
10.1049/el:19930026
中图分类号：
TM [电工技术];
TN [电子技术、通信技术];
学科分类号：
0808 ;
0809 ;
摘要：
An efficient algorithm to cryptanalyse tree-structured substitution-permutation networks, introduced by Kam and Davida, is presented. The cryptanalysis uses a chosen plain-text approach to construct an equivalent network, working independtly of the network keying. Assuming S-boxes of fixed size, the presented algorithm is shown to be linear in the network block size.
引用
收藏
页码：40 / 41
页数：2
相关论文