🔐 Cryptography & Information Security

📘 Unit 1 Overview

Unit 1 introduces the mathematical foundation of cryptography and various classical encryption techniques. It also covers DES, Triple DES, Block Cipher and Stream Cipher which are very important for RGPV examinations.

🔢 Mathematical Background for Cryptography

Cryptography relies heavily on mathematics for secure communication.

Abstract Algebra

Abstract Algebra studies algebraic structures such as groups, rings and fields. These structures are widely used in cryptographic algorithms.

Number Theory

Number Theory deals with properties of integers and prime numbers. Most encryption algorithms such as RSA use number theory concepts.

➗ Modular Arithmetic

Modular Arithmetic works on remainders after division.

Formula

a mod n = remainder when a is divided by n

Example

17 mod 5 = 2

🔄 Modular Inverse

The modular inverse of a number a under modulus m is a number x such that:

(a × x) mod m = 1

Example

3 × 7 = 21 ≡ 1 (mod 10)

Therefore inverse of 3 modulo 10 is 7.

⚙ Extended Euclid Algorithm

Extended Euclid Algorithm is used to find GCD and Modular Inverse.

Applications

• RSA Algorithm
• Key Generation
• Modular Inverse Calculation

📐 Fermat's Little Theorem

If p is a prime number and a is not divisible by p:

a^(p−1) ≡ 1 (mod p)

Uses

• Primality Testing
• RSA Cryptography
• Modular Arithmetic Calculations

📐 Euler Phi Function

Euler Phi Function φ(n) gives the number of positive integers less than n that are relatively prime to n.

Example

φ(9) = 6

Numbers: 1,2,4,5,7,8

📐 Euler's Theorem

If gcd(a,n)=1 then:

a^φ(n) ≡ 1 (mod n)

Euler's theorem is a generalized form of Fermat's theorem.

🔐 Introduction to Cryptography

Cryptography is the science of securing information by converting plaintext into ciphertext.

🎯 Principles of Cryptography

• Confidentiality
• Integrity
• Authentication
• Non-Repudiation
• Availability

🏛 Classical Cryptosystem

Classical cryptography uses substitution and transposition techniques.

Types

• Substitution Cipher
• Playfair Cipher
• Block Cipher
• Stream Cipher

🔄 Substitution Cipher

Each letter is replaced by another letter according to a fixed rule.

Example

A → D, B → E, C → F

Advantages

• Simple implementation
• Easy encryption

📊 Frequency Analysis

Frequency analysis is a cryptanalysis technique used to break substitution ciphers.

It studies the frequency of letters appearing in ciphertext.

🔑 Playfair Cipher

Playfair Cipher encrypts pairs of letters instead of single letters.

Features

• Uses 5×5 matrix
• Encrypts digraphs
• More secure than simple substitution cipher

🧱 Block Cipher

Block Cipher encrypts data in fixed-size blocks.

Examples

• DES
• AES
• Triple DES

🔒 Data Encryption Standard (DES)

DES is a symmetric key encryption algorithm developed by IBM.

Features

• 64-bit block size
• 56-bit key
• 16 rounds
• Symmetric encryption

Advantages

• Fast encryption
• Simple implementation

Limitation

56-bit key is now considered weak.

🔐 Triple DES (3DES)

Triple DES improves security by applying DES three times.

Process

1. Encrypt using Key 1
2. Decrypt using Key 2
3. Encrypt using Key 3

Advantages

• Higher security than DES
• Harder to crack

🌊 Stream Cipher

Stream Cipher encrypts data one bit or one byte at a time.

Advantages

• Fast processing
• Suitable for real-time communication

Examples

• RC4
• Salsa20

⭐ Most Important Questions

1. Explain Extended Euclid Algorithm.
2. Explain Fermat's Little Theorem.
3. Explain Euler Phi Function and Euler's Theorem.
4. Define Cryptography and its principles.
5. Explain Classical Cryptosystem.
6. Explain Substitution Cipher and Frequency Analysis.
7. Explain Playfair Cipher.
8. Explain Block Cipher and Stream Cipher.
9. Explain DES Architecture.
10. Differentiate DES and Triple DES.

🔥 Last Minute Revision

• Modular Arithmetic → Remainder based calculations.
• Extended Euclid → Finds GCD and Modular Inverse.
• Fermat Theorem → a^(p−1) ≡ 1 mod p.
• Euler Theorem → a^φ(n) ≡ 1 mod n.
• Playfair Cipher → Uses 5×5 matrix.
• DES → 56-bit key, 16 rounds.
• Triple DES → DES applied 3 times.
• Stream Cipher → Encrypts one bit at a time.