简单DES中的p10到p8 [英] p10 to p8 in simple DES

问题描述

I am new to cryptography.

During my learning I am facing prob in s-des. I am confuse from how P10 to P8 come, and confuse in the process of this algo. can anyone have any good article to solve it easily.

I am reading following example but getting confuse..


## Example ##

        P10 = { 3, 5, 2, 7, 4, 10, 1, 9, 8, 6}

        P8 = { 6, 3, 7, 4, 8, 5, 10, 9}

        K =     10100 00010

        P10     10000 01100

        LS-1    00001 11000  ->  P8  ->  K1 = 1010 0100

        LS-2    00100 00011  ->  P8  ->  K2 = 0100 0011

推荐答案

您可以阅读有关DES（或父文章）的补充材料;

http://en.wikipedia.org/wiki/DES_supplementary_material [ ^ ]



帮助您了解算法的内部运作。

You could read the supplementary material on DES (or the parent article);
http://en.wikipedia.org/wiki/DES_supplementary_material[^]

That may help you understand the inner workings of the algo.

这篇关于简单DES中的p10到p8的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！