Professional Documents
Culture Documents
TARUNGEHLOTS
Communication System
Digital Source Digital Sink
Modulation
Channel
Demodulation
Cryptology
Cryptography
Cryptanalysis
Cryptography
Cryptanalysis
Cryptography:
Linear algebra, abstract algebra, number theory Probability, statistics, combinatorics, computing
Cryptanalysis:
Caesar Cipher
Example
Cryptanalysis of Caesar
Frequency analysis
Substitution Cipher
Permute A-Z randomly: A B C D E F G H I J K L M N O P becomes H Q A W I N F T E B X S F O P C Substitute H for A, Q for B, etc. Example
Try all 26! permutations TOO MANY! Bigger than Avogadro's Number! Frequency analysis
One-Time Pads
Map A, B, C, Z to 0, 1, 2, 25 A B M N T U 0 1 13 14 20 21 Plaintext: MATHISUSEFULANDFUN Key: NGUJKAMOCTLNYBCIAZ Encryption: Add key to message mod 26 Ciphertext: BGO.. Decryption: Subtract key from ciphertext mod 26
Modular Arithmetic
One-Time Pads
Unconditionally secure
Problem: Exchanging the key There are some clever ways to exchange the key we will study some of them!
Public-Key Cryptography
Need reliability!
Enter coding theory..
Coding theory is the study of errorcontrol codes Error control codes are used to detect and correct errors that occur when data are transferred or stored
Linear algebra Abstract algebra (groups, rings, fields) Probability&Statistics Signals&Systems Implementation issues Optimization issues Performance issues
General Problem
channels: telephone lines, internet cables, fiber-optic lines, microwave radio channels, cell phone channels, etc.
channels: hard drives, disks, CD-ROMs, DVDs, solid state memory, etc.
General Solution
Add controlled redundancy to the message to improve the chances of being able to recover the original message
Trivial example: The telephone game
ISBN Example
Cryptology by Thomas Barr: 0-13-088976-? Want 1(0) + 2(1) + 3(3) + 4(0) + 5(8) + 6(8) + 7(9) + 8(7) + 9(6) + 10(?) = multiple of 11 Compute 1(0) + 2(1) + 3(3) + 4(0) + 5(8) + 6(8) + 7(9) + 8(7) + 9(6) = 272 Ponder 272 + 10(?) = multiple of 11 Modular arithmetic shows that the check digit is 8!!
x12 is a check digit chosen so that S = 3x1 + 1x2 + + 3x11 + 1x12 = 0 mod 10 Can detect all single and most transposition errors What transposition errors go undetected?
Send 0 and 1
Noise may change 0 to 1 or change 1 to 0 Instead, send codewords 00000 and 11111 If noise corrupts up to 2 bits, decoder can use majority vote and decode received word as 00000
The distance between the two codewords is 5, because they differ in 5 spots
The rate of the code is 1/5, since for every bit of information, we need to send 5 coded bits
Length (n) Number of codewords (M) Minimum Hamming distance (d): Directly related to probability of decoding correctly Code rate: Ratio of information bits to codeword bits
What are the ideal trade-offs between rate, error-correcting capability, and number of codewords? What is the biggest distance you can get given a fixed rate or fixed number of codewords? What is the best rate you can get given a fixed distance or fixed number of codewords?
Well learn how Hadamard matrices were used on the 1969 Mariner Mission to build a rate 6/32 code that is approximately 100,000x better at correcting errors than the binary repetition code of length 5
Summary
Cryptology and coding theory involve abstract algebra, finite fields, rings, groups, probability, linear algebra, number theory, and additional exciting mathematics!
Who Cares?
Shopping and e-commerce ATMs and online banking Satellite TV & Radio, Cable TV, CD players Corporate/government espionage NSA, IDA, RSA, Aerospace, Bell Labs, AT&T, NASA, Lucent, Amazon, iTunes
Who else?