Thanks to visit codestin.com
Credit goes to www.scribd.com

0% found this document useful (0 votes)
37 views42 pages

Section 1

This document provides an introduction to information security concepts including the CIA triad model, cryptography algorithms, and encryption techniques. It discusses symmetric and asymmetric encryption, summarizing key differences. Specific algorithms covered include the Caesar cipher, monoalphabetic cipher, and Playfair cipher. Examples are provided to demonstrate how to encrypt and decrypt messages using these classical cipher techniques. The document concludes with assignments asking students to decrypt a ciphertext using Playfair cipher and implement Caesar cipher on Arabic letters.

Uploaded by

Mohamed Hany
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)
37 views42 pages

Section 1

This document provides an introduction to information security concepts including the CIA triad model, cryptography algorithms, and encryption techniques. It discusses symmetric and asymmetric encryption, summarizing key differences. Specific algorithms covered include the Caesar cipher, monoalphabetic cipher, and Playfair cipher. Examples are provided to demonstrate how to encrypt and decrypt messages using these classical cipher techniques. The document concludes with assignments asking students to decrypt a ciphertext using Playfair cipher and implement Caesar cipher on Arabic letters.

Uploaded by

Mohamed Hany
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/ 42

CSC432: Information Security

Section 1
Week 1
Level four

Introduction to Information Security

Eng.Taghreed Salem
Agenda

Cryptography
Introduction algorithms

Examples on
CIA Triad Model Substitution cipher
algorithms

Security Structure Assignment 1


Scheme
Introduction

Information Security is a set of practices intended to keep data secure


from unauthorized access or alterations, both when it's being stored
and when it's being transmitted from one machine or physical location
to another.
protecting information and information systems from unauthorized
access, use, disclosure, disruption, modification, or destruction.
CIA Triad Model
Security Structure Scheme
Security Structure Scheme

• Plaintext : is the original message or data.

• Secret Key : is a value independent of the Plaintext and of the algorithm.

• Ciphertext : This is the Scrambled message produced as output


Security Structure Scheme

• Encryption Algorithm : is a mathematical procedure for performing encryption on data.

• Decryption Algorithm : is a mathematical procedure for performing decryption on data.


Key Properties

Shorter keys= faster processing, but less secure

Longer keys=slower processing , but more secure


Key Properties
Single use key: (one time key)
• Key is only used to encrypt one message
Encrypted email : new key generated for every email

Multi use key: (many time key)


• Key used to encrypt multiple messages
Encrypted files : same key used to encrypt many files
Cryptography algorithms can be grouped into two main
areas:

Symmetric Encryption Asymmetric Encryption

Using a single, secret Using public and


cryptographic key. private key
Symmetric Encryption

• Best known as shared-secret key algorithms.


• The usual key length is (128, 192, or 256 bits)
• A sender and receiver must share a secret key.
• Faster processing because they use simple mathematical operations.
• Examples include DES,3DES,AES,IDEA,RC2/4/5/6,andBlowfish.
Symmetric Encryption Techniques
Symmetric Encryption Techniques

• A stream cipher is a symmetric key cipher where plaintext digits are


combined with a pseudorandom cipher digit stream(keystream).

• A block cipher is a symmetric key cipher in which a cryptographic key


and algorithm are applied to a block of data(for example,64 contiguous
bits)at once as a group rather than to one bit at a time.
Asymmetric Encryption

• Also known as public key algorithms


• The usual key length is 512– 4096 bits
• A sender and receiver do not share a secret key
• Relatively slow because they are based on difficult computational algorithms
• Examples include RSA , ElGamal , elliptic curves , and DH.
Simplified Model of Symmetric Encryption
Simplified Model of Symmetric Encryption

• Encryption algorithm: The encryption algorithm performs various


substitutions and transformations on the plaintext.

• Secret key: The secret key is also input to the encryption algorithm. The
key is a value independent of the plain text and of the algorithm. The
algorithm will produce a different output depending on the specific key
being used at the time.
Simplified Model of Symmetric Encryption

• Ciphertext: This is the scrambled message produced as output. It depends on


the plaintext and the secret key.

• Decryption Algorithm :This is essentially the encryption algorithm run in


reverse.it takes the cipher text and the secret key and produces the original
plaintext.
Simplified Model of Symmetric Encryption

Symmetric –key algorithms :are algorithms for cryptography that use the same
cryptographic keys for both encryption of plaintext and decryption of ciphertext.
Caeser Cipher

• The algorithm can be expressed as follows .For each plain text letter ,substitute the cipher text letter
C=E(3,p)=(p+3)mod 26

• A shift may be of any amount ,so that the general Caeser algorithm is
C=E(k,p)=(p+k)mod 26

• Where k takes on a value in range 1 to 25


• The decryption algorithm is simply
P=D(k,C)=(C-k)mod 26
Caeser Cipher(Encryption)

