Cryptography Lecture 2: Chantilly Academy - PowerPoint PPT Presentation

About This Presentation
Title:

Cryptography Lecture 2: Chantilly Academy

Description:

128 bits (10 rounds) 192 bits (12 rounds) 256 bits (14 rounds) ... (all byte operations, 1 round shown) XOR with key. S-box. Shift Rows. Mix Columns ... – PowerPoint PPT presentation

Number of Views:38
Avg rating:3.0/5.0
Slides: 12
Provided by: poo69
Category:

less

Transcript and Presenter's Notes

Title: Cryptography Lecture 2: Chantilly Academy


1
Block Ciphers
  • Cryptography Lecture 2 Chantilly Academy
  • Poorvi Vora
  • Department of Computer Science
  • George Washington University

2
Most generally
  • A cipher is a substitution. For example,
    substitute one byte with another

3
However
  • Its easy to break if you substitute one letter
    for another, or one set of 8 bits for another
  • So you take many, many bits and substitute them
    with others
  • Todays block ciphers take 128 bits at a time,
    and substitute them with another 128 bits.
  • Can we just use a table like the one on the
    previous slide?

4
Previous Block Cipher Standard Data Encryption
Standard (DES)
5
One round of DES Feistel Cipher
Equal length
Ri-1
Li-1
f
f
Ki
Ri Li-1?fKi(Ri-1)
Li Ri-1
6
Diagram cut from FIPS standard
7
Attacks on DES
  • DES was broken in the late 90s with special
    purpose hardware built by the Electronic Frontier
    Foundation

8
Current Block Cipher StandardAdvanced Encryption
Standard (AES)
9
Standardization
  • While looking for a replacement for DES, NIST
    requested proposals from all over the world
  • Several workshops were held to discuss the
    proposals and their potential flaws
  • Researchers worked to try to break the proposals
  • From final shortlist with similar security
    properties, NIST chose one by two Flemish
    cryptographers, that was slightly more efficient,
    then known as Rijndael

10
AES
  • Chosen for security, efficiency, implementation
  • Key lengths
  • 128 bits (10 rounds)
  • 192 bits (12 rounds)
  • 256 bits (14 rounds)
  • Consists of XOR with key, S-box substitution,
    permutation, mixcolumns

11
High-level AES (all byte operations, 1 round
shown)
XOR with key
S-box is an algebraic operation
S-box
Shift Rows
Mix Columns
Write a Comment
User Comments (0)
About PowerShow.com