| DES Algorithm | |
- f() is calculated in 4 steps
- Ri-1 expanded to 48 bit E
- E and Ki exclusively or-ed
- 48 bit result split into 8x6 bit chunks
- Each 6 bit chunk has substitution cipher applied, resulting in 4 bit chunk
- 8x4 bit outputs permuted
Slide 54 | ©Copyright 1997 | Jan Newmarch |