1 / 10

Introduction to Cryptography 1

Introduction to Cryptography 1. TE/CS 536 Network Security Spring 2006 – Lectures 3&4. Definitions. Process data into unintelligible form Reversible, without data loss Usually one-to-one (not compression) Plaintext encryption  ciphertext decryption  plaintext

bryar-berger
Télécharger la présentation

Introduction to Cryptography 1

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Introduction to Cryptography 1 TE/CS 536 Network Security Spring 2006 – Lectures 3&4

  2. Definitions • Process data into unintelligible form • Reversible, without data loss • Usually one-to-one (not compression) • Plaintext encryption ciphertext decryption  plaintext • Encryption: algorithm + key • Decryption: encryption in reverse

  3. Simple example • Plain: p let me go • Cipher: c OHW PH JR • Encryption Algorithm (Find the key!) c = E(p) = (p + 3) mod (26) • Decryption algorithm p = D(c) = (C – 3) mod (26) • Cryptanalysis Q: How many tries will find us the key?

  4. Cryptography • Operations • Substitution : map (replace) elements • Transposition : permute elements • Keys • Symmetric (single-key, secret key) • Asymmetric (two-key, public key) • Modes • Block ciphers, stream ciphers

  5. Substitution ciphers - 1 • Caesar cipher: substitution cipher: • A  D, B  E • Monoalphabetic cipher: • generalization, arbitrary mapping of one letter to another (find the key!) • 26!, approximately 4  1026 • statistical analysis of letter frequencies • Polygram block cipher • Replace one block of plain text with another block of cipher text: SOME -> XFPL, SO ->JN

  6. Substitution ciphers - 2 • Vernam cipher (very long but repeating key) • Convert text into binary • Encrypt: ci = pi ki • Decrypt pi = ci ki • One-time pad (random, non-repeating key) • Exhaustive search will produce many legitimate plaintexts • Finding the desired plaintext without knowing the key in impossible – code is unbreakable

  7. Transposition techniques • Rail fence • l e t m e g o q u i c k l y Ciphertext = lqeutimcekgloy • Column permutations • Key 2 4 1 3 • Plain l e t m e g o q u i c k • Cipher ? • Cryptanalysis ?

  8. Computational Difficulty • Algorithm needs to be efficient. • Otherwise only short keys can be used. • Most schemes can be broken: depends on money. • e.g. Try all possible keys. • Longer key is often more secure: • Encryption O(N+1). • Brute-force cryptanalysis: O(2N+1), twice as hard with each additional bit. • Cryptanalysis tools: • Special-purpose hardware. • Parallel machines. • Internet coarse-grain parallelism.

  9. Cryptanalysis: Breaking an Encryption Scheme • Ciphertext only: • Exhaustive search until “recognizable plaintext” • Need enough ciphertext, e.g. to do stat analysis • Known plaintext: • Secret may be revealed (by spy, time), thus <ciphertext, plaintext> pair is obtained • Great for monoalphabetic ciphers • Chosen plaintext: • Choose text, get encrypted, e.g. by telegraph company • Useful if limited set of messages

  10. Brute Force Attacks • Number of encryptions/sec: 1 million to 1 billion – try all possible keys • 56-bit key broken in 1 week with 120,000 processors ($6.7m) • 56-bit key broken in 1 month with 28,000 processors ($1.6m) • 64-bit key broken in 1 week with 3.1  107 processors ($1.7b) • 128-bit key broken in 1 week with 5.6  1026 processors

More Related