A DIFFERENTIAL CRYPTANALYSIS OF TREE-STRUCTURED SUBSTITUTION-PERMUTATION NETWORKS

被引：0

作者：

OCONNOR, L ^{[1
]}

机构：

[1] INFORMAT SECUR RES CTR, BRISBANE, QLD, AUSTRALIA

来源：

IEEE TRANSACTIONS ON COMPUTERS | 1995年 / 44卷 / 09期

关键词：

COMPLETE BOOLEAN FUNCTIONS; CRYPTOGRAPHY; DIFFERENTIAL CRYPTANALYSIS; PRODUCT CIPHER; SUBSTITUTION-PERMUTATION NETWORK;

D O I：

10.1109/12.464394

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

We propose a differential attack on tree-structured substitution-permutation networks. The number of chosen plaintexts required for the differential attack to succeed is called the complexity. Our main result is to show that the expected complexity of the attack is linear in the size of the network. This is the first rigorous result concerning the complexity of a differential attack for a general class of product ciphers.

引用

页码：1150 / 1152

页数：3

共 7 条

[1]

ADAMS CM, 1990, THESIS QUEENS U KING

[2]

Anderson R. J., 1991, Cryptologia, V15, P194, DOI 10.1080/0161-119191865858

[3]

AYOUB F, 1982, COMPUT SECUR, V2, P261

[4]

Biham E., 1991, Journal of Cryptology, V4, P3, DOI 10.1007/BF00630563

[5] CRYPTANALYSIS OF TREE-STRUCTURED SUBSTITUTION PERMUTATION NETWORKS [J].

HEYS, HM ;

TAVARES, SE .

ELECTRONICS LETTERS, 1993, 29 (01) :40-41

[6]

KAM JB, 1979, IEEE T COMPUT, V28, P747, DOI 10.1109/TC.1979.1675242

[7]

OCONNOR LJ, 1994, LECT NOTES COMPUTER, V765, P360

← 1 →