0% found this document useful (0 votes)
7 views

Cryptography

Uploaded by

swaralibarve1
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)
7 views

Cryptography

Uploaded by

swaralibarve1
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/ 20

CRYPTOGRAPHY

PRESENTATION

By 3RD GROUP (15-21)


Cryptography is the process of hiding or coding

INTRODUCTION
information so that only the person a message was
intended for can read it. The art of cryptography has been
used to code messages for thousands of years and continues
to be used in bank cards, computer passwords, and
ecommerce.

A common cryptography definition is the practice of


coding information to ensure only the person that a
message was written for can read and process the
information. This cybersecurity practice, also known as
cryptology, combines various disciplines like computer
science, engineering, and mathematics to create complex
codes that hide the true meaning of a message.
CRYPTOGRAPHY IN ANCIENT INDIA

In ancient India, cryptography was


used in Indian mythological text
like hymns and lyrics for hiding
text. Some of the methods of were
as follows:
KaTaPaYaDi Sankhya

KaTaPaYaDi is used in Sanskrit


texts as a hashing technique. Each
consonant of an Indian language is
assign a number in this Katapayadi
system as follows:
Suppose we want to hash the word ‘Bharat’, the
number based on katapayadi system would be then as
follows for ‘Bharat’
Bha= Bha = 4
Ra = Ra = 2
T = ta = 6
Therefore, number 624 represents Bharat Indian
hashes are reversed numbers that is why written 624
and Not 426.
RAMSHALAKA
Ramshalaka is transposition substitution cryptography. As shown in
column 1 of table 2 “Ramshalaka uses nine stanzas or chopai of
Philosophical meaning, from which solution to any
actions/questions related to our activities and lives are incidental and
in-built, in a square matrix of size 15x15” [1]. Shalaka means matrix,
and this shalaka was use by Ram who was famous king and god in
Indian mythology ‘Ramayana’. Ram used this technique to find
answers questions of that is why it called as Ramshalaka
Verses generally called stanza or rhymes are in first column of Table
3. These verses are broken into independent ‘akshar’ (Hindi
characters) as shown in third column of Table 3 and these all akshars
creates 15x15 matrix, which is actual shalaka. It is difficult to find or
recognize verses from table as that are in matrix form. This means
Juliana Silva
actual text can kept hidden in Shalaka and all the hidden stanzas can
Client
be decrypted using some key. In shalaka, order of characters of
original text was changed. From Table 4 and Table 5 encrypted
technique is visible. While encrypting first character is taken from
each, of nine chopais after first character finishes form all stanzas,
second character from each chopai is taken and similarly this
procedure is followed to form 15x15 matrix.
Bhutasamkhya system
Bhutasamkhya system is a method of representing numbers using words having
meanings of numerical values. Bhutasamkhya system words chosen from Sanskrit
language from which words chosen to replace for numbers. The number 2 represented
with the word "eye" as every human being has two eyes. Similarly, number “32”
represented by word “Teeth”.
Small numbers represented by single words. Where sentences used for representing
large numbers. To decode numbers from sentences, digits written from left to right.
Varahamihira [2](505 – 587 CE), an Indian astronomer, mathematician, and
astrologer, encoded this number as “kha kha aṣṭi yamaḥ”. The individual words in
this are "kha", "kha", "aṣṭi" and "yamāḥ" and they denote numbers "0", "0", "61" and
"2" respectively. To obtain number indicated by kha-kh-aṣṭi-yamaḥ, the numbers
need to arrange in the reverse order, as "2", "16","0","0". Placing numbers side by side,
we get the number 21600.
SERVICE
KAUTILAYAMA

“Kautilayama in which letters were substituted


based on phonetic relation” and other is there had
been development of another version of private
messaging such as methods based on knowledge of
vernaculars and messaging by wrist-finger gesture
known as akshar mustika kathanam.
MULADIVAYA

“Muladivaya is technique in which paired letters were used as


cryptographic unit.”
ARYABHATA’S
SUBSTITUTION CODE
Aryabhata’s Substitution Code is a plotting of numbers to
words that divided into two groups of consonants and
vowel.
First 25 consonants called varga letters of Sanskrit alphabet
are:
Other remaining 8 consonants are avarga letters:
The varga letters (k to m) represents squares such as 1, 100, 10000,
The avarga letters (y to h) represents non- squares such as 10, 1000
This creates a notational system in place values for numbers as large
as 10^17:
A letter is to be insert next to its vowel. For example: if number 4652
is

GOOD ENGINEER

Therefore, number 4652 will; be represented by 4652 = ghicinikhimore.


GUDHAYOJYA

Gudhayojya was a basic method of changing meaning of true


content of spoken messages. In this method of cryptography,
unnecessary letters added at beginning or at end of each word,
so its original meaning was changed. For example to change
meaning of statement “I truly believe in lord Ganesha” on may
add letter “ish” at beginning of each word, So sentence become
“ishI ishtruly ishbelieve ishin ishlord ishGanesha”, The real
content of sentence got changed.
TYPES OF CRYPTOGRAPHY
There are three cryptography types, which are distinguished
by the types of cryptographic algorithms they use to scramble
data. Most types of cryptography use algorithms called keys
that scramble and unscramble, or code and decode, data.

