The document describes a single round of the DES algorithm. It involves taking 32-bit left and right halves (Li-1 and Ri-1) along with a 48-bit key (Ki), performing expansion/permutation on Ri-1 using an E table and XORing with Ki. The output undergoes substitution/choice using an S-box, permutation using a P table, and XOR with Li-1 to produce the new left and right halves (Li and Ri) and output the 32-bit ciphertext (Ci) and datapath (Di).
The document describes a single round of the DES algorithm. It involves taking 32-bit left and right halves (Li-1 and Ri-1) along with a 48-bit key (Ki), performing expansion/permutation on Ri-1 using an E table and XORing with Ki. The output undergoes substitution/choice using an S-box, permutation using a P table, and XOR with Li-1 to produce the new left and right halves (Li and Ri) and output the 32-bit ciphertext (Ci) and datapath (Di).
The document describes a single round of the DES algorithm. It involves taking 32-bit left and right halves (Li-1 and Ri-1) along with a 48-bit key (Ki), performing expansion/permutation on Ri-1 using an E table and XORing with Ki. The output undergoes substitution/choice using an S-box, permutation using a P table, and XOR with Li-1 to produce the new left and right halves (Li and Ri) and output the 32-bit ciphertext (Ci) and datapath (Di).