Information Theory Without the Finiteness Assumption, II: Unfolding the DES

Authors:
G. R. Blakley
Affiliations:
-
Venue:
CRYPTO '85 Advances in Cryptology
Year:
1985

Citing 4
Cited 0

Security of ramp schemes

Proceedings of CRYPTO 84 on Advances in cryptology
Information theory without the finiteness assumption, I: Cryptosystems as group-theoretic objects

Proceedings of CRYPTO 84 on Advances in cryptology
Propagation characteristics of the DES

Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
Cryptography, a Primer

Cryptography, a Primer

Quantified Score

Hi-index	0.00

Visualization

Abstract

The DES is described in purely mathematical terms by means of confusion, diffusion and arithmetic involving a group of messages and a group of keys. It turns out to be a diffusion/arithmetic cryptosystem in which confusion plays no role, although the S-boxes effect an arithmetic operation of replacement (which is sometimes mistaken for confusion) as an important part of the encryption process.