Debark

univer
sity

College of natural science

Department of computer science
Title computer security
Group assignment
Member name id
1.Fentahun shibeshi ---------
2.mastewal desalegne--------
3.solomon sisay---------------
4.elesa demoz-----------------
5.mebratu ----------------
  Cipher Mono Alphabet algorithm
is a type of encryption method that uses a single alphabet to encode
and decode messages.
The substitution cipher is the oldest forms of encryption algorithms
according to creates each character of a plaintext message and require
a substitution process to restore it with a new character in the ciphertext.
This substitution method is deterministic and reversible, enabling the
intended message recipients to reverse-substitute ciphertext characters
to retrieve the plaintext.
The specific form of substitution cipher is the Monoalphabetic
Substitution Cipher, is known as “Simple Substitution Cipher”.
Monoalphabetic Substitution Ciphers based on an individual key
mapping function K, which consistently replaces a specific character α
with a character from the mapping K (α).
A mono-alphabetic substitution cipher is a type of substitution ciphers in
which the equivalent letters of the plaintext are restored by the same
letters of the ciphertext. Mono, which defines one, it signifies that each
letter of the plaintext has a single substitute of the ciphertext.
Caesar cipher is a type of Monoalphabetic cipher. It uses the similar
substitution method to receive the cipher text characters for each plain
text character. In Caesar cipher, it can see that it is simply for a hacker
to crack the key as Caesar cipher supports only 25 keys in all. This pit is
covered by utilizing Monoalphabetic cipher.
In Monoalphabetic cipher, the substitute characters symbols supports a
random permutation of 26 letters of the alphabet. 26! Permutations of
the alphabet go up to 4*10^26. This creates it complex for the hacker to
need brute force attack to gain the key.
Mono-alphabetic cipher is a type of substitution where the relationship
among a symbol in the plaintext and a symbol in the cipher text is
continually one-to-one and it remains fixed throughout the encryption
process.
The substitution cipher is the oldest forms of encryption algorithms
according to creates each character of a plaintext message and require
a substitution process to restore it with a new character in the ciphertext.
This substitution method is deterministic and reversible, enabling the
intended message recipients to reverse-substitute ciphertext characters
to retrieve the plaintext.
The specific form of substitution cipher is the Monoalphabetic
Substitution Cipher, is known as “Simple Substitution Cipher”.
Monoalphabetic Substitution Ciphers based on an individual key
mapping function K, which consistently replaces a specific character α
with a character from the mapping K (α).
A mono-alphabetic substitution cipher is a type of substitution ciphers in
which the equivalent letters of the plaintext are restored by the same
letters of the ciphertext. Mono, which defines one, it signifies that each
letter of the plaintext has a single substitute of the ciphertext.
Caesar cipher is a type of Mono alphabetic cipher. It uses the similar
substitution method to receive the cipher text characters for each plain
text character. In Caesar cipher, it can see that it is simply for a hacker
to crack the key as Caesar cipher supports only 25 keys in all. This pit is
covered by utilizing Monoalphabetic cipher.
In Monoalphabetic cipher, the substitute characters symbols supports a
random permutation of 26 letters of the alphabet. 26! Permutations of
the alphabet go up to 4*10^26. This creates it complex for the hacker to
need brute force attack to gain the key.
Mono-alphabetic cipher is a type of substitution where the relationship
among a symbol in the plaintext and a symbol in the cipher text is
continually one-to-one and it remains fixed throughout the encryption
process.
 The working principle of this algorithm
involves replacing each letter of the message with a
corresponding letter from the same alphabet. For example, if the
alphabet used is "abcdefghijklmnopqrstuvwxyz", the letter "a"
could be replaced with "d", "b" with "e", and so on. This
substitution process makes it difficult for unauthorized individuals
to read the message without the key to decrypt it. The algorithm
can be made more secure by using a longer and more complex
alphabet, or by adding additional layers of encryption.
 A poly-alphabetic cipher
 A polyalphabetic cipher is a type of encryption method that uses
multiple alphabets to encode a message. Each letter in the
plaintext message is replaced by a corresponding letter in one of
the alphabets, depending on its position in the message. This
makes it more difficult for someone to decipher the message, as
they would need to know which alphabet was used for each letter.
One example of a polyalphabetic cipher is the Vigenère cipher.
is any cipher based on substitution, using several substitution
alphabets. In polyalphabetic substitution ciphers, the plaintext
letters are enciphered differently based upon their installation in
the text. Rather than being a one-to-one correspondence, there is
a one-to-many relationship between each letter and its substitutes.
For example, ‘a’ can be enciphered as ‘d’ in the starting of the
text, but as ‘n’ at the middle. The polyalphabetic ciphers have the
benefit of hiding the letter frequency of the basic language.
Therefore attacker cannot use individual letter frequency static to
divide the ciphertext.
The first Polyalphabetic cipher was the Alberti Cipher which was
introduced by Leon Battista Alberti in the year 1467. It used a
random alphabet to encrypt the plaintext, but at different points
and it can change to a different mixed alphabet, denoting the
change with an uppercase letter in the cipher text.
It can utilize this cipher, Alberti used a cipher disc to display how
plaintext letters are associated to cipher text letters. In this cipher,
each ciphertext character based on both the corresponding
plaintext character and the position of the plaintext character in
the message.
As the name polyalphabetic recommend this is achieved by using
multiple keys rather than only one key. This implies that the key
should be a stream of subkeys, in which each subkey depends
somehow on the position of the plaintext character that needs subkey
for encipherment.
The working principle of this algorithm
Let each letter of the encryption key denote a shifted Caesar cipher, the
shift corresponding to the key. Since, in general, the encryption key will
be shorter than the message to be encrypted, for the Vigenere cipher
the key is repeated as required. For example, the key here is the string
"abracadabra". Now a plaintext message may be encrypted as follows
key: a b r a c a d a b r a a b r a c a d a b r a
plaintext: c a n y o u m e e t m e a t m i d n i g h t
ciphertext: C B E Y Q U P E F K M E B K . . . . . . .
 The Hill cipher
