Advanced Encryption Standard-Computer Network Security-Lecture Slides, Slides of Computer Security

This course teaches the key concepts of computer and network security. The course is divided in two parts. The first part covers the key cryptology concepts and protocols while the second half is about the advance topics in network security. This lecture includes: Advanced, Encryption, Standard, Cipher, Block, Chaining, History, Testing, Evaluation, Private, Key, Symmetric

Typology: Slides

2011/2012

Uploaded on 08/08/2012

parni
parni 🇮🇳

4.1

(14)

100 documents

1 / 23

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
1
Computer Network Security
Lecture 4
Advanced Encryption Standard
&
Cipher Block Chaining
docsity.com
pf3
pf4
pf5
pf8
pf9
pfa
pfd
pfe
pff
pf12
pf13
pf14
pf15
pf16
pf17

Partial preview of the text

Download Advanced Encryption Standard-Computer Network Security-Lecture Slides and more Slides Computer Security in PDF only on Docsity!

1

Computer Network SecurityLecture 4Advanced Encryption Standard& Cipher Block Chaining

2

Advanced Encryption Standard"It seems very simple.""It is very simple. But if you don't know what thekey is it's virtually indecipherable." —Talking to Strange Men, Ruth Rendell

4

AES History  After testing and evaluation, shortlist in Aug-99:  MARS (IBM) - complex, fast, high security margin  RC6 (USA) - v. simple, v. fast, low security margin  Rijndael (Belgium) - clean, fast, good security margin  Serpent (Euro) - slow, clean, v. high security margin  Twofish (USA) - complex, v. fast, high security margin  NIST published a final standard (FIPS PUB 197)in Nov. 2001.  NIST selected Rijndael^ as^ the^ proposed

AES

algorithm.  The^ two^ researchers^

from^ Belgium^ were:^ Dr.

Joan Daemen and Dr.Vincent Rijmen.

5

AES Requirements  Private key symmetric block cipher  128-bit data, 128/192/256-bit keys  Stronger & faster than Triple-DES  Provides full specification & design details  Both C & Java implementations  NIST have released all submissions &unclassified analyses

7

^ Data block of 4 columns of 4 bytes ^ This^ block^ is^ copied

into^ State^ array,^ which

is

modified at each stage of encryption or decryption.  After the final stage, State is copied to an output.  Key is expanded to array of words  Has 9/11/13 rounds in which state undergoes:^ ^ byte substitution (1 S-box used on every byte)^ ^ shift rows (permute bytes between groups/columns)^ ^ mix^ columns^ (substitution

using^ matrix^ multipy^ of

Rijndael Cipher groups)  add round key (XOR state with key material)  view as alternating XOR key & scramble data bytes  With fast XOR & table lookup implementation

8

Rijndael Cipher

10

Rijndael Cipher

11

Rijndael Cipher

13

Rijndael Cipher

14

Rijndael Cipher

16

Rijndael Cipher

17

Rijndael Cipher

19

Rijndael Cipher

20

Rijndael Cipher