APPLICATION OF CRYPTOGRAPHY

Cryptography: it is the art and science of achieving security by encoding messages

to make them non-readable.

Application of cryptography:
 DIGITAL SIGNATURE

Data Hiding: The original use of cryptography is to hide something that has

been written.

Digitally Code: Cryptography can also can be applied to software, graphics or

voice , it can be applied to anything that can be digitally coded.

Electronic payment: When electronic payments are sent through a network, the

biggest risk is that the payment message will alter. Cryptographic technique will

reduce such risk.

Message Authentication: One cannot entirely prevent someone from tampering with the network and
changing the message, but if this happens it can certainly be detected. This process of checking the integrity of

the transmitted message is often called message authentication.

 DEFINATIONS
• Plain Text :
• Plain text is nothing but a original text which is in readable form
and to which we want to convert into unreadable form before
transmission.

• CipherText:
• Unreadable text OR Understandable text.

• Enciphering or encryption:
• The process by which plaintext is converted into ciphertext.
 DEFINATIONS
• . Deciphering or Decryption:
• Recovering plaintext from cipher text.
 CRYPTOGRAPHY

Cryptography is the art and science of achieving

security by encoding readable messages to
make them non-readable

Cryptograph
Readable Unreadable
ic
message message
ALGORITHM
 DEFINATIONS

• Plain text : It is also knows as a clear text, means anyone who

knows the language can easily read the message.

• Encryption:
The process of encoding plain text into cipher text message is known
as Encryption.

• Decryption:
The process of transforming cipher text message into plain text or
original text is known as Decryption.

 KEY : A cryptographic key is a string of bits used by

a cryptographic algorithm to transform plain text into cipher text or
vice versa. This key remains private and ensures secure
communication
 DEFINATIONS

• Cipher Text:
--When a plain text message is codified using any suitable
scheme/method , the resulting message is called as cipher text.
Sender…plain text…Encrypt…..cipher text
Receiver….cipher text….decrypt…plain text

• Cryptanalysis
Cryptanalysis is the technique of decoding messages from a non-
readable format back to readable format.( without knowing how they
were initially converted from readable format to non-readable format )

Unreadable cryptanalys Readable

message is message
 DEFINATIONS

• Cryptology :

It is a combination of cryptography and

cryptanalysis.
 CLASSICAL ENCRYPTION TECHNIQUES

##Substitution Ciphers

• Caesar cipher
• Monoalphabetic ciphers
• Playfair cipher
• Polyalphabetic ciphers
##Transposition (permutation) Ciphers

• Rail Fence Cipher

• Columnar Transposition Cipher
 CAESAR CIPHER
• Caesar Cipher The earliest known, and the simplest, use of a substitution cipher was by

Julius Caesar.

• The Caesar cipher involves replacing each letter of the alphabet with the letter standing

three places further down the alphabet.

• For example,

• Plain: MEET ME AFTER THE TOGA PARTY

• Cipher: PHHW PH DIWHU WKH WRJD SDUWB

• Note that the alphabet is wrapped around, so that the letter following Z is A.

• We can define the transformation by listing all possibilities, as follows:

• Plain: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

• Cipher: D E F G H I J K L M N O P Q R S T U V W X Y Z A B C
 MONO-ALPHABETIC CIPHERS

 Major drawback of the Caesar cipher is its predictability.

 In mono alphabetic ciphers instead of using uniform scheme

for all the alphabets in a given plain text messages, we decide

to use random substitution

 This means that in a given plain text message, each ‘A’

can replace by any other alphabet (B through Z).

 The crucial difference being there is no relation between

replacement of B and replacement of A.

 MONO-ALPHABETIC CIPHERS

PLAIN TEXT: INFORMATION SECURITY

CIPHER TEXT: FCKMUHEBFMC WAXSUFBP

 HOMOPHONIC SUBSTITUTION CIPHER

Homophonic Substitution Cipher:-

 It is similar to mono alphabetic cipher.

The only difference in homophonic substitution

cipher is ‘A’ can be replaced by any character (‘A’ CAN BE

REPLACED BY A ALSO.)
 POLYGRAM SUBSTITUTION CIPHER

• In Polygram Substitution cipher instead of replacing one

plain text alphabet with one cipher text alphabet at a time, a
block of alphabets are replaced with another block.
• This is done by replacing a block with completely different
cipher text block
• Example : HILL Cipher
SYMMETRIC AND ASYMMETRIC CRYPTOGRAPHY
 Cryptography not only protects data from alteration/modifications, but it can also used
for authentication of user.
• There are different types of cryptographic algorithm and it is based on no. of keys that
are used for encryption and decryption.

There are TWO types of cryptographic algorithm / schemes :

1) secret key cryptography(symmetric) - uses single key for both encryption and
decryption.

2) Public key cryptography(asymmetric) – uses one key for encryption and another
for decryption
 Symmetric key cryptography: Involves the use of same key for encryption and
