On the Design of Linear Transformations for Substitution Permutation Encryption Networks (1997)
| Venue: | School of Computer Science, Carleton University |
| Citations: | 7 - 0 self |
BibTeX
@INPROCEEDINGS{Youssef97onthe,
author = {A. M. Youssef and S. Mister and S. E. Tavares},
title = {On the Design of Linear Transformations for Substitution Permutation Encryption Networks},
booktitle = {School of Computer Science, Carleton University},
year = {1997},
pages = {40--48}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In this paper we study the security of Substitution Permutation Encryption Networks (SPNs) with randomly selected bijective substitution boxes and a randomly selected invertible linear transformation layer. In particular, our results show that for such a 64--bit SPN using 8 2 8 s-boxes, the number of s-boxes involved in any 2 rounds of a linear approximation or a differential characteristic is equal to 8 with probability exceeding 0:8. For these SPNs the number of plaintext/ciphertext pairs that are required for the basic linear and differential cryptanalysis exceeds 2 within 6 rounds. We also provide two construction methods for involution linear transformations based on Maximum Distance Separable Codes.
