Network Security and Cryptography - Detailed Notes

UNIT 1

1. Introduction to Security Attacks, Services, and Mechanisms

- Security Attacks: Actions that compromise the security of information. Attacks are mainly categorized as:

- Passive Attacks: Aim to learn or make use of information without affecting system resources. Examples:

eavesdropping, traffic analysis.

- Active Attacks: Involve modification of the data stream or creation of false statements. Examples: masquerade,

replay, modification of messages, denial of service (DoS).

- Security Services: Mechanisms to protect data and resources:

- Confidentiality, Integrity, Authentication, Non-repudiation, Access Control, Availability.

- Security Mechanisms: Tools and protocols that implement security services, like encryption, digital signatures,

firewalls, etc.

2. Introduction to Cryptography and Basic Cryptographic Techniques

- Cryptography: Science of protecting data through encoding.

- Basic Techniques:

- Substitution Ciphers: Replace characters (e.g., Caesar Cipher).

- Transposition Ciphers: Rearrange characters (e.g., Rail Fence).

- Symmetric Encryption: Same key for encryption and decryption (e.g., DES).

- Asymmetric Encryption: Uses a public/private key pair (e.g., RSA).

3. Computational Complexity

- Determines the feasibility of solving cryptographic problems using current hardware.

- Cryptographic algorithms rely on problems that are computationally infeasible to solve.

- Many cryptographic schemes are based on NP-hard problems.

4. Finite Fields

- A set with a finite number of elements where arithmetic operations are defined.

- Example: Galois Field GF(2^n) used in AES.

5. Number Theory
- Study of integers, especially prime numbers.

- Important concepts: modular arithmetic, Euclidean algorithm, Euler's theorem, Fermat's Little Theorem.

- Foundation of many public key cryptosystems.

6. DES and AES

- DES: 64-bit block cipher using 56-bit keys and 16 rounds. Vulnerable to brute-force attacks.

- AES: Operates on 128-bit blocks using 128, 192, or 256-bit keys. Highly secure and fast.

7. Public Key Cryptosystems

- Uses public key for encryption and private key for decryption.

- Based on hard mathematical problems like integer factorization (RSA), discrete logarithms (ElGamal), or elliptic curves

(ECC).

8. IDEA Encryption and Decryption

- IDEA: Symmetric cipher operating on 64-bit blocks with a 128-bit key.

- Uses XOR, modular addition, and multiplication to confuse and diffuse the data.

9. Strength of IDEA

- Strong resistance to differential and linear cryptanalysis.

- No successful attacks known against full-round IDEA.

10. Traffic Confidentiality

- Hides metadata like source/destination, message length, frequency, and timing.

- Techniques: Padding, dummy traffic, traffic mixing.

11. Cryptanalysis

- Study of breaking cryptographic algorithms.

- Types: Brute-force, differential, linear, algebraic, side-channel attacks.

12. Intractable (Hard) Problems

- Problems with no efficient solution known.

- Examples: Discrete logarithm problem, integer factorization.

- Produce a fixed-size hash from input data of arbitrary size.

- Properties: One-wayness, collision resistance, fast computation.

14. OSI Security Architecture Privacy of Data

- OSI model layered security approach.

- Security mechanisms apply at each layer to ensure end-to-end protection.

UNIT 2

1. Cryptanalysis: Linear and Differential Cryptanalysis

- Linear: Uses linear approximations to describe cipher behavior.

- Differential: Analyzes how differences in plaintext affect ciphertext.

2. DES

- 64-bit blocks using 56-bit keys.

- 16 rounds of Feistel network. Vulnerable to brute-force.

3. Triple DES

- Applies DES three times with two/three keys.

- Better security but slower.

4. Message Authentication and Digital Signatures

- Message Authentication: Ensures data authenticity and integrity.

- Digital Signature: Encrypted hash using sender's private key.

5. Attacks on Protocols

- Exploiting protocol weaknesses. Examples: Replay, MITM, session hijacking.

6. Elliptic Curve Architecture and Cryptography

- Uses elliptic curves over finite fields.

- Provides security with smaller key sizes.

- RSA: Modular exponentiation and large prime factorization.

- Common in SSL/TLS.

8. Evaluation Criteria for AES

- Security, simplicity, flexibility, performance, cost.

9. Key Management

- Generating, distributing, revoking, storing encryption keys securely.

10. Introductory Idea of ECC

- Efficient public key cryptography using elliptic curves.

11. ElGamal Encryption

- Based on discrete logarithm problem.

- Random number used in encryption for added security.

UNIT 3

1. Buffer Overflow Attack

- Overflows memory buffer leading to arbitrary code execution.

2. Distributed Denial of Service (DDoS) Attack

- Many systems flood a target, disrupting services.

3. Weak Authentication

- Insecure methods allowing unauthorized access.

4. Design of Substitution Boxes (SBoxes)

- Used in symmetric ciphers for non-linearity.

5. Hash Functions

- Fixed-length hash values for data integrity verification.

- Must resist pre-image, second pre-image, and collision attacks.

7. Secure Hash Algorithm (SHA)

- SHA-1 (obsolete), SHA-2 (secure), SHA-3 (new structure).

8. Authentication Applications

- Passwords, OTPs, smart cards, biometrics.

9. Kerberos

- Ticket-based authentication using symmetric cryptography.

10. IP Security (IPSec)

- Secure IP communication via AH and ESP protocols.

11. Pretty Good Privacy (PGP)

- Hybrid encryption for email security.

12. S/MIME

- Email encryption using X.509 certificates.

13. Web Security and Lightweight Cryptography

- HTTPS, TLS; lightweight algorithms for IoT/mobile.

14. Side Channel Attacks

- Based on timing, power usage, electromagnetic leaks.

UNIT 4

1. System Security

- Protecting systems through secure boot, access control, patching.

- ISO/IEC 27001, NIST standards for cryptography.

3. Intruders and Viruses

- Intruders: Unauthorized users; Viruses: Self-replicating malicious code.

4. Firewalls

- Control traffic using rules. Types: Packet filtering, stateful, proxy.

5. Malicious Software

- Malware includes viruses, worms, trojans, ransomware.

6. Intrusion Detection System (IDS)

- Detects suspicious behavior. Signature and anomaly-based.

7. Intrusion Prevention System (IPS)

- Detects and blocks threats in real time.

8. Trusted Systems

- Secure hardware/software ensuring policy compliance.

9. Virus Countermeasures

- Antivirus, updates, user awareness.

10. Authentication Strategies

- Single, multi-factor authentication methods.

11. Security Architecture, Authentication Header

- AH provides source authentication and integrity.

12. Encapsulating Security Payload (ESP)

- Offers encryption and optional authentication.

- Layered IPSec security through SA combinations.

14. Key Management

- Key lifecycle management (generation to destruction).