decryption.
• Asymmetric key cryptography : Involves the use of one key for encryption and
another, different key for decryption
SYMMETRIC CRYPTOGRAPHY/ENCRYPTION
SYMMETRIC CRYPTOGRAPHY/ENCRYPTION
 private-key / single-key/symmetric

 Symmetric encryption is a type of encryption where only one key (a secret key) is
used to both encrypt and decrypt electronic information.
 The symmetric encryption must exchange the key so that it can be used in the
decryption process.
 This encryption method differs from asymmetric encryption where a pair of keys,
one public and one private, is used to encrypt and decrypt messages.
 One of the chief weaknesses of symmetric key cryptography lies in the use of one
key.
 If the key is exposed beyond the sender and the receiver, it is possible for an
attacker to decrypt the message and can alter it, and pass it to the receiver in
place of the original message.
 Since such issues are present, symmetric key cryptography by itself provides only
confidentiality, and not integrity
SYMMETRIC CRYPTOGRAPHY/ENCRYPTION
**Encryption algorithm divided into two types:

 Block cipher

 Stream cipher

 Symmetric key cryptography makes use of two types of ciphers:

 A block cipher takes a predetermined number of bits, known as a block, in

the plaintext message and encrypts that block.
 Blocks are commonly composed of 64 bits but can be larger or smaller depending on
the particular algorithm being used
 A stream cipher encrypts each bit in the plaintext message, 1 bit at a time.

 It is also possible for a block cipher to act as a stream cipher by setting a block
size of 1 bit.
 A large majority of the encryption algorithms in use at present are block ciphers.
 Although block ciphers are often slower than stream ciphers, they tend to be more efficient.
ASYMMETRIC CRYPTOGRAPHY
 Public key cryptography(asymmetric) – uses one key for encryption and another
for decryption.
ASYMMETRIC CRYPTOGRAPHY
ASYMMETRIC CRYPTOGRAPHY
 asymmetric systems use two keys . One of the keys can be publicly shared (public key), while the
other must be kept in private (private key).

 Asymmetric algorithms are more complex and slower than the symmetric ones.

 Each party contain two keys.

– Public key & private key.

 One key used for encryption and another, different key for decryption.

• Also known as public key cryptography.

• Asymmetric encryption can be used for confidentiality, authentication, or both

• Asymmetric algorithms rely on one key for encryption and a different but related key for decryption.

 public key is published while the private key is kept secret.

 RSA (Rivest-Shamir-Adleman) -- the most widely used asymmetric algorithm

ASYMMETRIC CRYPTOGRAPHY
 Asymmetric encryption uses two keys to encrypt a plain text.
 Secret keys are exchanged over the Internet or a large network.
 It ensures that malicious persons do not misuse the keys.
 It is important to note that anyone with a secret key(SECOND KEY) can decrypt
the message and this is why asymmetrical encryption uses two related keys to
boosting security.
 A public key is made freely available to anyone who might want to send you a
message.
 The second private key is kept a secret so that you can only know.
 A message that is encrypted using a public key can only be decrypted using a private key
 Security of the public key is not required because it is publicly available and can be passed
over the internet.
 Asymmetric key has a far better power in ensuring the security of information transmitted
during communication.
 Popular asymmetric key encryption algorithm includes RSA, DSA(Digital Signature
Algorithm)
STEGANOGRAPHY
STEGANOGRAPHY
 In order to transmit the data from one host to another, the data is
supposed to be kept secure so that no one can read/alter the data in
between.
 To achieve that, there are several ways available that help us to
encrypt the data or modify the data
 steganography a special methodology that is used to protect the
data from the malicious user by hiding it.
 Steganography can be defined as the science of hiding the data like
file, image, video or any message to the other file, image, video or
message.
 In Steganography the useless bits are actually replaced by the useful
bits in order to hide the required file into any of the files or data
mentioned above.
 It plays a vital role in cybersecurity by allowing legitimate users or
peers to send the data in a way which is highly secured so that it
could be protected from the hacker or malicious users who are
intended to harm or abuse the system.
 It can be done using software that is available in the market for free
or paid.
STEGANOGRAPHY
 Steganography is the technique of hiding secret data within an ordinary or
non-secret file or message in order to avoid detection OR Steganography is
the art and science of embedding secret messages in such a way that no
one, apart from the sender and intended recipient, suspects the existence of
the message

 the secret data is then extracted at its destination.

 The use of steganography can be combined with encryption as an extra step for hiding
or protecting data.

 The word steganography is derived from the Greek words steganos (meaning hidden or
covered)

 Steganography can be used to conceal(hode) almost any type of digital content,

including text, image, video or audio content

 The content to be concealed through steganography -- called hidden text

STEGANOGRAOHY : Procedure
FORMULA FOR STEGANOGRAPHIC PROCESS:
COVER MEDIA + HIDDEN DATA(SECRET MESSAGE) + STEGO KEY = STEGO MEDIUM
STEGANOGRAPHY: procedure

 TERMINOLOGIES USED IN STEGNOGRAPHY

1)COVER MEDIUM: is the data or media (i.e text/audio data/video data) in which

we hide the secret message

2) MESSAGE: Also called as hidden data.it is a message which will be hidden in

