Scribd
Upload
18 views

Lecture 1

Uploaded by

hasona272002
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
18 views

Lecture 1

Uploaded by

hasona272002
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 28

INFORMATION

SECURITY
Cryptography
Introduction
• Information security means protecting information and
information system from unauthorized access, use,
modification or destruction(damaged).
•
Cryptographic Objectives
• CIA == Confidentiality, Integrity, and Availability
• Confidentiality
– aims to prevent unauthorized reading of
information.
• Integrity
– detect unauthorized writing of information
• Availability
– Data is available in a timely manner when needed
Cryptography
• Cryptography or “secret codes” are a
fundamental information security tool.
• Cryptology  The art and science of making
and breaking “secret codes”
• Cryptography  making “secret codes”

• Cryptanalysis  breaking “secret codes”


Terminology
• Plaintext original message
• Ciphertext encrypted or coded message
• Encryption convert from plaintext to ciphertext
(enciphering)
• Decryption restore the plaintext from ciphertext
(deciphering)
• Key information used in cipher known only to
sender/receiver
• Cipher a particular algorithm (cryptographic system)
How to Speak Crypto
• A cipher or cryptosystem is used to encrypt
the plaintext
• The result of encryption is ciphertext
• We decrypt ciphertext to recover plaintext
• A key is used to configure a cryptosystem
• A symmetric key cryptosystem uses the same
key to encrypt as to decrypt
• A public key (Asymmetric key) cryptosystem
uses a public key to encrypt and a private key
to decrypt
Symmetric key

key key

plaintext encrypt decrypt plaintext


ciphertext

A generic view of symmetric key crypto


public key
Crypto
• Basic assumptions
– The system is completely known to the attacker
– Only the key is secret
– That is, crypto algorithms are not secret
• This is known as Kerckhoffs’ Principle
• All encryption algorithms are based on two general principles:
1. substitution: in which each element in the plaintext (bit, letter,
group of bits or letters) is mapped into another element.
2. Transposition: in which elements in the plaintext are
rearranged.
• The fundamental requirement is that no information be lost (that is,
that all operations are reversible).
Classic cryptosystems
• We’ll examine different classic cryptosystems each of
which illustrates some particularly relevant feature:
– Rail Fence cipher
– Columnar Transposition cipher
– Double transposition cipher
– Simple Substitution cipher
– Playfair cipher
– One time pad cipher
– Vigenere Cipher
– Affine Cipher
– Hill Cipher
Rail Fence-Encryption
• To encrypt a message using the Rail Fence Cipher, you have
to write your message in zigzag lines across the page, and
then read off each row.
• Firstly, you need to have a key, which for this cipher is the
number of rows you are going to have.
• You then start writing the letters of the plaintext diagonally
down to the right until you reach the number of rows
specified by the key.
• You then bounce back up diagonally until you hit the first
row again.
• This continues until the end of the plaintext.
Rail Fence cipher
• The Rail Fence cipher works by writing your message on
alternate lines across the page, and then reading off each
line in turn.
• For example, the plaintext "defend the east wall" is written
as shown below, with all spaces removed.

• The ciphertext is then read off by writing the top row first,
followed by the bottom row, to get
"DFNTEATALEEDHESWL".
Example-Encryption
• For the plaintext we used above, "defend the
east wall", with a key of 3, we get the encryption
process shown below.

• The ciphertext is read off row by row to get


"DNETLEEDHESWLFTAA".
Rail Fence cipher
• The plaintext is written down as a sequence of
diagonals and then read off as a sequence of rows.
For example, to encipher the message "meet me
after the toga party" with a rail fence of depth 2, we
write the following:

• The encrypted message is:


MEMATRHTGPRYETEFETEOAAT
Rail Fence-Decryption
• We start by making a grid with as many rows as the
key is, and as many columns as the length of the
ciphertext.
• We then place the first letter in the top left square,
and dashes diagonally downwards where the
letters will be.
• When we get back to the top row, we place the
next letter in the ciphertext. Continue like this
across the row, and start the next row when you
reach the end.
Example-Decryption
• For example, if you receive the ciphertext
"TEKOOHRACIRMNREATANFTETYTGHH", encrypted
with a key of 4:
• you start by placing the "T" in the first square. You
then dash the diagonal down spaces until you get
back to the top row, and place the "E" here.
• Continuing to fill the top row you get the pattern
below.
Example-Decryption
• We have a table with 4 rows because the key is 4, and 28 columns as the ciphertext
has length 28.Continuing this row-by-row, we get the successive stages shown
below: TEKOOHRACIRMNREATANFTETYTGHH

Plain text:
"they are
attacking from
the north".
Columnar Transposition-Encryption
• A simple example for a transposition cipher is columnar
transposition cipher.
• write the message in a rectangle, row by row, and read the
message off, column by column.
• permute the order of the columns. The order of the columns
then becomes the key to the algorithm.
Columnar Transposition-decryption
• To decipher it, the recipient has to work out the
column lengths by dividing the message length by
the key length.
• Then, write the message out in columns again, then
re-order the columns by reforming the key word.
• Key: 4312567
• Ciphertext:
TTNA APTM TSUO AODW COIX KNLY PETZ
• Plaintext:
Example 1
• We first pick a keyword for our encryption. We write the
plaintext out in a grid where the number of columns is the
number of letters in the keyword. We then title each column
with the respective letter from the keyword. We take the
letters in the keyword in alphabetical order, and read down
the columns in this order. If a letter is repeated, we do the
one that appears first, then the next and so on.
• Example:
• encrypt the message "The tomato is a plant in the
nightshade family"
• keyword tomato
• Ciphertext: TINESAX / EOAHTFX / HTLTHEY / MAIIAIX /
TAPNGDL / OSTNHMX" (where the / tells you where a new
column starts).
• The final ciphertext is thus
• "TINES AXEOA HTFXH TLTHE YMAII AIXTA PNGDL OSTNH
MX".
Example 2
• decrypt the ciphertext "ARESA SXOST HEYLO
IIAIE XPENG DLLTA HTFAX TENHM WX" given
the keyword potato.
• There are 42 letters in the ciphertext, and the
keyword has six letters, so we need 42 ÷ 6 = 7
row
Example 2

• The plaintext :"potatoes are in the nightshade


family as well".
Double Transposition Cipher
• To encrypt with a double transposition cipher,
we first write the plaintext into an array of a
given size and then permute the rows and
columns according to specified permutations.
• For example, suppose we write the plaintext
attackatdawn into a 3 × 4 array:
Double Transposition Cipher
• Now if we transpose (or permute) the rows
according to (1, 2, 3) → (3, 2, 1) and then
transpose the columns according to (1, 2, 3, 4)
→ (4, 2, 1, 3), we obtain:

Ciphertext: NADWTKCAATAT
Double Transposition Cipher
• For the double transposition, the key consists of the
size of the matrix and the row and column
permutations.
• For example, to decrypt pervious ciphertext is first
put into a 3 × 4 array.
• Then the columns are numbered as (4, 2, 1, 3) and
rearranged to (1, 2, 3, 4).
• Then the rows are numbered (3, 2, 1) and rearranged
into (1, 2, 3), as illustrated below
Double Transposition Cipher

𝟓 ×𝟑
Double Transposition Cipher
PROBLEM

Encrypt the message


we are all together
using a double transposition cipher with 4 rows
and 4 columns, using the row permutation
(1, 2, 3, 4) → (2, 4, 1, 3)
and the column permutation
(1, 2, 3, 4) → (3, 1, 2, 4).

You might also like