Encrypt the message p=“Hello "using Caeser Cipher ,given the key k=3.
C=(P+K) mod 26

C=(7+3) mod 26=10 ➔ K


C=(4+3) mod 26=7 ➔ H
C=(11+3)mod 26=14 ➔O
C=(11+3)mod 26=14 ➔O
C=(14+3)mod 26=17 ➔R
C=KHOOR
Caeser Cipher(Decryption)

Decrypt the Cipher text C=“KHOOR"using Caeser Cipher ,given the key k=3.
P=(C-K) mod 26

P=(10-3) mod 26=7 ➔ H


P=(7-3) mod 26=4 ➔ E
P=(14-3)mod 26=11 ➔L
P=(14-3)mod 26=11 ➔L
P=(17-3)mod 26=14 ➔O
P=HELLO
Try To Solve
Caeser Cipher

Encrypt the message p=“ dcodex “ using Caeser Cipher ,given the key k=3.
C=(P+K) mod 26
Solution
Caeser Cipher(Encryption)

p=“ dcodex “ , k=3.


C=(P+K) mod 26
P= d C=(3+3) mod 26=6 ➔ g
P=c C=(2+3) mod 26=5 ➔ f
P=o C=(14+3)mod 26=17 ➔r
P=d C=(3+3)mod 26=6 ➔g
P=e C=(4+3)mod 26=7 ➔h
P=x C=(23+3)mod 26=0 ➔a
C=gfrgha
Try To Solve
Caeser Cipher

Decrypt the cipher text =“ gfrgha “ using Caeser Cipher ,given the key k=3.
P=(C-K) mod 26
Solution
Caeser Cipher

C=“ gfrgha “, k=3.


P=(C-K) mod 26
C=g P=(6-3) mod 3= ➔ d
C=f P=(5-3) mod 26=2 ➔ c
C=r P=(17-3)mod 26=14 ➔o
C=g P=(6-3)mod 26=3 ➔d
C=h P=(7-3)mod 26=4 ➔e
C=a P=(0-3)mod 26 =(-3)+26=23➔x
P=dcodex
Monoalphabetic Cipher

• A monoalphabetic cipher uses fixed

• substitution over the entire message.


• Random Key
Monoalphabetic Cipher
Example:
Plain text alphabets: ABCDEFGHIJKLMNOPQRSTUVWXYZ
Cipher text alphabet: ZEBRASCDFGHIJKLMNOPQTUVWXY

P=ITEMS
Encoding
C=FQAIP

Decoding
P=ITEMS
Playfair Cipher
• The Play fair algorithm is based on the use of a 5x5 matrix of letters constructed using a keyword.
• In this case, the key word is monarchy.
Playfair Cipher
4 Rules:
1)If both letters are the same(or only one letter is left),add an "X“ after the first letter.
2)If the letters appear on the same row of your table, replace them with the letters to their immediate
right respectively.
3)If the letters appear on the same column of your table, replace them with the letters immediately
below respectively.
4)If the letters are not on the same row or column, replace them with the letters on the same row
respectively but at the other pair of corners of the rectangle defined by the original pair.
Playfair Cipher
P=Hide the gold in the tree stump(note the null“ used to separate the repeated“ s)
P=HI DE TH EG OL DI NT HE TR EX ES TU MP
K=playfair example
Playfair Cipher
How to build 5x5 Matrix(assuming that I and J are interchangeable),the table becomes(omitted letters in
red):
Playfair Cipher
P=HI DE TH EG OL DI NT HE TR EX ES TU MP
Playfair Cipher
P=HI DE TH EG OL DI NT HE TR EX ES TU MP
Playfair Cipher
P=HI DE TH EG OL DI NT HE TR EX ES TU MP
Playfair Cipher
P=HI DE TH EG OL DI NT HE TR EX ES TU MP
Playfair Cipher
P=HI DE TH EG OL DI NT HE TR EX ES TU MP
Playfair Cipher

C=BM OD ZB XD NA BE KU DM UI XM MO UV IF

the message “ Hide the gold in the tree stump “ becomes

" BM OD ZB XD NA BE KU DM UI XM MO UV IF "
Try To Solve
Play fair cipher

Encrypt the message p=“BALLOON "using Playfair Cipher ,given the key k=MONARCHY.
Solution
Play fair cipher

P=“BALLOON “, k=MONARCHY.

P= BA LX LO ON

BA : IB
LX : SU
LO :PM
ON :NA

C=IBSUPMNA
Assignment 1

1. Using Playfair Cipher how to decrepit the following ciphertext:


C=“BMODZBXDNABEKUD MUIXMMOUVIF”

2. How to implement Caesar Cipher technique on Arabic letters?


qyzdv2y
Thank You…
Any Question?

[email protected]

You might also like