A Tough Nut to Crack : - PowerPoint PPT Presentation

1 / 12
About This Presentation
Title:

A Tough Nut to Crack :

Description:

A Tough Nut to Crack : A look at Cryptography and Codes. By Joe ... Take message/code word to encrypt plaintext. Apply encryption ... calculate totient F ... – PowerPoint PPT presentation

Number of Views:141
Avg rating:3.0/5.0
Slides: 13
Provided by: Joe492
Category:
Tags: crack | nut | totient | tough

less

Transcript and Presenter's Notes

Title: A Tough Nut to Crack :


1
  • A Tough Nut to Crack
  • A look at Cryptography and Codes
  • By Joe Mirczuk

2
Aims
  • Basics
  • History
  • Methods of cryptography
  • Cracking the code?
  • Introducing into schools
  • Relation to university
  • Summary/essay

3
Cryptography and Coding Basics
  • Cryptography
  • Codes
  • General Method
  • Take message/code word to encrypt plaintext
  • Apply encryption/coding technique
  • Transmit message
  • Decode message/code word using key
  • Cryptanalysis

HELLO
001001
Encryption
Encryption
IFMMP
110110
Apply Key
Apply Key
HELLO
001001
4
History
  • Used throughout history
  • Romans
  • Second World War
  • Computing
  • Cryptography all around us
  • Keys and locks
  • Internet
  • CDs/DVDs

5
Caesars Cipher
The alphabet is shifted 3 places right in the
cipher
  • For example
  • Z W
  • HELLO EBIIL

6
Data Encryption Standard (DES)
  • The need for a standard
  • DES chosen in 1974 by NIST
  • Encryption involving transposition
  • - 56-bit key
  • - 256 combinations
  • 72,057,594,037,927,936 possible keys!
  • DES no longer considered secure
  • - Testing all keys
  • - In 1975 - 100,000 days (300 years)
  • - In 2000 - 1 day (100,000 times more powerful)
  • Solution?
  • - Double DES 2 keys 2112 combinations
  • - Triple DES 3 keys 2168 combinations
  • - In 2002 - AES

7
RSA Encryption
  • Method using Public-key cryptography
  • - Two keys
  • i) Public Key
  • ii) Private Key
  • - Like a post-box
  • Encryption method
  • - take two large prime numbers p and q
  • - calculate n pq
  • - calculate totient F(n) (p-1)(q-1)
  • - choose and integer e (encryption exponent)
    such that e and F(n) coprime
  • gcd(e, F(n) ) 1
  • - calculate d (decryption exponent) such that
  • de 1 mod(F(n))
  • - public key consists of n and e
  • - private key consists of n and d

8
RSA (Cont.)
Alice
Bob
Private Key
Public Key
Public Key
Public Key
message
message
Public Key
Private Key
9
Cracking the Code
  • Spotting the method
  • Frequency Analysis
  • Brute Force Attack
  • - Testing Keys
  • Modern Computers

10
Schools/University
  • In School
  • - Writing coded messages
  • - Beginners Frequency Analysis
  • - Computers
  • University
  • - RSA a look at modulo arithmetic
  • - Frequency analysis
  • - 2H Codes

11
Summary
  • History
  • Methods
  • Implimentation in schools
  • Relevance to university maths
  • My essay
  • - weaknesses
  • - which is most secure?
  • - how to increase protection

12
Any Questions?
Write a Comment
User Comments (0)
About PowerShow.com