Security CH-03 2024
Security CH-03 2024
By: Muleta Ta – 1
Topic to be covered
Basic Concepts
Cryptanalysis
Early Substitution and Transposition Ciphers
Modern Cryptography
By: Muleta Ta – 2
CH-3: Cryptography
Cryptography meaning
By: Muleta Ta – 3
CH-3: Cryptography
Cryptography meaning
is the science of writing or reading coded messages.
is the basic building block on which security principles such as
authentication, integrity, and confidentiality are built.
Coined with two terms
Crypto 7→ Secret
Graphia →
7 Writing
W@ is the Goal ?
↓
By: Muleta Ta – 3
CH-3: Cryptography
Cryptography meaning
is the science of writing or reading coded messages.
is the basic building block on which security principles such as
authentication, integrity, and confidentiality are built.
Coined with two terms
Crypto 7→ Secret
Graphia →
7 Writing
W@ is the Goal ?
↓
Recall security Goals! 7→
By: Muleta Ta – 3
CH-3: Cryptography
Cryptography meaning
is the science of writing or reading coded messages.
is the basic building block on which security principles such as
authentication, integrity, and confidentiality are built.
Coined with two terms
Crypto 7→ Secret
Graphia →
7 Writing
W@ is the Goal ?
↓
Recall security Goals! 7→ Mathimatical science
↓
Binary number system, Logical Operations, logarthmic function
Achieving each of these goals requires cryptosystems, and not all
cryptosystems are intended to achieve all goals.
By: Muleta Ta – 3
CH-3: Cryptography and Cryptanalysis
Deciphering or Decryption
Ciphertext-message(C) −−−−→ Plaintext message(P)
process
By: Muleta Ta – 4
CH-3: Cryptography and Cryptanalysis
7→ Ms.Sender
1. Assume P = Hey, this is Computer
Security
By: Muleta Ta – 5
CH-3: Cryptography and Cryptanalysis
7→ Ms.Sender
1. Assume P = Hey, this is Computer
Security
2. Select Encryption Algorithm
By: Muleta Ta – 5
CH-3: Cryptography and Cryptanalysis
7→ Ms.Sender
1. Assume P = Hey, this is Computer
Security
2. Select Encryption Algorithm
3. Select secret Key K
By: Muleta Ta – 5
CH-3: Cryptography and Cryptanalysis
7→ Ms.Sender
1. Assume P = Hey, this is Computer
Security
2. Select Encryption Algorithm
3. Select secret Key K
4. Generate cipher message E(P, K)
By: Muleta Ta – 5
CH-3: Cryptography and Cryptanalysis
7→ Ms.Sender
1. Assume P = Hey, this is Computer
Security
2. Select Encryption Algorithm
3. Select secret Key K
4. Generate cipher message E(P, K)
5. C will dropped to the channel
By: Muleta Ta – 5
CH-3: Cryptography and Cryptanalysis
7→ Ms.Sender 7→ Mr.Receiver
1. Assume P = Hey, this is Computer 1. C = yeh, siht si retupmoc ytiruces
Security
2. Select Encryption Algorithm
3. Select secret Key K
4. Generate cipher message E(P, K)
5. C will dropped to the channel
By: Muleta Ta – 5
CH-3: Cryptography and Cryptanalysis
7→ Ms.Sender 7→ Mr.Receiver
1. Assume P = Hey, this is Computer 1. C = yeh, siht si retupmoc ytiruces
Security 2. Select same Algorithm
2. Select Encryption Algorithm
3. Select secret Key K
4. Generate cipher message E(P, K)
5. C will dropped to the channel
By: Muleta Ta – 5
CH-3: Cryptography and Cryptanalysis
7→ Ms.Sender 7→ Mr.Receiver
1. Assume P = Hey, this is Computer 1. C = yeh, siht si retupmoc ytiruces
Security 2. Select same Algorithm
2. Select Encryption Algorithm 3. Select same secret Key K
3. Select secret Key K
4. Generate cipher message E(P, K)
5. C will dropped to the channel
By: Muleta Ta – 5
CH-3: Cryptography and Cryptanalysis
7→ Ms.Sender 7→ Mr.Receiver
1. Assume P = Hey, this is Computer 1. C = yeh, siht si retupmoc ytiruces
Security 2. Select same Algorithm
2. Select Encryption Algorithm 3. Select same secret Key K
3. Select secret Key K 4. Generate cipher message D(C, K)
4. Generate cipher message E(P, K)
5. C will dropped to the channel
By: Muleta Ta – 5
CH-3: Cryptography and Cryptanalysis
7→ Ms.Sender 7→ Mr.Receiver
1. Assume P = Hey, this is Computer 1. C = yeh, siht si retupmoc ytiruces
Security 2. Select same Algorithm
2. Select Encryption Algorithm 3. Select same secret Key K
3. Select secret Key K 4. Generate cipher message D(C, K)
4. Generate cipher message E(P, K) 5. P will dropped to the channel
5. C will dropped to the channel
By: Muleta Ta – 5
CH-3: Cryptography and Cryptanalysis
Cryptography Vs Cryptanalysis
Cryptanalysis is the flip side of cryptography.
It is the science of cracking codes, decoding secrets, and in general, breaking
cryptographic protocols.
robust encryption algorithm,
↓
cryptanalysis to find and correct any weaknesses.
The various techniques in cryptanalysis that attempt to compromise
cryptosystems are called attacks.
2 general approaches to attacking
Cryptanalysis: rely on
The nature of the algorithm
Some Knowledge of the general characteristics of the plaintext or
Sample plaintext-ciphertext pairs.
By: Muleta Ta – 6
CH-3: Cryptography and Cryptanalysis
Cryptography Vs Cryptanalysis
Cryptanalysis is the flip side of cryptography.
It is the science of cracking codes, decoding secrets, and in general, breaking
cryptographic protocols.
robust encryption algorithm,
↓
cryptanalysis to find and correct any weaknesses.
The various techniques in cryptanalysis that attempt to compromise
cryptosystems are called attacks.
2 general approaches to attacking
Cryptanalysis: rely on
The nature of the algorithm
Some Knowledge of the general characteristics of the plaintext or
Sample plaintext-ciphertext pairs.
Brute-force attack
Trial-and-Error Approach
↓
• trying every possible key on a piece of ciphertext until an intelligible
translation into plaintext is obtained.
By: Muleta Ta – 6
CH-3: Cryptography and Cryptanalysis
Known plaintext Encryption algorithm Ciphertext, One or more plaintext-ciphertext pairs formed with the
secret key
Chosen plaintext Encryption algorithm, Ciphertex, Plaintext message chosen by cryptanalyst, together with
its corresponding ciphertext generated with the secret key
Chosen ciphertext Encryption algorithm, Ciphertext, Purported ciphertext chosen by cryptanalyst, together
with its corresponding decrypted plaintext generated with the secret key
Chosen text Encryption algorithm Ciphertext, Plaintext message chosen by cryptanalyst, together with
its corresponding ciphertext generated with the secret key, Purported ciphertext chosen by
cryptanalyst, together with its corresponding decrypted plaintext generated with the
secret key
By: Muleta Ta – 7
CH-3: Cryptography and Cryptanalysis
By: Muleta Ta – 8
CH-3: Cryptography and Cryptanalysis
By: Muleta Ta – 9
CH-3: Cryptography and Cryptanalysis
By: Muleta Ta – 9
CH-3: Cryptography and Cryptanalysis
By: Muleta Ta – 9
CH-3: Cryptography and Cryptanalysis
By: Muleta Ta – 9
CH-3: Cryptography and Cryptanalysis
By: Muleta Ta – 9
CH-3: Cryptography and Cryptanalysis
• Remember that:
Unconditionally Secured
refers to a Cryptograohic scheme that remains secure even when an
attacker has unlimited computational power or resources
Do you think Achievable ?
By: Muleta Ta – 10
CH-3: Cryptography and Cryptanalysis
• Remember that:
Unconditionally Secured
refers to a Cryptograohic scheme that remains secure even when an
attacker has unlimited computational power or resources
Do you think Achievable ?
↓
Theorethically Proven!
Encryption techniques ...
Computationally secure: when
The cost of breaking the cipher exceeds the value of the encrypted information.
The time required to break the cipher exceeds the useful lifetime of the
information.
By: Muleta Ta – 10
CH-3: Cryptography and Cryptanalysis
Oldest System
Cryptography dates as far back as 1900 B.C., - Egypt
Early Indian texts such as the Kama Sutra used ciphers - simple alphabetic
substitutions often based on phonetics.
First letter is placed at the end of the word and is followed by the sound
”ay”.
Ex: ”try it” (rytay tiay)
Many notable personalities have participated in the evolution of
cryptography.
Julius Caesar used a simple method of authentication in government
communications called the ”Caesar Cipher”.
This method shifted each letter two places further in the alphabet (for
example, Y shifts to A, and M shifts to O).
These manual methods were easy to crack! So what?
By: Muleta Ta – 11
CH-3: Cryptography and Cryptanalysis
Crypto Machines
Thomas Jefferson invented a wheel cipher in the 1790s - used during
World War II with slight modification.
Consisted of a set of wheels, each with random orderings of the letters of
the alphabet.
In 1844, the development of cryptography was dramatically changed by
the invention of the telegraph.
Ciphers were needed to transmit secret information.
During World War II, most German codes were predominantly based on
the Enigma machine.
A British cryptanalysis group first broke the Enigma code early in World
War II - first uses of computers!
1
https://www.youtube.com/watch?v=ybkkiGtJmkM
By: Muleta Ta – 12
CH03-Cryptography and Cryptanalysis
By: Muleta Ta – 13
CH03-Cryptography and Cryptanalysis
text digits
By: Muleta Ta – 13
CH-3: Cryptography and Cryptanalysis
7→ Codes vs Ciphers
⇓
interchangeable ? 7→ Technically Different
Codes ..
A technique of converting or changing the message by replacing each word with
another word that has a different meaning.
Ex. P = ”The nightmare COVID”, so, Replacing Covid with 2019
HOOLYWOOD
Ex. P= ”Kill him as soon as possible’ may replaced with ”Kiss him as soon as
Possible”.
By: Muleta Ta – 14
CH-3: Cryptography and Cryptanalysis
Ciphers
Convert the message by a rule.
The Rule is only known between the communicating parties, which changes
each individual letter (or sometimes groups of letters).
Significantly easier to use than codes, since the users only have to
remember a specific algorithm
They use a variety of techniques to alter and/or rearrange the characters or
bits of a message to achieve confidentiality.
Ciphers convert messages from plaintext to ciphertext on
Bit basis
Character basis
Block basis
By: Muleta Ta – 15
Substitution Ciphers
Substitution Ciphers
Use the encryption algorithm to replace each character or bit of the
plaintext message with a different character depending on a key.
There are many subsititution cipher,
Homophonic Substitution Cipher:
Here single plaintext letters can be replaced by any of several different ciphertext
Generally much more difficult to break than standard substitution ciphers.
letters.
By: Muleta Ta – 16
CH-3: Cryptography and Cryptanalysis
By: Muleta Ta – 17
CH-3: Cryptography and Cryptanalysis
By: Muleta Ta – 17
Substitution cipher ...
Caesar Cipher
Julius Caesar used a simple method of authentication in government
communications called the ”Caesar Cipher”.
Caesar Cipher
aka Rotational Cipher
involves replacing each letter of the alphabet with the letter standing three
places further down the alphabet
Example: P = Meet me in the class use E = ROT3
P=
C=
Here each letter in the plaintext is shifted a certain number of places down
the alphabet
By: Muleta Ta – 18
Substitution cipher ...
By: Muleta Ta – 19
Substitution cipher ...
By: Muleta Ta – 20
CH-3: Cryptography and Cryptanalysis
By: Muleta Ta – 21
CH-3: Cryptography and Cryptanalysis
By: Muleta Ta – 21
Substitution cipher ..
Example
Encrypt the plaintext ”Meet hime as soon as possible” with key ”covid”.
Step 1 → Ptxt = Meet him as soon as possible
Step 2 → Sect = covi dco vi dcov id covidcov
Step 3 → Ctxt = oszb kka va vqci iv rcnaldzz
By: Muleta Ta – 22
Transpositional and Substitution Cipher
Transposition ciphers
Uses an encryption algorithm to rearrange the letters of a plaintext
message, forming the ciphertext message.
The letters or words of the plaintext are reordered in some way, fixed by a
given rule (the key).
The decryption algorithm simply reverses the encryption transformation to
retrieve the original message
Two kind of Transposition cipher
7→ Simple Transpositional Cipher
Used to simply reverse the letters of the message
Call it Reverse Transposition cipher
Ex. ”Transpositional” ”lanoitisopsnart”
7→ Columnar Transpositional Cipher
Refered as Scytale transposition
By: Muleta Ta – 23
Transpositional ...
First step is to take the letters of the keyword and number them in alphabetical
order.
The first appearance of the letter A receives the value 1;
The second appearance is numbered 2. and so on.
Ex: P = ”Computer Security and Information System” with a key ”section”
By: Muleta Ta – 24
Transpositional ...
First step is to take the letters of the keyword and number them in alphabetical
order.
The first appearance of the letter A receives the value 1;
The second appearance is numbered 2. and so on.
Ex: P = ”Computer Security and Information System” with a key ”section”
By: Muleta Ta – 24
Transpositional ...
First step is to take the letters of the keyword and number them in alphabetical
order.
The first appearance of the letter A receives the value 1;
The second appearance is numbered 2. and so on.
Ex: P = ”Computer Security and Information System” with a key ”section”
By: Muleta Ta – 24
Transpositional ...
First step is to take the letters of the keyword and number them in alphabetical
order.
The first appearance of the letter A receives the value 1;
The second appearance is numbered 2. and so on.
Ex: P = ”Computer Security and Information System” with a key ”section”
By: Muleta Ta – 24
Transpositional ...
First step is to take the letters of the keyword and number them in alphabetical
order.
The first appearance of the letter A receives the value 1;
The second appearance is numbered 2. and so on.
Ex: P = ”Computer Security and Information System” with a key ”section”
By: Muleta Ta – 24
Transpositional ...
First step is to take the letters of the keyword and number them in alphabetical
order.
The first appearance of the letter A receives the value 1;
The second appearance is numbered 2. and so on.
Ex: P = ”Computer Security and Information System” with a key ”section”
By: Muleta Ta – 24
Transpositional ...
First step is to take the letters of the keyword and number them in alphabetical
order.
The first appearance of the letter A receives the value 1;
The second appearance is numbered 2. and so on.
Ex: P = ”Computer Security and Information System” with a key ”section”
By: Muleta Ta – 24
Transpositional ...
First step is to take the letters of the keyword and number them in alphabetical
order.
The first appearance of the letter A receives the value 1;
The second appearance is numbered 2. and so on.
Ex: P = ”Computer Security and Information System” with a key ”section”
By: Muleta Ta – 24
Transposition...
Finally, the sender enciphers the message by reading down each column;
The order in which the columns are read corresponds to the numbers assigned in
the first step.
Cipher text would be :
By: Muleta Ta – 25
Transposition...
Finally, the sender enciphers the message by reading down each column;
The order in which the columns are read corresponds to the numbers assigned in
the first step.
Cipher text would be : mssyfoeo tnituscar eerday ttunms crmiitspye onm
By: Muleta Ta – 25
Transposition...
Finally, the sender enciphers the message by reading down each column;
The order in which the columns are read corresponds to the numbers assigned in
the first step.
Cipher text would be : mssyfoeo tnituscar eerday ttunms crmiitspye onm
⇒ Assume a cipeher text dipped into Columnar transposition with key ”exploit”.
what would be the message?
C= bcngmethhiciy*e*roo**twy*ms**lttramienoss*ea**p*e
By: Muleta Ta – 25
CH-3: Modern Cryptography
By: Muleta Ta – 26
CH-3: Modern Cryptography
Computers
Modern encryption algorithms rely on encryption keys to ensure the
confidentiality of encrypted data.
There are two different methods of encryption keys:
1. Symmetric key: uses the same key to encrypt and decrypt a message.
2. Asymmetric key: uses two different keys.
A cipher is another word for a coded message.
It is the end result of transforming an original message using a
mathematical function.
They both have benefits and limitations! What are they?
By: Muleta Ta – 27
Next Chapter ...?!
Question!
By: Muleta Ta – 28