Scribd
Upload
4 views12 pages

Chap-9.-Cryptology

Uploaded by

Ayresh Sheyn
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
4 views12 pages

Chap-9.-Cryptology

Uploaded by

Ayresh Sheyn
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/ 12

Cryptology

Cryptology

Related to codes on books and grocery items are


secret codes.

Cryptology is the study of making and breaking


secret codes
Plaintext is a message before it is coded.

Ciphertext is the message after it has been written in code.

Example
Plain text: LOVE Ciphertext : ORYH

The method of changing from plaintext to ciphertext is called


encryption.
Formula for Encryption (Encoding)

c = (p + m) mod 26
where
c = the numerical equivalent of the cipher text letter

p = the numerical equivalent of the plain text letter

m = cyclical encrypting code


Numerical Equivalent for Letters of the
English Alphabet
Encoding Catherine the Great

c = (p + m) mod 26

Suppose m = 11 (cyclical encrypting code).


Encoding Catherine the Great
c = (p+m) mod 26
Suppose m = 11 (cyclical encrypting code)
C corresponds to the number 3, hence p = 3
c = (3 + 11) mod 26 = 14 mod 26 and 14 N.
Therefore, C (plaintext) N (ciphertext)

A corresponds to the number 1, hence p = 1


c = (1+11)mod 26 = 12 mod 26 and 12 L
Therefore, A (plaintext) L (ciphertext)
Plaintext: CATHERINE THE GREAT

Cipher text: NLESPCTYP ESP RCPLE


Formula for Decryption (Decoding)
p = (c + n) mod 26
Where
p = numerical equivalent of plaintext letter
c = numerical equivalent of the ciphertext letter
n = may vary depending on the cyclical encrypting code
n = 26 - m
For the cyclical code, the congruence is p = c + n mod 26, where p and c are
defined as before and n = 26 - m. The letter N in ciphertext (refer to given
example) is decoded below using the congruence p = (c + n) mod 26.
Since m = 11, hence n = 26 – 11 = 15;
Since N = 14,
p = (14 +15) mod 26
p = 29 mod 26
p = 3 mod 26
p = 3. The 3rd letter is C. Thus N is decoded as C.
TRY THIS:

a. Encode CENTRAL. (Use m = 7)

b. Decode IJYJHYNAJ. (Use m = 5)

You might also like