Scribd
Upload
66 views9 pages

Pec It

The document provides information about Pratham Rai's course details and discusses cryptography concepts like plaintext, ciphertext, substitution and transposition techniques, encryption and decryption processes, symmetric and asymmetric encryption, key size and range, symmetric key algorithms like DES, IDEA, and RC5.

Uploaded by

Pratham Rai
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
66 views9 pages

Pec It

The document provides information about Pratham Rai's course details and discusses cryptography concepts like plaintext, ciphertext, substitution and transposition techniques, encryption and decryption processes, symmetric and asymmetric encryption, key size and range, symmetric key algorithms like DES, IDEA, and RC5.

Uploaded by

Pratham Rai
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/ 9

NAME – PRATHAM RAI

ROLL – 18700220055
SECTION – B
DEPARTMENT – IT
YEAR – 4TH
SEM – 8TH
SUBJECT - Cryptography and Network Security
SUBJECT CODE - PEC-IT801B
CRYPTOGRAPHY: CONCEPTS & TECHNIQUES

Definition: Cryptography is the science and art of securing communication by converting


information into a secret code, making it unintelligible to unauthorized users.

Purpose: Ensures confidentiality, integrity, and authentication of data.

Plaintext: Original, readable data or message


before encryption.

Ciphertext: Encrypted data, the result of applying


cryptographic algorithms to plaintext.
SUBSTITUTION TECHNIQUES & TRANSPOSITION TECHNIQUES

Substitution Techniques
Definition: Substituting elements of plaintext with other
elements (characters or bits) during encryption.
Example: Caesar Cipher, where each letter in the plaintext is
shifted by a fixed number of positions.

Transposition Techniques
Definition: Rearranging the order of elements in the
plaintext without changing them.
Example: Rail Fence Cipher, where characters are written in
zigzag lines and then read out again row by row.
ENCRYPTION & DECRYPTION

Encryption: Process of converting plaintext


into ciphertext using an algorithm and a key.

Decryption: Process of converting ciphertext


back into plaintext using a key and an
algorithm.

Symmetric encryption encrypts and decrypts


the information using a single password. In this
encryption technique, the message is encrypted
with a key, and the same key is used for
decrypting the message.

It is called symmetric encryption because the


same key is responsible for encrypting or
decrypting the data
ASYMMETRIC ENCRYPTION uses two keys for encryption
and decryption. It is based on the technique of public and
private keys. A public key, which is interchanged between more
than one user.

In asymmetric encryption, a message that is encrypted using a


public key can be decrypted by a private key, while if the
message is encrypted by a private key can be decrypted by using
the public key

"KEY SIZE" refers to the length of a cryptographic key,


usually expressed in bits. The larger the key size, the more
secure the encryption and decryption process is. The
most commonly used key sizes are 128-bit, 192-bit, and
256-bit.

"KEY RANGE" refers to the set of all possible keys that can be used in cryptography.
The range is determined by the key size and the underlying algorithm, and it affects
the security of the encryption. A larger key range allows for a greater number of
possible keys, increasing the difficulty for an attacker to guess the correct key and
decrypt the message
SYMMETRIC KEY ALGORITHM
Symmetric key algorithms, also known as secret key or private key algorithms, use the same key for
both encryption and decryption.
Characteristic: Faster than asymmetric algorithms but requires secure key exchange.

Algorithm Types & Modes:


Types:
Block Ciphers: Process data in fixed-size blocks (e.g., 64 or 128 bits) during encryption and
decryption.
Stream Ciphers: Process data bit by bit or byte by byte during encryption and decryption.

Modes:
ECB (Electronic Codebook): Each block is independently encrypted, may lead to pattern recognition.
CBC (Cipher Block Chaining): Each block depends on the previous block, adding randomness and
enhancing security.
OFB (Output Feedback): Uses the output of the previous block for encryption, suitable for streaming
data.
CFB (Cipher Feedback): Similar to OFB but works at the byte level, supporting different block sizes.
DES(DATA ENCRYPTION STANDARD) ALGORITHM
Data Encryption Standard (DES) is a block cipher with a 56-bit key length that has played a significant role in data
security. Data encryption standard (DES) has been found vulnerable to very powerful attacks therefore, the popularity of
DES has been found slightly on the decline. DES is a block cipher and encrypts data in blocks of size of 64 bits each,
which means 64 bits of plain text go as the input to DES, which produces 64 bits of ciphertext. The same algorithm and
key are used for encryption and decryption, with minor differences. The key length is 56 bits.
Let us now discuss the broad-level steps in DES.

In the first step, the 64-bit plain text block is handed over to
an initial Permutation (IP) function.

The initial permutation is performed on plain text.


Next, the initial permutation (IP) produces two halves of the
permuted block; saying Left Plain Text (LPT) and Right Plain
Text (RPT).

Now each LPT and RPT go through 16 rounds of the


encryption process.
In the end, LPT and RPT are rejoined and a Final
Permutation (FP) is performed on the combined block
The result of this process produces 64-bit ciphertext.
IDEA(INTERNATIONAL DATA ENCRYPTION ALGORITHM)
The International Data Encryption Algorithm (IDEA) is a symmetric-key block cipher that was first introduced in 1991.
IDEA uses a block cipher with a block size of 64 bits and a
key size of 128 bits. It uses a series of mathematical
operations, including modular arithmetic, bit shifting,
and exclusive OR (XOR) operations, to
transform the plaintext
into ciphertext

This algorithm involves a series of 4 identical


complete rounds and 1 half-round. Each complete
round involves a series of 14 steps that includes
operations like:

Bitwise XOR
Addition modulo (2^4)
Multiplication modulo (2^4) +1
After 4 complete rounds, the final “half-round” consists of only the first 4 out of the 14 steps previously used in the full
rounds. To perform these rounds, each binary notation must be converted to its equivalent decimal notation, perform the
operation and the result obtained should be converted back to the binary representation for the final result of that
particular step.
RC5 ENCRYPTION ALGORITHM
RC5 is a symmetric key block encryption algorithm designed by Ron Rivest
in 1994. It is notable for being simple, fast (on account of using only
primitive computer operations like XOR, shift, etc.) and consumes less
memory. Example:

Key : 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00
Plain Text : 00000000 00000000
Cipher Text : EEDBA521 6D8F4B15

RC5 is a block cipher and addresses two word blocks at a time.


Depending on input plain text block size, number of
rounds and key size, various instances of RC5 can
be defined and each instance is denoted as RC5-w/r/b
where w=word size in bits, r=number of rounds and b=key size in bytes.
Allowed values are:

Parameter Possible Value


Block/word size (bits) 16, 32, 64
Number of Rounds 0 – 255
Key Size (bytes) 0 – 255

You might also like