is a type of encryption method that uses matrix operations to encode a
message. It was invented by Lester S. Hill in 1929. The cipher works by
breaking the message into blocks of a fixed size, and then converting
each block into a matrix of numbers. The matrix is then multiplied by a
key matrix to produce a new matrix, which is converted back into a block
of letters. The key matrix is chosen by the sender and must be invertible.
The receiver uses the inverse of the key matrix to decode the message.
The Hill cipher is more secure than simple substitution ciphers, but it can
be vulnerable to attacks if the key matrix is not chosen carefully.
Hill cipher is a polygraphic substitution cipher based on linear
algebra.Each letter is represented by a number modulo 26. Often the
simple scheme A = 0, B = 1, …, Z = 25 is used, but this is not an
essential feature of the cipher. To encrypt a message, each block of n
letters (considered as an n-component vector) is multiplied by an
invertible n × n matrix, against modulus 26. To decrypt the message,
each block is multiplied by the inverse of the matrix used for encryption.
The matrix used for encryption is the cipher key, and it should be
chosen randomly from the set of invertible n × n matrices (modulo 26).
The working principle of this algorithm
Input: Plaintext: ACT
Key: GYBNQKURP
Output: Cipher text: POH
 
Input: Plaintext: GFG
Key: HILLMAGIC
Output: Cipher text: SWK
We have to encrypt the message ‘ACT’ (n=3).The key is
‘GYBNQKURP’ which can be written as the nxn matrix: 
 
The enciphered vector is given as: 
 

which corresponds to ciphertext of ‘POH’ 

 The Playfair cipher
is a type of encryption method that uses a 5x5 grid of letters to encode
a message. It was invented by Charles Wheatstone in 1854, but was
later popularized by Lord Playfair. The cipher works by breaking the
message into pairs of letters, and then encoding each pair using the
positions of the letters in the grid. If the two letters are in the same row,
they are replaced by the letters to their right, wrapping around to the
beginning of the row if necessary. If the two letters are in the same
column, they are replaced by the letters below them, wrapping around
to the top of the column if necessary. If the two letters are not in the
same row or column, they are replaced by the letters in the same row,
but in the column of the other letter, and vice versa. The Playfair cipher
is more secure than simple substitution ciphers, but can still be
vulnerable to attacks if the key is not chosen carefully.
The Playfair cipher was the first practical digraph substitution cipher.
The scheme was invented in 1854 by Charles Wheatstone but was
named after Lord Playfair who promoted the use of the cipher. In
playfair cipher unlike traditional cipher we encrypt a pair of
alphabets(digraphs) instead of a single alphabet.
It was used for tactical purposes by British forces in the Second Boer
War and in World War I and for the same purpose by the Australians
during World War II. This was because Playfair is reasonably fast to
use and requires no special equipment.
The Playfair Cipher Encryption Algorithm: 
The Algorithm consists of 2 steps: 
1. Generate the key Square(5×5): 
The key square is a 5×5 grid of alphabets that acts as the key for
encrypting the plaintext. Each of the 25 alphabets must be unique and
one letter of the alphabet (usually J) is omitted from the table (as the
table can hold only 25 alphabets). If the plaintext contains J, then it is
replaced by I. 
 
The initial alphabets in the key square are the unique alphabets of the
key in the order in which they appear followed by the remaining letters
of the alphabet in order. 
 
2. Algorithm to encrypt the plain text: The plaintext is split into pairs
of two letters (digraphs). If there is an odd number of letters, a Z is
added to the last letter. 
For example: 
 
PlainText: "instruments"
After Split: 'in' 'st' 'ru' 'me' 'nt' 'sz'
Example

Sure, let's say our keyword is "CRYPTO" and we want to encrypt the
message "HELLO WORLD".

First, we create the 5x5 grid using the keyword and any remaining
letters in alphabetical order:

CRYPTOABDEFGHIKLMNQSUVWXZ

Next, we break the message into pairs of letters and apply the encoding
rules:

HE LX LO WO RL D -> HE LX LO WO RL DX

Using the grid, we can encode each pair as follows:

HE -> YP LX -> TR LO -> YP WO -> UO RL -> QK DX -> ZV

So the encrypted message would be "YPTRYPYPUOQKZV".

To decrypt the message, the receiver would use the same grid and
process in reverse.