{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

final-topics

# final-topics - – Prime Numbers and Factorization –...

This preview shows pages 1–2. Sign up to view the full content.

Lign 17, Winter 2011: Topics Covered What is Steganography/Cryptography? Transposition Ciphers Example: Rail Fence Ciphers Substitution Ciphers: Making and Breaking Them Monoalphabetic * Caesar Shift Codes, Nomenclators Monoalphabetic with Keyphrase Monoalphabetic with Homophones Polyalphabetic: The Vigenere Cipher One-time Pad Ciphers Book Ciphers Binary representations (e.g., ASCII) Math in binary An example binary transposition cipher An example binary substitution cipher Public-Key Cryptography The Key Distribution Problem / Padlock Metaphor One-way Functions Modular Arithmetic

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
The Diﬃe-Hellman Protocol
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: – Prime Numbers and Factorization – Asymmetric Ciphers (vs. Symmetric) – RSA • Data Compression – Fixed-length and variable-length codes – Preﬁx-free codes – Huﬀman coding – Lossless vs. Lossy compression; compression ratios • Randomness (vs. Predictability) – The Spectral Tests for Randomness • Error-Detecting (and Correcting) Codes – Checksum Systems for Binary Messages – Credit Card Codes / Luhn Algorithm – Universal Product Codes (UPC) – ISBN Codes – Error-Correcting Codes / Hamming(7,4) – Analysis of Errors (Caught and Missed)...
View Full Document

{[ snackBarMessage ]}

### Page1 / 2

final-topics - – Prime Numbers and Factorization –...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online