cover media

3) STEGOMEDIUM : medium in which secret message is hidden

4)REDUNDANT BITS: Bits or Data in cover medium that can be modified without

compromising integrity
STEGANOGRAPHY
DIGITAL SIGNATURE

 A digital signature is an electronic, encrypted, stamp of authentication

on digital information such as email messages, macros, or electronic
documents. A signature confirms that the information originated from
the signer and has not been altered.
DIGITAL SIGNATURE
 1. Digital signature is a strong method of authentication in an electronic form.
 2. It includes message authentication code (MAC), hash value of a message and
digital pen pad devices. It also includes cryptographically based signature
protocols.
 3. Digital Signature is used for authentication of the message and the sender to
verify the integrity of the message.
 4. Digital Signature may be in the form of text, symbol, image or audio.
 5. In today's world of electronic transaction, digital signature plays a major role in
authentication. For example, one can fill his income tax return online using his
digital signature, which avoids the use of paper and makes the process faster.
 6. Asymmetric key encryption techniques and public key infrastructure are used in
digital signature.
 7. Digital signature algorithms are divided into two parts-

1). Signing part: It allows the sender to create his digital signature.
2). Verification part: It is used by the receiver for verifying the signature after
receiving the message.
Generation and Verification of digital signatures
 Generation and Verification of digital signatures:

 Working: 1. Message digest is used to generate the signature. The message digest (MD) is calculated from
the plaintext or message.

 2. The message digest is encrypted using user's private key.

 3. Then, the sender sends this encrypted message digest with the plaintext or message to the receiver

 4. The receiver calculates the message digest from the plain text or message he received.

 5. Receiver decrypts the encrypted message digest using the sender‟s public key. If both the MDs are not
same then the plaintext or message is modified after signing
Advantages of Digital Signatures

Advantages of Digital Signatures

 Speed: Businesses no longer have to wait for paper documents to be sent by

courier. Contracts are easily written, completed, and signed by all concerned
parties in a little amount of time no matter how far the parties are geographically.
 Costs: Using postal or courier services for paper documents is much more
expensive compared to using digital signatures on electronic documents.
 Security: The use of digital signatures and electronic documents reduces risks of
documents being intercepted, read, destroyed, or altered while in transit.
 Authenticity: An electronic document signed with a digital signature can stand up
in court just as well as any other signed paper document.
 Non-Repudiation: Signing an electronic document digitally identifies you as the
signatory and that cannot be later denied.
 Time-Stamp: By time-stamping your digital signatures, you will clearly know
when the document was signe
DES-DATA ENCRYPTION STANDARD
Describe DES algorithm with suitable example…
 Data Encryption Standard is symmetric block cipher which takes input of
64-bit plain text along with 64-bit key and process it, to generate the 64-
bit cipher text. The diagram below illustrates the working of DES.
DES:DATA ENCRYPTION STANDARD
 DES Encryption:-
 Step 1: In the first step the 64-bit plain text undergoes initial
permutation which rearranges the bits to produce two 32-bit permuted
block which is called left plain text (LPT 32-bit) and right plain text (RPT
32-bit).

 Step 2: Now, 16 rounds of DES encryption will be performed on this LPT

and RPT with a 56-bit key.

 Step 3: After the 16th round the 32-bit LPT and 32-bit RPT are integrated
which forms a 64-bit block again and then the final permutation is
applied to this 64-bit block, to obtain the 64-bit cipher text.
DES-DATA ENCRYPTION STANDARD
 Rounds in Data Encryption Standard :Each round of DES performs the
same function. So, below are the steps of the function performed in each round
of DES algorithm:
 1. Key Transformation: -In DES initial key size is 64-bit which is reduced to
the 56-bit key. This is done by discarding every 8th bit from the 64-bit key. So,
for each round of DES, this 56-bit key is used. In the key transformation step,
this 56-bit is transformed to the 48-bit key.
 2. Expansion Permutation: -In the first step of encryption, during the initial
permutation of DES, the 64-bit plain text is permuted and we have 32-bit LPT
and 32-bit RPT. Now, the expansion permutation is performed on the 32-bit RPT
which transforms it from 32-bit to 48- bit. The 32-bit LPT is untouched during
the process.
 3. S-box Substitution:-The input to S-box is 48-bit resultant block of
expansion permutation. In S-box substitution, the input 48-bit block is
transformed to 32-bit block
 4. P-box Permutation:- The 32-bit output obtained from s-box substitution is
provided as an input to P-box. Here, the 32-bit input is simply permuted and
send to the next step.
DES-DATA ENCRYPTION STANDARD
 5. XOR and Swap:-
In this step, the 32-bit LPT of the initial 64-bit plain text is XOR with the
output of P-box permutation. The result of the XOR is the new RPT for next
round and the old RPT is swapped with LPT.

DES Decryption:-
The same Data Encryption Standard algorithm used for encrypting the plain
text is also used to decrypting the cipher text. But the algorithm is
reversed, such as the initial and final permutation events are reversed.
Even the sequence of the sub keys applied in 16 rounds of DES is also
reversed.