Linear cryptanalysis of substitution-permutation networks

Linear cryptanalysis of substitution-permutation networks (2003)

by Liam Keliher

Citations:

4 - 3 self

Datum	Value	Source
TITLE	Linear cryptanalysis of substitution-permutation networks	INFERENCE
AUTHOR NAME	Liam Keliher	SVM HeaderParse 0.2
AUTHOR AFFIL	Kingston, Ontario	SVM HeaderParse 0.2
AUTHOR ADDR	Canada	SVM HeaderParse 0.2
ABSTRACT	The subject of this thesis is linear cryptanalysis of substitution-permutation networks (SPNs). We focus on the rigorous form of linear cryptanalysis, which requires the concept of linear hulls. First, we consider SPNs in which the s-boxes are selected independently and uni-formly from the set of all bijective n × n s-boxes. We derive an expression for the expected linear probability values of such an SPN, and give evidence that this ex-pression converges to the corresponding value for the true random cipher. This adds quantitative support to the claim that the SPN structure is a good approximation to the true random cipher. We conjecture that this convergence holds for a large class of SPNs. In addition, we derive a lower bound on the probability that an SPN with ran-domly selected s-boxes is practically secure against linear cryptanalysis after a given number of rounds. For common block sizes, experimental evidence indicates that this probability rapidly approaches 1 with an increasing number of rounds.	SVM HeaderParse 0.2
YEAR	2003	SVM HeaderParse 0.2
VENUE TYPE	TECHREPORT	INFERENCE
TECH	Ph.D. Thesis	INFERENCE
CITATIONS	118 found	ParsCit 1.0