This preview shows page 1. Sign up to view the full content.
Unformatted text preview: things? Good confusion makes the relationship statistics so complicated that even these powerful cryptanalytic tools won’t work. Diffusion spreads the influence of individual plaintext or key bits over as much of the ciphertext as possible. This also hides statistical relationships and makes cryptanalysis more difficult. Confusion alone is enough for security. An algorithm consisting of a single keydependent lookup table of 64 bits of plaintext to 64 bits of ciphertext would be plenty strong. The problem is that large lookup tables require lots of memory to implement: 1020 bytes of memory for the table just mentioned. The whole point of block cipher design is to create something that looks like a large lookup table, but with much smaller memory requirements. The trick is to repeatedly mix confusion (with much smaller tables) and diffusion in a single cipher in different combinations. This is called a product cipher. Sometimes a block cipher that incorporates layers of substitution and permutation is called a substitutionpermutation network, or even an SP network. Look back at function f of DES. The expansion permutation and Pbox perform diffusion; the Sboxes perform confusion. The expansion permutation and Pbox are linear; the Sboxes are nonlinear. Each operation is pretty simple on its own; together they work pretty well. DES also illustrates a few more principles of block cipher design. The first is the idea of an iterated block cipher. This simply means taking a simple round function and iterating it multiple times. Tworound DES isn’t very strong; it takes 5 rounds before all of the output bits are dependent on all of the input bits and all of the key bits [1078,1080]. Sixteenround DES is strong; 32round DES is even stronger. Feistel Networks
Most block algorithms are Feistel networks. This idea dates from the early 1970s [552,553]. Take a block of length n and divide it into two halves of length n/2: L and R. Of course, n must be even. You can define an iterated block cipher where the output of the ith round is determined from the output...
View
Full
Document
 Fall '10
 ALIULGER
 Cryptography

Click to edit the document details