0% found this document useful (0 votes)
18 views58 pages

Security CH-03 2024

Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
18 views58 pages

Security CH-03 2024

Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 58

CHAPTER 03: Cryptography and Cryptanalysis.

By: Muleta Taye E-mail: [email protected]


October 28, 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

Cryptography Concepts ...


ˆ Appropriate to define crypto terminologies :
ˆ Plaintext message:
ˆ Before a message is put into a coded form.
ˆ Represented by letter P when encryption functions are described
ˆ Ciphertext message:
ˆ is after the plaintext message is encrypted with cryptographic algorithms.
ˆ Enciphering or Encryption
ˆ Plaintext-message(P) −−−−→ Ciphertext message(C)
process

ˆ Deciphering or Decryption
ˆ Ciphertext-message(C) −−−−→ Plaintext message(P)
process

ˆ Basic components of cryptogaphy:


1. Encryption algorithm →
7 E(p)
2. Decryption algorithm →7 D(c)
3. Secret key 7→ K

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

Type of Attack Known to Cryptanalyst

Ciphertext only Encryption algorithm and Ciphertext

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

Figure 1: Model of Conventional Cryptosystem

By: Muleta Ta – 8
CH-3: Cryptography and Cryptanalysis

ˆ Cryptographic systems are characterized along three independent dimensions:


1. The type of operations used for transforming plaintext to ciphertext.

based on two general principles

By: Muleta Ta – 9
CH-3: Cryptography and Cryptanalysis

ˆ Cryptographic systems are characterized along three independent dimensions:


1. The type of operations used for transforming plaintext to ciphertext.

based on two general principles substitution and/or transposition,

By: Muleta Ta – 9
CH-3: Cryptography and Cryptanalysis

ˆ Cryptographic systems are characterized along three independent dimensions:


1. The type of operations used for transforming plaintext to ciphertext.

based on two general principles substitution and/or transposition,
2. The number of keys used.

Single key or Multiple-keys
3. The way in which the plaintext is processed

How do we process ? 7→

By: Muleta Ta – 9
CH-3: Cryptography and Cryptanalysis

ˆ Cryptographic systems are characterized along three independent dimensions:


1. The type of operations used for transforming plaintext to ciphertext.

based on two general principles substitution and/or transposition,
2. The number of keys used.

Single key or Multiple-keys
3. The way in which the plaintext is processed

How do we process ? 7→ Block Cipher and/or

By: Muleta Ta – 9
CH-3: Cryptography and Cryptanalysis

ˆ Cryptographic systems are characterized along three independent dimensions:


1. The type of operations used for transforming plaintext to ciphertext.

based on two general principles substitution and/or transposition,
2. The number of keys used.

Single key or Multiple-keys
3. The way in which the plaintext is processed

How do we process ? 7→ Block Cipher and/or Stream Cipher

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

Where does the Manual cryptography started?

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 exist

ˆ are machines for automatic encryption using a composition of mixed


alphabet substitutions often performed by means of rotors.

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

ˆ Cryptographic algorithms rely upon two basic operations to obscure plaintext


messages 7→ Why ?

By: Muleta Ta – 13
CH03-Cryptography and Cryptanalysis

ˆ Cryptographic algorithms rely upon two basic operations to obscure plaintext


messages 7→ Why ?
ˆ For building secure cipher
ˆ Prevent the encryption key from being guessed
ˆ Preventing the original message
ˆ Two Operations ...
1. Confusion
ˆ Basically devised to increase the vagueness of the cipher text
ˆ Keeping the relationship between the statistical of the cipher text and the value
of the encryption key Complex APAP.
2. Diffusion
ˆ invented to increase the redundancy of the plain text to obscure the statistical
ˆ It is achieved by spreading out the individual plaintext digit over many cipher
structure of the plaintext to prevent attempts to deduce the key.

text digits

By: Muleta Ta – 13
CH-3: Cryptography and Cryptanalysis

7→ Codes vs Ciphers

interchangeable ? 7→ Technically Different

ˆ Cryptography is split into two ways of changing the message systematically !



To confuse anyone who intercepts it⇒ Codes and Ciphers.

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.

ˆ Monoalphabetic Substitution Ciphers


ˆ Relies on a fixed replacement structure. That is, the substitution is fixed for each
letter of the alphabet
ˆ Polyalphabetic Substitution Ciphers
ˆ Make use of multiple alphabets in the same message to hinder decryption efforts.
ˆ Polygraphic Substitution Ciphers
ˆ This divide the plaintext into groups of letters. ⇒ Blocks
ˆ is invented as an improvement of simple substitution ciphers.

By: Muleta Ta – 16
CH-3: Cryptography and Cryptanalysis

7→ Monoalphabetic Substitution Ciphers


ˆ Caesar Cipher
ˆ Atbash Cipher
ˆ ROT13 Cipher
ˆ Affine Cipher
ˆ Baconian Cipher
ˆ Polybius Square Cipher
ˆ Simple Substitution Cipher
ˆ Codes and Nomenclators Cipher

By: Muleta Ta – 17
CH-3: Cryptography and Cryptanalysis