Here are the different types of cryptography: Hash Functions: Hash functions don’t rely on
keys. Instead, they scramble data of varying
size into values of uniform length. With hash
Secret Key Cryptography: A secret key is used to both
functions, both a one-word message and a
encrypt and decrypt the data. The sender includes the
1000-page novel create a fixed-sized output of
secret key in the coded message sent to the intended
encoded text (called a hash value), making it
recipient. If the message is intercepted, the included key
nearly impossible to determine the original
can decode its contents. content. Commonly using the MD5 hashing
algorithm, hashing is often used for
Public Key Cryptography: The sender uses a public key to authentication purposes.
encrypt the message, and the receiver uses a private key to
decrypt it. If the message is intercepted, the contents can’t
be deciphered without the private key.

.
Application of matrices in cryptography

Encryption dates back approximately 4000 years. Historical accounts indicate that the Chinese,
Egyptians, Indian, and Greek encrypted messages in some way for various purposes. One famous
encryption scheme is called the Caesar cipher, also called a substitution cipher, used by Julius
Caesar, involved shifting letters in the alphabet, such as replacing A by C, B by D, C by E, etc, to
encode a message. Substitution ciphers are too simple in design to be considered secure today.
In the middle ages, European nations began to use encryption. A variety of encryption methods

DATA
were used in the US from the Revolutionary War, through the Civil War, and on into to modern
times.
With the advent of the computer age and internet communication, the use of encryption has
become widespread in communication and in keeping private data secure; it is no longer limited
to military uses. Modern encryption methods are more complicated, often combining several
steps or methods to encrypt data to keep it more secure and harder to break. Some modern
methods make use of matrices as part of the encryption and decryption process; other fields of
mathematics such as number theory play a large role in modern cryptography.
.To use matrices in encoding and decoding secret messages, our procedure is as follows.

We first convert the secret message into a string of numbers by arbitrarily assigning a number
to each letter of the message. Next we convert this string of numbers into a new set of numbers
by multiplying the string by a square matrix of our choice that has an inverse. This new set of
numbers represents the coded message.
To decode the message, we take the string of coded numbers and multiply it by the inverse of
the matrix to get the original string of numbers. Finally, by associating the numbers with their
corresponding letters, we obtain the original message.
In this section, we will use the correspondence shown below where letters A to Z correspond to
the numbers 1 to 26, a space is represented by the number 27, and punctuation is ignored.
EXAMPLES
To encrypt a message using matrix cryptography with the value "h=8" and a message, you would typically use
a matrix encryption key. Let's consider a basic example:

First, let's choose a 2x2 matrix as our encryption key, say:


Key Matrix (K):
|2 1|
|1 3|
Message to Encrypt:
Let's use a simple message, such as "HELLO," and represent it as a sequence of numeric values based on the
position of each letter in the alphabet. For "HELLO," we get [8, 5, 12, 12, 15].
Encryption Process:
To encrypt each letter of the message, we'll multiply the Key Matrix (K) by the corresponding numeric value
of the letter:

Encrypt 'H' (8):


| 2 1 | | 8 | = | (2*8 + 1*8) | = | 24 |
|1 3| | | | (1*8 + 3*8) | | 32 |
Encrypt 'E' (5):
| 2 1 | | 5 | = | (2*5 + 1*5) | = | 15 |
|1 3| | | | (1*5 + 3*5) | | 20 |
The encrypted message:
The encrypted numeric values of the message "HELLO" are [24, 15, 47, 47, 85].
To decrypt the message "HELLO" that was encrypted using the Key Matrix (K) with the value "h=8,"
you would need the inverse of the Key Matrix (K)^(-1). Since we previously used the Key Matrix:
|2 1|
|1 3|

Let's calculate its inverse, and then we can decrypt the message.
Calculate the Inverse of Key Matrix (K)^(-1):
The inverse of a 2x2 matrix can be calculated as follows:
|a b| | 3 -1 |
| c d | -> | -1 2 |
Now, to encrypt "a" using matrix cryptography, we'll multiply the Key Matrix (K) by the numeric
representation of "a" (1):
| 2 1 | | 1 | = | (2*1 + 1*1) | = | 3 |
Juliana Silva
|1 3| | | | (1*1 + 3*1) | |4|
Client
So, the encrypted value of "a" is represented by the matrix [3, 4].
To decrypt, you would need the inverse of the Key Matrix (K)^(-1) and multiply it by the encrypted
matrix to obtain the original value
Encrypting above message
The super hi-tech LOCK used is

LOCK is a rectangular array of numbers in rows and columns, and are asked to write
down the special name of such an array of numbers, as well as its order
First encode message in group:
result:

Now what has happened is that the letters P, L and E, which are originally given the codes 16, 12 and 5
respectively, have now ended up being correspondingly represented by the codes 21, –4 and 22. So numbers
21 and 22 can be converted directly into the codes U and V respectively based on the coding system given in
Table 1. That is to say, the letters U and V become the corresponding encrypted codes for P and E. However,
there is a problem here in such a technique. The number –4 cannot be converted because none of the codes
in Table 1 corresponds to it So we resolves this problem by reducing –4 modulo 30 to obtain 26. That is,
In other words,

which is represented by

in the beginning, is now encrypted and


translated into
similarly we can find rest code
final result is as follows:

You might also like