Chapter 2 – Elementary Cryptography 1 SHIRAJ MOHAMED M | MIS UNIT.
-
Upload
charla-shaw -
Category
Documents
-
view
231 -
download
0
Transcript of Chapter 2 – Elementary Cryptography 1 SHIRAJ MOHAMED M | MIS UNIT.
![Page 1: Chapter 2 – Elementary Cryptography 1 SHIRAJ MOHAMED M | MIS UNIT.](https://reader036.fdocuments.net/reader036/viewer/2022062308/56649ec85503460f94bd4dbf/html5/thumbnails/1.jpg)
Chapter 2 – Elementary Cryptography
1SHIRAJ MOHAMED M | MIS UNIT
![Page 2: Chapter 2 – Elementary Cryptography 1 SHIRAJ MOHAMED M | MIS UNIT.](https://reader036.fdocuments.net/reader036/viewer/2022062308/56649ec85503460f94bd4dbf/html5/thumbnails/2.jpg)
Concepts of encryption Cryptanalysis Symmetric (secret key) Encryption Asymmetric (public key) Encryption Key exchange protocols and certificates Digital Signatures Cryptographic hash functions
2SHIRAJ MOHAMED M | MIS UNIT
![Page 3: Chapter 2 – Elementary Cryptography 1 SHIRAJ MOHAMED M | MIS UNIT.](https://reader036.fdocuments.net/reader036/viewer/2022062308/56649ec85503460f94bd4dbf/html5/thumbnails/3.jpg)
SHIRAJ MOHAMED M | MIS UNIT 3
![Page 4: Chapter 2 – Elementary Cryptography 1 SHIRAJ MOHAMED M | MIS UNIT.](https://reader036.fdocuments.net/reader036/viewer/2022062308/56649ec85503460f94bd4dbf/html5/thumbnails/4.jpg)
Sender (S), Recipient (R), Transmission media (T)
Interceptor / intruder (O) (availability) O might block message from reaching R O might intercept message
(confidentiality) O might modify message (integrity) O might fabricate an authentic-looking
message (integrity)
4SHIRAJ MOHAMED M | MIS UNIT
![Page 5: Chapter 2 – Elementary Cryptography 1 SHIRAJ MOHAMED M | MIS UNIT.](https://reader036.fdocuments.net/reader036/viewer/2022062308/56649ec85503460f94bd4dbf/html5/thumbnails/5.jpg)
Encryption – process of encoding a message
Decryption – transforming encoded message back to normal
Encrypt – encode , encipher Decrypt – decode, decipher Cryptosystem – system for encryption and
decryption Plaintext – original form of message Ciphertext – encoded form of message
5SHIRAJ MOHAMED M | MIS UNIT
![Page 6: Chapter 2 – Elementary Cryptography 1 SHIRAJ MOHAMED M | MIS UNIT.](https://reader036.fdocuments.net/reader036/viewer/2022062308/56649ec85503460f94bd4dbf/html5/thumbnails/6.jpg)
Algorithms – rules for encryption and decryption Key – value used to encrypt message C = E(K, P) where P=plaintext, K = key, E = encryption algorithms,
and C = ciphertext Symmetric encryption P = D(K, E(K,P)) Asymmetric encryption P = D(KD, E(KE,P)) Keyless cipher Cryptography (hidden writing) – uses encryption to hide
message Cryptanalysis – attempts to find meanings in encrypted
messages Cryptology – study of encryption and decryption
6SHIRAJ MOHAMED M | MIS UNIT
![Page 7: Chapter 2 – Elementary Cryptography 1 SHIRAJ MOHAMED M | MIS UNIT.](https://reader036.fdocuments.net/reader036/viewer/2022062308/56649ec85503460f94bd4dbf/html5/thumbnails/7.jpg)
Sometimes the encryption and decryption keys are the same
P = D (K, E (K, P))
7
where P=plaintext, K = key, E = encryption algorithms, and C = ciphertext
SHIRAJ MOHAMED M | MIS UNIT
![Page 8: Chapter 2 – Elementary Cryptography 1 SHIRAJ MOHAMED M | MIS UNIT.](https://reader036.fdocuments.net/reader036/viewer/2022062308/56649ec85503460f94bd4dbf/html5/thumbnails/8.jpg)
At other times, encryption and decryption keys come in pairs
Decryption key, KD
Encryption key KE
P = D (KD, E (KE, P))
8
where P=plaintext, K = key, E = encryption algorithms, and C = ciphertext
SHIRAJ MOHAMED M | MIS UNIT
![Page 9: Chapter 2 – Elementary Cryptography 1 SHIRAJ MOHAMED M | MIS UNIT.](https://reader036.fdocuments.net/reader036/viewer/2022062308/56649ec85503460f94bd4dbf/html5/thumbnails/9.jpg)
Cryptography (secret writing) is the strongest tool for controlling against many kinds of security threats.
Well-disguised data cannot be read, modified, or fabricated easily. Cryptography is rooted in higher mathematics: group and field theory, computational complexity, and even real analysis, not to mention probability and statistics. Fortunately, it is not necessary to understand the underlying mathematics to be able to use cryptography.
9SHIRAJ MOHAMED M | MIS UNIT
![Page 10: Chapter 2 – Elementary Cryptography 1 SHIRAJ MOHAMED M | MIS UNIT.](https://reader036.fdocuments.net/reader036/viewer/2022062308/56649ec85503460f94bd4dbf/html5/thumbnails/10.jpg)
Attempt to break a single message Attempt to recognize patterns in
encrypted messages Attempt to infer some meaning without
breaking the encryption Attempt to realize the key Attempt to find weaknesses in the
implementation or environment of use of encryption
Attempt to find general weaknesses in an encryption algorithm
10SHIRAJ MOHAMED M | MIS UNIT
![Page 11: Chapter 2 – Elementary Cryptography 1 SHIRAJ MOHAMED M | MIS UNIT.](https://reader036.fdocuments.net/reader036/viewer/2022062308/56649ec85503460f94bd4dbf/html5/thumbnails/11.jpg)
CryptographerA cryptographer works on behalf of a legitimate
sender or receiver
CryptanalystA cryptanalyst works on behalf of an unauthorized
interceptor
11SHIRAJ MOHAMED M | MIS UNIT
![Page 12: Chapter 2 – Elementary Cryptography 1 SHIRAJ MOHAMED M | MIS UNIT.](https://reader036.fdocuments.net/reader036/viewer/2022062308/56649ec85503460f94bd4dbf/html5/thumbnails/12.jpg)
12SHIRAJ MOHAMED M | MIS UNIT
![Page 13: Chapter 2 – Elementary Cryptography 1 SHIRAJ MOHAMED M | MIS UNIT.](https://reader036.fdocuments.net/reader036/viewer/2022062308/56649ec85503460f94bd4dbf/html5/thumbnails/13.jpg)
13SHIRAJ MOHAMED M | MIS UNIT
![Page 14: Chapter 2 – Elementary Cryptography 1 SHIRAJ MOHAMED M | MIS UNIT.](https://reader036.fdocuments.net/reader036/viewer/2022062308/56649ec85503460f94bd4dbf/html5/thumbnails/14.jpg)
An encryption algorithm is called breakable when, given enough time and data, an analyst can determine the algorithm
May be impractical A 25-character message of just uppercase
letters has 2625 (1035) possible decipherments. A computer performing 1010 operations/sec would take 1011 years
14SHIRAJ MOHAMED M | MIS UNIT
![Page 15: Chapter 2 – Elementary Cryptography 1 SHIRAJ MOHAMED M | MIS UNIT.](https://reader036.fdocuments.net/reader036/viewer/2022062308/56649ec85503460f94bd4dbf/html5/thumbnails/15.jpg)
SHIRAJ MOHAMED M | MIS UNIT 15
we use the convention;plaintext is written in UPPERCASE letters, and ciphertext is in lowercase letters
LASANTHA11018131970
![Page 16: Chapter 2 – Elementary Cryptography 1 SHIRAJ MOHAMED M | MIS UNIT.](https://reader036.fdocuments.net/reader036/viewer/2022062308/56649ec85503460f94bd4dbf/html5/thumbnails/16.jpg)
A + 3 = D N - 1 = ? C+10 = ? S + 9 = ? X + 4 = ?
SHIRAJ MOHAMED M | MIS UNIT 16
![Page 17: Chapter 2 – Elementary Cryptography 1 SHIRAJ MOHAMED M | MIS UNIT.](https://reader036.fdocuments.net/reader036/viewer/2022062308/56649ec85503460f94bd4dbf/html5/thumbnails/17.jpg)
Substitution – one or more characters are replaced with another
Transpositions (permutations) – order of characters is rearranged
Hybrid – combinations of the two types
17SHIRAJ MOHAMED M | MIS UNIT
![Page 18: Chapter 2 – Elementary Cryptography 1 SHIRAJ MOHAMED M | MIS UNIT.](https://reader036.fdocuments.net/reader036/viewer/2022062308/56649ec85503460f94bd4dbf/html5/thumbnails/18.jpg)
This technique is called a monoalphabetic cipher or simple substitution
A substitution is an acceptable way of encrypting text
18SHIRAJ MOHAMED M | MIS UNIT
![Page 19: Chapter 2 – Elementary Cryptography 1 SHIRAJ MOHAMED M | MIS UNIT.](https://reader036.fdocuments.net/reader036/viewer/2022062308/56649ec85503460f94bd4dbf/html5/thumbnails/19.jpg)
Each letter is translated a fixed number of positions in the alphabet
Ci = E(pi) = pi + 3 (Caesar used a shift of 3)
Easy to perform; easy to break Look for double letters and then use
common words with double letters
19SHIRAJ MOHAMED M | MIS UNIT
![Page 20: Chapter 2 – Elementary Cryptography 1 SHIRAJ MOHAMED M | MIS UNIT.](https://reader036.fdocuments.net/reader036/viewer/2022062308/56649ec85503460f94bd4dbf/html5/thumbnails/20.jpg)
Use a key to scramble the letters A B C D E F G H I J K L M N O … c i p h e r s a b d f g j k l …
Rearrange using a fixed distance between letters (e.g. every 3rd)
A B C D E F G H I J K L M N O … a d g j m p s v y b e h k n r …
20SHIRAJ MOHAMED M | MIS UNIT
![Page 21: Chapter 2 – Elementary Cryptography 1 SHIRAJ MOHAMED M | MIS UNIT.](https://reader036.fdocuments.net/reader036/viewer/2022062308/56649ec85503460f94bd4dbf/html5/thumbnails/21.jpg)
Substitution encryption algorithms can be performed by direct lookup in tables.
An important issue in using any cryptosystem is the time it takes to turn plaintext into ciphertext, and vice versa.
21SHIRAJ MOHAMED M | MIS UNIT
![Page 22: Chapter 2 – Elementary Cryptography 1 SHIRAJ MOHAMED M | MIS UNIT.](https://reader036.fdocuments.net/reader036/viewer/2022062308/56649ec85503460f94bd4dbf/html5/thumbnails/22.jpg)
The techniques described for breaking the Caesar cipher can also be used on other substitution ciphers
Look for short words, words with repeated patterns, common first and last letters
Can use our knowledge of language Look at frequency distributions Could reduce time to hours Nature and context of the text being
analyzed
22SHIRAJ MOHAMED M | MIS UNIT
![Page 23: Chapter 2 – Elementary Cryptography 1 SHIRAJ MOHAMED M | MIS UNIT.](https://reader036.fdocuments.net/reader036/viewer/2022062308/56649ec85503460f94bd4dbf/html5/thumbnails/23.jpg)
The pad consists of a large number of pages where each page contains a non-repeating key
The sender would write the keys above the message (e.g. a 300 character message would require 30 pages of 10 character keys)
The message is scrambled using a Vigenere tableau built from the message and key
Problem is synchronizing the receiver’s pad with the senders pad
23SHIRAJ MOHAMED M | MIS UNIT
![Page 24: Chapter 2 – Elementary Cryptography 1 SHIRAJ MOHAMED M | MIS UNIT.](https://reader036.fdocuments.net/reader036/viewer/2022062308/56649ec85503460f94bd4dbf/html5/thumbnails/24.jpg)
SHIRAJ MOHAMED M | MIS UNIT 24
![Page 25: Chapter 2 – Elementary Cryptography 1 SHIRAJ MOHAMED M | MIS UNIT.](https://reader036.fdocuments.net/reader036/viewer/2022062308/56649ec85503460f94bd4dbf/html5/thumbnails/25.jpg)
SHIRAJ MOHAMED M | MIS UNIT 25
I am, I exist, that is certain.
uaopm kmkvt unhbl jmed
![Page 26: Chapter 2 – Elementary Cryptography 1 SHIRAJ MOHAMED M | MIS UNIT.](https://reader036.fdocuments.net/reader036/viewer/2022062308/56649ec85503460f94bd4dbf/html5/thumbnails/26.jpg)
One-time pad consists of an arbitrary long non-repeating sequence of numbers that are combined with the plaintext
Each plaintext character is represented by its numeric equivalent and is added to one of the random numbers. The ciphertext character is computed from the sum mod 26
Repeated characters are typically represented by different ciphertext characters
26SHIRAJ MOHAMED M | MIS UNIT
![Page 27: Chapter 2 – Elementary Cryptography 1 SHIRAJ MOHAMED M | MIS UNIT.](https://reader036.fdocuments.net/reader036/viewer/2022062308/56649ec85503460f94bd4dbf/html5/thumbnails/27.jpg)
SHIRAJ MOHAMED M | MIS UNIT 27
![Page 28: Chapter 2 – Elementary Cryptography 1 SHIRAJ MOHAMED M | MIS UNIT.](https://reader036.fdocuments.net/reader036/viewer/2022062308/56649ec85503460f94bd4dbf/html5/thumbnails/28.jpg)
Uses a passage from a book to form the letters at the top of a Vigenere Tableau
Computes ciphertext character by taking the intersection of the plaintext character and corresponding character at that position from the book passage
Relatively easy to break using frequency distributions
28SHIRAJ MOHAMED M | MIS UNIT
![Page 29: Chapter 2 – Elementary Cryptography 1 SHIRAJ MOHAMED M | MIS UNIT.](https://reader036.fdocuments.net/reader036/viewer/2022062308/56649ec85503460f94bd4dbf/html5/thumbnails/29.jpg)
Columnar Transposition rearranging plaintext message into columns and then reading it row by row
Transposition algorithms require a constant amount of time per character and are (n) algorithms, but space required to store results and delay in waiting for all characters to be read are dependent on the size of the plaintext
29SHIRAJ MOHAMED M | MIS UNIT
![Page 30: Chapter 2 – Elementary Cryptography 1 SHIRAJ MOHAMED M | MIS UNIT.](https://reader036.fdocuments.net/reader036/viewer/2022062308/56649ec85503460f94bd4dbf/html5/thumbnails/30.jpg)
THIS IS A MESSAGE TO SHOW HOW A COLUMNAR TRANSPOSITION WORKS
tssoh oaniw haaso lrsto imghw utpir seeoa mrook istwc nasns
SHIRAJ MOHAMED M | MIS UNIT 30
![Page 31: Chapter 2 – Elementary Cryptography 1 SHIRAJ MOHAMED M | MIS UNIT.](https://reader036.fdocuments.net/reader036/viewer/2022062308/56649ec85503460f94bd4dbf/html5/thumbnails/31.jpg)
If the message length is not a multiple of the length of a row, the last columns will be one or more letters short. When this happens, we sometimes use an infrequent letter, such as X, to fill in any short columns
SHIRAJ MOHAMED M | MIS UNIT 31
![Page 32: Chapter 2 – Elementary Cryptography 1 SHIRAJ MOHAMED M | MIS UNIT.](https://reader036.fdocuments.net/reader036/viewer/2022062308/56649ec85503460f94bd4dbf/html5/thumbnails/32.jpg)
Compute letter frequencies of ciphertext; if appear with normal frequency, then assume a transposition algorithm was used
32SHIRAJ MOHAMED M | MIS UNIT
![Page 33: Chapter 2 – Elementary Cryptography 1 SHIRAJ MOHAMED M | MIS UNIT.](https://reader036.fdocuments.net/reader036/viewer/2022062308/56649ec85503460f94bd4dbf/html5/thumbnails/33.jpg)
The amount of secrecy needed should determine the amount of labor appropriate for the encryption and decryption
The set of keys and the enciphering algorithm should be free from complexity
The implementation of the process should be as simple as possible
Errors in ciphering should not propagate and cause corruption of further information in the message
The size of the enciphered text should be no larger than the text of the original message
SHIRAJ MOHAMED M | MIS UNIT 33
![Page 34: Chapter 2 – Elementary Cryptography 1 SHIRAJ MOHAMED M | MIS UNIT.](https://reader036.fdocuments.net/reader036/viewer/2022062308/56649ec85503460f94bd4dbf/html5/thumbnails/34.jpg)
Most of the ciphers we have presented so far are stream ciphers (exception is the columnar transposition cipher)
convert one symbol of plaintext immediately into a symbol of ciphertext
SHIRAJ MOHAMED M | MIS UNIT 34
![Page 35: Chapter 2 – Elementary Cryptography 1 SHIRAJ MOHAMED M | MIS UNIT.](https://reader036.fdocuments.net/reader036/viewer/2022062308/56649ec85503460f94bd4dbf/html5/thumbnails/35.jpg)
SHIRAJ MOHAMED M | MIS UNIT 35
![Page 36: Chapter 2 – Elementary Cryptography 1 SHIRAJ MOHAMED M | MIS UNIT.](https://reader036.fdocuments.net/reader036/viewer/2022062308/56649ec85503460f94bd4dbf/html5/thumbnails/36.jpg)
Skipping a character in the key during encryption
SHIRAJ MOHAMED M | MIS UNIT 36
![Page 37: Chapter 2 – Elementary Cryptography 1 SHIRAJ MOHAMED M | MIS UNIT.](https://reader036.fdocuments.net/reader036/viewer/2022062308/56649ec85503460f94bd4dbf/html5/thumbnails/37.jpg)
A block cipher encrypts a group of plaintext symbols as one blockEg: columnar transposition
SHIRAJ MOHAMED M | MIS UNIT 37
![Page 38: Chapter 2 – Elementary Cryptography 1 SHIRAJ MOHAMED M | MIS UNIT.](https://reader036.fdocuments.net/reader036/viewer/2022062308/56649ec85503460f94bd4dbf/html5/thumbnails/38.jpg)
SHIRAJ MOHAMED M | MIS UNIT 38
![Page 39: Chapter 2 – Elementary Cryptography 1 SHIRAJ MOHAMED M | MIS UNIT.](https://reader036.fdocuments.net/reader036/viewer/2022062308/56649ec85503460f94bd4dbf/html5/thumbnails/39.jpg)
Advantages and disadvantages of stream and block encryption algorithms
SHIRAJ MOHAMED M | MIS UNIT 39
![Page 40: Chapter 2 – Elementary Cryptography 1 SHIRAJ MOHAMED M | MIS UNIT.](https://reader036.fdocuments.net/reader036/viewer/2022062308/56649ec85503460f94bd4dbf/html5/thumbnails/40.jpg)
SHIRAJ MOHAMED M | MIS UNIT 40
![Page 41: Chapter 2 – Elementary Cryptography 1 SHIRAJ MOHAMED M | MIS UNIT.](https://reader036.fdocuments.net/reader036/viewer/2022062308/56649ec85503460f94bd4dbf/html5/thumbnails/41.jpg)
The interceptor should not be able to predict what will happen to the ciphertext by changing one character in the plaintext
The goal of substitution is confusion
SHIRAJ MOHAMED M | MIS UNIT 41
![Page 42: Chapter 2 – Elementary Cryptography 1 SHIRAJ MOHAMED M | MIS UNIT.](https://reader036.fdocuments.net/reader036/viewer/2022062308/56649ec85503460f94bd4dbf/html5/thumbnails/42.jpg)
The cipher should also spread the information from the plaintext over the entire ciphertext so that changes in the plaintext affect many parts of the ciphertext
SHIRAJ MOHAMED M | MIS UNIT 42
![Page 43: Chapter 2 – Elementary Cryptography 1 SHIRAJ MOHAMED M | MIS UNIT.](https://reader036.fdocuments.net/reader036/viewer/2022062308/56649ec85503460f94bd4dbf/html5/thumbnails/43.jpg)
Charles P. Pfleeger, (2005) "Security in Computing (Fourth Edition)", Prentic-Hall International, Inc.
43SHIRAJ MOHAMED M | MIS UNIT
![Page 44: Chapter 2 – Elementary Cryptography 1 SHIRAJ MOHAMED M | MIS UNIT.](https://reader036.fdocuments.net/reader036/viewer/2022062308/56649ec85503460f94bd4dbf/html5/thumbnails/44.jpg)
44
thank you
SHIRAJ MOHAMED M | MIS UNIT