7→ Monoalphabetic Substitution Ciphers 7→ Polyalphabetic Substitution Ciphers


ˆ Caesar Cipher ˆ Vigenère Cipher
ˆ Atbash Cipher ˆ Beaufort Cipher
ˆ ROT13 Cipher ˆ Porta Cipher
ˆ Affine Cipher ˆ Running Key Cipher
ˆ Baconian Cipher ˆ AutoKey and Gronsfeld Cipher
ˆ Polybius Square Cipher ˆ Enigma Cipher
ˆ Simple Substitution Cipher 7→ Polygraphic Substitution Ciphers
ˆ Codes and Nomenclators Cipher ˆ Four-Square Cipher
ˆ Hill Cipher
ˆ Playfair Cipher

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 ...

ˆ So caesar cipher encryption function, E(x) is mathematically expressed as :


E(x) = (x + k) mod 26
where x is character we are encrypting and k is the shifting key.
ˆ The decryption function is :, D(x) is mathematically expressed as :
D(x) = (x - k) mod 26
where x is character we are encrypting and k is the shifting key.

By: Muleta Ta – 19
Substitution cipher ...

ˆ Ex: if the shifing key is 1 A would be replaced by B, B would become C,


and so on.
ˆ Assume we are given a message ”COVID messed up everything” with a
secret key 1; Ciphertext?

plaintext: covid messed up everything


ciphertext:dpwje nfttfe vq fufszuijoh ⇒ key = 1
ciphertext: eqxkf oguuugf wr evguavjkpi ⇒ key = 2

ˆ One of the most notableb examples of a polyalphabetic substitution cipher


system is the Vigenere cipher.
ˆ The Vigenere cipher uses a single encryption/decryption chart.

By: Muleta Ta – 20
CH-3: Cryptography and Cryptanalysis

7→ Follow the steps for encryption


1. Put the plaintext followed by the
key.
2. Repeat the key as many times as
needed to establish a line of text
that is the same length as the
plaintext.
3. Convert each letter position from
plaintext to ciphertext.
ˆ By locating the column headed
by the first plaintext character.
ˆ Next, locate the row headed
by the first key word character.
ˆ Finally, locate where these two
items intersect and write down
the letter that appears there .
ˆ Repeat steps above untill
done!

By: Muleta Ta – 21
CH-3: Cryptography and Cryptanalysis

7→ Follow the steps for encryption


1. Put the plaintext followed by the
key.
2. Repeat the key as many times as
needed to establish a line of text
that is the same length as the
plaintext.
3. Convert each letter position from
plaintext to ciphertext.
ˆ By locating the column headed
by the first plaintext character.
ˆ Next, locate the row headed
by the first key word character.
ˆ Finally, locate where these two
items intersect and write down
the letter that appears there .
ˆ Repeat steps above untill
done!

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 ...

7→ How does the Columnar Transposition works ?

ˆ 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”

ˆ The key is Section

By: Muleta Ta – 24
Transpositional ...

7→ How does the Columnar Transposition works ?

ˆ 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”

ˆ The key is Section


ˆ C takes value 1

By: Muleta Ta – 24
Transpositional ...

7→ How does the Columnar Transposition works ?

ˆ 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”

ˆ The key is Section


ˆ C takes value 1
ˆ E takes value 2

By: Muleta Ta – 24
Transpositional ...

7→ How does the Columnar Transposition works ?

ˆ 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”

ˆ The key is Section


ˆ C takes value 1
ˆ E takes value 2
ˆ I takes value 3

By: Muleta Ta – 24
Transpositional ...

7→ How does the Columnar Transposition works ?

ˆ 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”

ˆ The key is Section


ˆ C takes value 1
ˆ E takes value 2
ˆ I takes value 3
ˆ N takes value 4

By: Muleta Ta – 24
Transpositional ...

7→ How does the Columnar Transposition works ?

ˆ 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”

ˆ The key is Section


ˆ C takes value 1
ˆ E takes value 2
ˆ I takes value 3
ˆ N takes value 4
ˆ O takes value 5

By: Muleta Ta – 24
Transpositional ...

7→ How does the Columnar Transposition works ?

ˆ 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”

ˆ The key is Section


ˆ C takes value 1
ˆ E takes value 2
ˆ I takes value 3
ˆ N takes value 4
ˆ O takes value 5
ˆ S takes value 6

By: Muleta Ta – 24
Transpositional ...

7→ How does the Columnar Transposition works ?

ˆ 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”

ˆ The key is Section


ˆ C takes value 1
ˆ E takes value 2
ˆ I takes value 3
ˆ N takes value 4
ˆ O takes value 5
ˆ S takes value 6
ˆ T takes value 7

By: Muleta Ta – 24
Transposition...

Computer system Security and Information System

ˆ 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...

Computer system Security and Information System

ˆ 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...

Computer system Security and Information System

ˆ 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

When does the Modern Crypto started ?


ˆ 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!
ˆ By 1948, cryptographers started to use advanced mathematical techniques
to:
ˆ Calculate ciphers, and
ˆ Prevent computers from unscrambling the ciphers.

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

You might also like