ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
The design of substitution-permutation networks resistant to differential and linear cryptanalysis
Full text PdfPdf (749 KB)
Source Conference on Computer and Communications Security archive
Proceedings of the 2nd ACM Conference on Computer and communications security table of contents
Fairfax, Virginia, United States
Pages: 148 - 155  
Year of Publication: 1994
ISBN:0-89791-732-4
Authors
H. M. Heys  Electrical Engineering, Memorial University of Newfoundland, St. John's, Newfoundland, Canada
S. E. Tavares  Department of Electrical and Computer Engineering, Queen's University, Kingston, Ontario, Canada
Sponsor
SIGSAC: ACM Special Interest Group on Security, Audit, and Control
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 48,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/191177.191206
What is a DOI?

ABSTRACT

In this paper we examine a class of product ciphers referred to as substitution-permutation networks. We investigate the resistance of these cryptographic networks to two important attacks: differential cryptanalysis and linear cryptanalysis. In particular, we develop upper bounds on the differential characteristic probability and on the probability of a linear approximation as a function of the number of rounds of substitutions. Further, it is shown that using large S-boxes with good diffusion characteristics and replacing the permutation between rounds by an appropriate linear transformation is effective in improving the cipher security in relation to these two attacks.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
H. Feistel, '~ryptography and computer privacy," Scientific American, vol. 228, no. 5, pp. 15--23, 1973.
 
2
H. Feistel, W. A. Notz, and J. L. Smith, "Some cryptographic techniques for machine-to-machine dam communications," Proceedings of the IEEE, vol. 63, no. 11, pp. 1545-1554, 1975.
 
3
C. E. Shannon, "Communication theory of secrecy systems," Bell System Technical Journal, vol. 28, pp. 656-715, 1949.
 
4
"National Bureau of Standards - Data Encryption Standard," Federal Information Processing Standard Publication 46, 1977.
 
5
E. Biham and A. Shamir, "Differential cryptanalysis of DES-like cryptosystems," Journal of Cryptology, vol. 4, no. 1, pp. 3-72, 1991.
 
6
 
7
K. Nybcrg, "On the construction of highly nonlinear lw.xmutations," Advances in Cryptology: Proceedings of EUROCRYPT '92, Springer-Verlag, Berlin, pp. 92- 98, 1992.
 
8
E. Biham and A. Shamir, "Diffexential cryptanalysis of FEAL and N-Hash," Advances in Cryptology: Proceedings of EUROCRYPT '91, Springer-Verlag, Berlin, pp. 1-16, 199 I.
 
9
 
10
 
11
 
12
 
13
 
14

Collaborative Colleagues:
H. M. Heys: colleagues
S. E. Tavares: colleagues