Describe in Detail The Following Classical Cryptosystems With An Example Shift Cipher
Describe in Detail The Following Classical Cryptosystems With An Example Shift Cipher
Describe in Detail The Following Classical Cryptosystems With An Example Shift Cipher
multiplicative cipher
Caesar chip technology requires the translation of the values into numbers using a simple basic
addition or subtraction process to encrypt and decrypt symbols. It is called a wrap-around
situation if multiplication is used to translate to cypher text.
The benefit of a multiplicative cypher is that it can operate with very large keys, such as
8,953,851. For a machine to brute-force via a majority of nine million keys will take quite a long
time.
For example:
“In this case we take each letter (P) and multiple it by a value (a). For example "c" becomes 2,
and multiplied by 2 gives 4, which gives "e". As the value may be greater than 25, we take a
modulu 26 operation to make sure we end up with a letter, such as”:
C = (a * P) mod 26
affine cipher
An affinity cipher is an example of a substitute cypher: in encryption using a replacement cipher
a particular letter is often substituted with the same ciphertext when a similar letter appears in the
plaintext. For example, each time it happens, the plaintext letter 'e' can be replaced by the
ciphertext letter 'K'. The method used for this substitution in affine encryption can be interpreted
using a shift cipher as a generalization of the method used for encryption. A special type of
affine cipher is shift ciphers.
For example
Suppose that we want to encrypt the "beach" message with a refined encryption key cypher (3,
1). i. We can represent the letters in our 'beach' message with their corresponding numbers using
the table: 1 4 0 2 7. Hii. ii. Now we multiply the first number in the encryption key with each of
the numbers from step I (3 in this case), to get: 3 12 0 6 21. It. iii. Next, in the encryption key,
add the second number, (1 in this case), to each of the numbers from phase ii to get: 4 13 1 7 22.
iv. iv. In order to obtain the ciphertext, use the table to substitute the numbers from step iii with
their corresponding letters: ENBHW.
Vigenere cipher
Vigenere Cipher is an alphabetical text encryption method. It utilizes a simple polyalphabetic
substitution form. Any cypher based on substitution, using several replacement alphabets, is a
polyalphabetic cypher. The original text is encrypted using the Vigenère square or Vigenère
table.
“For example:
Input : Plaintext : GEEKSFORGEEKS
Keyword : AYUSH
Output : Ciphertext : GCYCZFMLYLEIM
For generating key, the given keyword is repeated in a circular manner until it matches the length
the plain text”.
The keyword "AYUSH" generates the key "AYUSHAYUSHAYU"
substitution cipher
It is called encryption to cover such data. It becomes unreadable when plain text is encrypted and
it is known as ciphertext. In the Replacement cypher, any plain text character from a given fixed
set of characters is replaced, depending on the key, by some other character from the same set.
With a shift of 1, for example, A would be replaced by B, B would become C, and so on.
Sherlock Holmes
Sir Arthur Conan Doyle invented the Dancing Men's cipher, featuring in his storey 'The Men's
Adventure.' Sherlock Holmes learns in this tale that the dancing figures are a hidden cypher and
the code is broken. The tale does not cover all the letters, but Aage Rieck Sørensen, who also
inserted numerals, completed the alphabet.
The Dancing Men cypher derived from Sir Arthur Conan Doyle's Sherlock Holmes novel, The
Adventure of the Dancing Men.
Sherlock Holmes investigates the events of the dancing figures in the novel, and discovers that it
is a cypher of substitution. By frequency analysis, he then cracks the code.
In the novel, not all letters appear. For several years, Sherlock Holmes fans have attempted to
find a pattern. In the cypher, a Danish scholar, Aage Rieck Sørensen, found a secret pattern and
inserted the letters (and numerals) that were missing.
Playfair cipher
The Playfair cypher was the first practical cypher to substitute the graph. Charles Wheatstone
invented the scheme in 1854, but it was named after Lord Playfair, who encouraged the use of
the cypher. We encrypt a pair of alphabets(digraphs) instead of a single alphabet in playfair
cypher as opposed to conventional cypher.
“For example:
The key is "monarchy"
Thus the initial entires are
'm', 'o', 'n', 'a', 'r', 'c', 'h', 'y'
followed by remaining characters of
a-z(except 'j') in that order.”
ADFGX cipher
During World War I, the ADFGVX cypher was used in the field by the German army. It was an
extension of the previous ADFGX Cipher that performed in a somewhat similar manner. Colonel
Fritz Nebel invented it, and it combines an adapted Polybius Square with Columnar
Transposition (in much the same way as Fractionated Text Transposing).
The Polybius Square was used in the same way as usual, but the letters ADFGX for a 5x5 grid or
ADFGVX for a 6x6 grid were the row and column headings. The V was applied to the original
ADFGX Cipher to make it simple to encrypt all 26 letters and the 10 digits (before these digits
would be left as digits and only transposed, reducing security).
one-time pads
One-time pad cypher is a type of Vignere cipher that has the following functionality −
It is a cypher that is unbreakable.
The key is exactly the same as the message length that is encoded.
Because of this, a cryptanalyst's encrypted message would be prone to assault. The key used for
the one-time pad cypher, as it is written on paper pads, is called the pad.
A user needs to write a key underneath the plaintext to encrypt a message. On the top and the
main letter on the left, the plaintext letter is located. A plain text is the cross section reached
between two characters. The example below explains it.
Enigma Machine
The Enigma code was initially broken by the Poles, led by the mathematician Marian Rejewski
in the beginning of the 1930s, in order to encode the strategic messages of the German military
command, before and during the second world war .. In 1939 the Poles gave knowledge to
British civilians, who formed a hidden, Ultra-known code-breaking squad, under mathematician
Alan M. Turing, with an increasing possibility of German invasion. Ultra also led to Allied
victories in the Pacific because the Germans exchanged their encryption system with the
Japanese.