This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: on a key to use RSA is Asymmetric Unbreakable Midterm Topics • What is Steganography? • What is Cryptography? • Transposition Ciphers – Example: Rail Shift Ciphers • Substitution Ciphers: Making and Breaking Them – Monoalphabetic – Caesar Shift – Codes, Nomenclators – Monoalphabetic with Codeword – Monoalphabetic with Homophones – Polyalphabetic: The Vigenere Cipher – Onetime Pad Ciphers – Book Ciphers • Binary representations (e.g., ASCII) – An example binary transposition cipher – An example binary substitution cipher • PublicKey Cryptography – The Key Distribution Problem / Padlock Metaphor – Oneway Functions – Modular Arithmetic – The DiffieHellman Protocol – Asymmetric Ciphers (vs. Symmetric) – RSA...
View
Full
Document
This note was uploaded on 04/03/2008 for the course LIGN 17 taught by Professor Kehler during the Winter '08 term at UCSD.
 Winter '08
 Kehler

Click to edit the document details