Automatic Search for a Maximum Probability Differential Characteristic in a Substitution-Permutation Network

被引：4

作者：

Arnaud, Bannier ^{[1
]}

Nicolas, Bodin ^{[1
]}

Eric, Filiol ^{[1
]}

机构：

[1] ESIEA Lab C V, Laval, France

来源：

2015 48TH HAWAII INTERNATIONAL CONFERENCE ON SYSTEM SCIENCES (HICSS) | 2015年

关键词：

D O I：

10.1109/HICSS.2015.610

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

The algorithm presented in this paper computes a maximum probability differential characteristic in a Substitution-Permutation Network (or SPN). Such characteristics can be used to prove that a cipher is practically secure against differential cryptanalysis or on the contrary to build the most effective possible attack. Running in just a few second on 64 or 128-bit SPN, our algorithm is an important tool for both cryptanalists and designers of SPN.

引用

页码：5165 / 5174

页数：10