Scribd
Upload
106 views27 pages

Cryptography and Network Security Msme

The document discusses cryptography and network security. It covers topics such as types of network security including transit and traffic security. It also discusses common security problems and attacks like authentication, non-repudiation, and integrity control. The document then provides an overview of cryptography, including the basic concepts of encryption and decryption. It describes classical cryptography techniques like symmetric and asymmetric encryption as well as examples of classical cipher techniques including Caesar cipher, Vigenere cipher, and Playfair cipher.

Uploaded by

santhosh n prabhu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
106 views27 pages

Cryptography and Network Security Msme

The document discusses cryptography and network security. It covers topics such as types of network security including transit and traffic security. It also discusses common security problems and attacks like authentication, non-repudiation, and integrity control. The document then provides an overview of cryptography, including the basic concepts of encryption and decryption. It describes classical cryptography techniques like symmetric and asymmetric encryption as well as examples of classical cipher techniques including Caesar cipher, Vigenere cipher, and Playfair cipher.

Uploaded by

santhosh n prabhu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 27

CRYPTOGRAPHY AND

NETWORK SECURITY

-BY SMITHA GV
Network Security
The security provided to the network is called network
security which at present is looming as a massive
problem.

There are two kinds of network security mainly as:


 Transit Security :
It just encrypts the packets to be transferred.
 Traffic Security :
It acts just as a screen between hosts and remote sites.
Problems and Attacks
There are few intertwined areas in network
security as:
 Authentication
 Non-Repudiation
 Integrity Control etc

The threats are classified into two categories:


 Passive Attack : Eaves dropping

 Active Attack :Modifies, Deletes, Replay or

introduce new messages into the stream.


Cryptography
 It is derived from the Greek work. Crypto
means “secret” graphy means “writing”.
 Cryptography is the ability to send information
between particulars in a way that it prevents
others from reading the data.
 The data is transferred by applying two
techniques by changing the plain text and
cipher texts as Encryption and Decryption.
PRINCIPLES & SERVICES OF
CRYPTOGRAPHY

The two fundamental principles of cryptography


are
 Messages must contain some Redundancy.

 Some method is needed to foil replay

attacks(validation of messages by timestamp)


The services provided by the cryptography are as
follows:
 Integrity checking

 Authentication

 Protection to the data

 Confidentiality of information etc.


Encryption and Decryption
 The way of converting the plain text to the
cipher text by means of few keys is called
encryption
 The way of converting the cipher text to plain
text by the use of keys that are suitable to it is
called as decryption.
Classical Cryptography
 Classical cryptography is based on the
mathematics and it relies on the computational
difficulty of factorizing large number.
 The security of classical cryptography is based
on the high complexity of the mathematical
problem for the instance factorization of large
number.
 In the classical cryptography the original data i.e.,
the plain text is transformed into the encoded
format i.e. cipher text.
 we can transmit this data through insecure
communication channels. A data string which
known as key is used to control the transformation
of the data from plain text to cipher text.
 This arrangement helps to keep data safe as it
required the key for extracting the original
information from the cipher text. Without the key
no one can read the data. In this technique it is
assumed that the only authorized receiver has the
key.
Classical Cryptography has two types of techniques:
 Symmetric Cryptography:
In the symmetric cryptography a single key is used for
encrypting and decryption the data. This encryption
key is private key. This is the limitation of this
encryption technique that this private key must be
distributed only among the authorized sender and
receiver.
Asymmetric Cryptography:
In the asymmetric cryptography a pair of key, i.e.,
public key and private key is used for encryption and
decryption. A sender can use its public key to encrypt
the data and on receiver end receiver can decrypt the
data by using its private key. This technique overcomes
the problem of key distribution.
 Examples of symmetric key cryptography
include AES, DES, and 3DES.
 Examples of Asymmetric key cryptography
include RSA
Classical ciphers
 In cryptography, a classical cipher is a type of
cipher that was used historically but for the
most part, has fallen into disuse. In contrast to
modern cryptographic algorithms, most
classical ciphers can be practically computed
and solved by hand.
Types of classical ciphers
 Substitution ciphers

 Transposition ciphers
Substitution Techniques
The Caesar Cipher technique is one of the
earliest and simplest methods of encryption
technique. It’s simply a type of substitution
cipher, i.e., each letter of a given text is replaced
by a letter with a fixed number of positions
down the alphabet. For example with a shift of
1, A would be replaced by B, B would become
C, and so on. The method is apparently named
after Julius Caesar, who apparently used it to
communicate with his officials. 
 The encryption can be represented
using modular arithmetic by first transforming
the letters into numbers, according to the
scheme, A = 0, B = 1,…, Z = 25. Encryption of a
letter by a shift n can be described
mathematically as. 
 Mathematical formula for ceaser cipher:
PT = (P+K) mod 26
CT = (P+K) mod 26
CEASER CIPHER
Example
1. Text : ATTACKATONCE
Shift: 4
Cipher: EXXEGOEXSRGI

2. Text : HELLO
Shift: 3
Cipher: ?????
Vigenere Cipher
 Vigenere Cipher is a method of encrypting alphabetic

text. It uses a simple form of polyalphabetic substitution.


A polyalphabetic cipher is any cipher based on
substitution, using multiple substitution alphabets. The
encryption of the original text is done using the Vigenère
square or Vigenère table.
 The table consists of the alphabets written out 26 times in

different rows, each alphabet shifted cyclically to the left


compared to the previous alphabet, corresponding to the
26 possible Caesar Ciphers.
 At different points in the encryption process, the cipher

uses a different alphabet from one of the rows.


 The alphabet used at each point depends on a repeating

keyword
Plain Text : Hello
Key : HI
HELLO
HIHIH
Cipher Text : omstv
Playfair cipher: Poly alphabetic
 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.
Encryption Technique
 For the encryption process let us consider the following example:

 The Playfair Cipher Encryption Algorithm: 

The Algorithm consists of 2 steps: 


 Generate the key Square(5×5): 
 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: 
 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
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: 
1. Pair cannot be made with same letter. Break the letter in
single and add a bogus letter to the previous letter.
 Eg : HELLO
 After Split Up: HE LX LO.
Here X is a bogus letter.
 Rules for Encryption: 
 If both the letters are in the same column: Take the letter
below each one (going back to the top if at the bottom).
 Diagraph: "me"
 Encrypted Text: cl
 Encryption: m -> c e -> l
Encryption on “me”

If both the letters are in the same row: Take the letter to
the right of each one (going back to the leftmost if at
the rightmost position).
For example: 
Diagraph: "st"
Encrypted Text: tl
Encryption: s -> t t -> l
Encryption of st

If neither of the above rules is true: Form a rectangle


with the two letters and take the letters on the
horizontal opposite corner of the rectangle.
Diagraph: "nt"
Encrypted Text: rq
Encryption: n -> r t -> q
Encrytion of nt
Example:
 Plain Text : Instruments

 After Split : in st ru me nt sz

You might also like