The Permutation Tables
A permutation table exists for each round of permutations that occurs during the time-coder process.
The six permutation tables work in the following manner:
- The upper of the two rows of numbers (O=>) represents the output positions, from left to right, of the 16 bits being permuted.
- The lower of the two rows (I=>) represents the input-bit position.
For example, using Permutation Table 1: Figure 1. Permutation Tables
for RACF secured signon
- Output-bit position 1 consists of the bit (on or off) in input-bit position 10.
- Output-bit position 2 consists of the bit in input-bit position 2.
Permutation Table 1
O=> 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
I=> 10 2 12 4 14 6 16 8 9 1 11 3 13 5 15 7
Permutation Table 2
O=> 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
I=> 1 10 3 12 13 16 7 15 9 2 11 4 5 14 8 6
Permutation Table 3
O=> 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
I=> 3 10 1 12 13 16 9 15 7 2 14 4 5 11 8 6
Permutation Table 4
O=> 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
I=> 10 4 12 2 14 8 16 6 9 1 13 3 11 5 15 7
Permutation Table 5
O=> 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
I=> 4 10 12 1 8 16 14 5 9 2 13 3 11 7 15 6
Permutation Table 6
O=> 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
I=> 1 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2