(Added text) |
|||
| Line 1: | Line 1: | ||
[[Category:2015 Summer Cryptography Prof. Paar]] | [[Category:2015 Summer Cryptography Prof. Paar]] | ||
| − | [[Category: | + | [[Category:Paar]] |
[[Category:Cryptography]] | [[Category:Cryptography]] | ||
[[Category:slecture]] | [[Category:slecture]] | ||
| Line 9: | Line 9: | ||
</font size> | </font size> | ||
| − | A [http://www.projectrhea.org/learning/slectures.php slecture] | + | A [http://www.projectrhea.org/learning/slectures.php slecture] on [[Cryptography]] by student Divya Agarwal and Katie Marsh. |
| − | Partly based on the [[2015 Summer Cryptography Paar|Cryptography Summer 2015]] lecture material of | + | Partly based on the [[2015 Summer Cryptography Paar|Cryptography Summer 2015]] lecture material of Prof. Paar. |
</center> | </center> | ||
| Line 18: | Line 18: | ||
=[http://www.youtube.be/watch?v=rheateam@gmail.com Link to video on youtube]= | =[http://www.youtube.be/watch?v=rheateam@gmail.com Link to video on youtube]= | ||
<youtube>rheateam@gmail.com</youtube> | <youtube>rheateam@gmail.com</youtube> | ||
| − | |||
---- | ---- | ||
| + | ''' | ||
| + | == Accompanying Lecture Notes == | ||
| + | ''' | ||
---- | ---- | ||
| + | |||
| + | ==== DES- Key Schedule ==== | ||
| + | |||
| + | The DES ''key schedule'' genrates 16 round keys (or sub-keys) for the 16 encryption rounds. The sub-keys are derived out of the original 64-bit key given as an input. | ||
| + | |||
| + | Step 1: The original 64-bit key is reduced to 56-bit key using the PC-1 permutation table (Fig 1). Note: Every 8th bit is ignored in the table(i.e. bits numbered 8, 16, 24, 32, 40, 48, 56, and 64). Nevertheless number the bits from 1 to 64, going left to right. | ||
| + | |||
| + | Step 2: Split the 56-bit Key in two 28-bit halves: Left - <math>C_0</math> and Right - <math>D_0</math>(Refer Fig 2). | ||
| + | |||
| + | Step 3: With <math>C_0</math> and <math>D_0</math> defined, we now create sixteen blocks <math>C_n</math> and <math>D_n</math>, <math>1≤n≤16</math> using following rules. | ||
| + | * In rounds i = 1,2,9,16 , the two halves are each rotated left by '''one''' bit. | ||
| + | * In all other rounds, where i ≠ 1,2,9,16 , the two halves are each rotated left by '''two''' bits. | ||
| + | * Total numbe rof rotations 4*1 + 12* 2 = 28 which leads to an interesting property : <math>C_0</math>=<math>C_{16}</math> and <math>D_0</math>=<math>D_{16}</math>. | ||
| + | |||
| + | Step 4: | ||
| + | |||
| + | |||
==[[2015_Summer_Cryptography_Prof. Paar_Introduction to Cryptography_Divya Agarwal and Katie Marsh_comments | Questions and comments]]== | ==[[2015_Summer_Cryptography_Prof. Paar_Introduction to Cryptography_Divya Agarwal and Katie Marsh_comments | Questions and comments]]== | ||
If you have any questions, comments, etc. please post them [[2015_Summer_Cryptography_Prof. Paar_Introduction to Cryptography_Divya Agarwal and Katie Marsh_comments|here]]. | If you have any questions, comments, etc. please post them [[2015_Summer_Cryptography_Prof. Paar_Introduction to Cryptography_Divya Agarwal and Katie Marsh_comments|here]]. | ||
Revision as of 07:39, 17 June 2015
Introduction to Cryptography
A slecture on Cryptography by student Divya Agarwal and Katie Marsh.
Partly based on the Cryptography Summer 2015 lecture material of Prof. Paar.
Contents
Link to video on youtube
Accompanying Lecture Notes
DES- Key Schedule
The DES key schedule genrates 16 round keys (or sub-keys) for the 16 encryption rounds. The sub-keys are derived out of the original 64-bit key given as an input.
Step 1: The original 64-bit key is reduced to 56-bit key using the PC-1 permutation table (Fig 1). Note: Every 8th bit is ignored in the table(i.e. bits numbered 8, 16, 24, 32, 40, 48, 56, and 64). Nevertheless number the bits from 1 to 64, going left to right.
Step 2: Split the 56-bit Key in two 28-bit halves: Left - $ C_0 $ and Right - $ D_0 $(Refer Fig 2).
Step 3: With $ C_0 $ and $ D_0 $ defined, we now create sixteen blocks $ C_n $ and $ D_n $, $ 1≤n≤16 $ using following rules.
- In rounds i = 1,2,9,16 , the two halves are each rotated left by one bit.
- In all other rounds, where i ≠ 1,2,9,16 , the two halves are each rotated left by two bits.
- Total numbe rof rotations 4*1 + 12* 2 = 28 which leads to an interesting property : $ C_0 $=$ C_{16} $ and $ D_0 $=$ D_{16} $.
Step 4:
Questions and comments
If you have any questions, comments, etc. please post them here.
Back to 2015 Summer Cryptography Prof. Paar
