1.
Conventional Encryption and Message Confidentiality
Conventional encryption, also known as symmetric encryption, is a method where the same
key is used for both encryption and decryption. This approach ensures message
confidentiality, meaning only the sender and the intended recipient can read the message.
Key Points:
• Uses a single key for encryption and decryption.
• Efficient and fast compared to asymmetric encryption.
• Requires a secure key distribution mechanism to share the key between sender and
receiver.
Examples of Conventional Encryption:
• Data Encryption Standard (DES) – A 56-bit key encryption algorithm, now
considered weak.
• Triple DES (3DES) – An improved version of DES, using multiple encryption
rounds.
• Advanced Encryption Standard (AES) – A modern encryption standard with key
sizes of 128, 192, and 256 bits.
2. Conventional Encryption Algorithms
Conventional encryption algorithms are based on symmetric key cryptography and fall into
two categories:
A. Block Ciphers
• Encrypts fixed-size blocks of data (e.g., 64-bit or 128-bit blocks).
• Uses multiple rounds of transformation to increase security.
• Examples:
o AES (Advanced Encryption Standard)
o DES (Data Encryption Standard)
o 3DES (Triple DES)
B. Stream Ciphers
• Encrypts data one bit or byte at a time.
• Fast and suitable for real-time applications.
• Examples:
o RC4 (Rivest Cipher 4) (used in SSL/TLS but now considered insecure)
o Salsa20 (modern and secure)
3. Key Distribution
Since conventional encryption relies on a single secret key, distributing this key securely is
crucial. Key distribution can be done through:
A. Manual Key Exchange
• Physically exchanging keys using secure methods (e.g., USB drives, courier services).
• Not scalable for large networks.
B. Using a Key Distribution Center (KDC)
• A trusted third party generates and distributes session keys.
• Used in systems like Kerberos.
C. Diffie-Hellman Key Exchange
• Allows two parties to generate a shared secret over an insecure channel without prior
key exchange.
• Used in SSL/TLS for secure communication.
4. Public Key Cryptography and Message Authentication
Public-key cryptography, or asymmetric cryptography, uses two keys:
• Public Key (used for encryption/signature verification)
• Private Key (used for decryption/signature creation)
This allows message authentication by verifying the sender’s identity and ensuring data
integrity.
Advantages of Public-Key Cryptography:
• No need for a secure key exchange.
• Provides authentication (digital signatures) and confidentiality.
Disadvantages:
• Slower than symmetric encryption.
• More computationally intensive.
5. Approaches to Message Authentication
Message authentication ensures that a message is not altered and originates from a legitimate
sender. Some common approaches include:
A. Message Authentication Code (MAC)
• Uses a secret key and a cryptographic function to generate a short tag.
• Example: HMAC (Hash-based MAC).
B. Digital Signatures
• Uses public-key cryptography to verify the sender’s identity.
• Example: RSA Digital Signatures, ECDSA (Elliptic Curve Digital Signature
Algorithm).
C. Cryptographic Hash Functions
• Uses a hash function to generate a unique fingerprint of the message.
• Example: SHA-256, MD5.
6. SHA-1 (Secure Hash Algorithm 1)
SHA-1 is a cryptographic hash function that produces a 160-bit hash value. It was widely
used but is now considered insecure due to collision attacks.
SHA-1 Features:
• Produces a fixed-length output (160 bits).
• Faster than newer hash functions.
• Used in legacy applications (e.g., older TLS versions, digital signatures).
Weaknesses:
• Vulnerable to collision attacks.
• No longer recommended for secure applications.
7. MD5 (Message Digest Algorithm 5)
MD5 is another cryptographic hash function that generates a 128-bit hash value.
MD5 Features:
• Used for file integrity checks.
• Fast but insecure for cryptographic purposes.
Weaknesses:
• Susceptible to collision attacks.
• No longer suitable for cryptographic authentication.
8. Public-Key Cryptography Principles
Public-key cryptography is based on mathematical problems that are computationally
difficult to solve, such as integer factorization and discrete logarithms.
Key Principles:
1. Key Pair (Public & Private Key): Encryption and decryption use different keys.
2. Asymmetry: One key encrypts the data, and the other decrypts it.
3. Security: Breaking the encryption is computationally infeasible with large key sizes.
4. Examples: RSA, Diffie-Hellman, Elliptic Curve Cryptography (ECC).
9. RSA (Rivest-Shamir-Adleman Algorithm)
RSA is a widely used public-key encryption algorithm based on integer factorization.
Steps in RSA:
1. Key Generation:
o Choose two large prime numbers pp and qq.
o Compute n=p×qn = p \times q and ϕ(n)=(p−1)(q−1)\phi(n) = (p-1)(q-1).
o Select an encryption exponent ee (usually 65537).
o Compute the private key dd, where d×e≡1mod ϕ(n)d \times e \equiv 1 \mod
\phi(n).
2. Encryption:
o Ciphertext C=Memod nC = M^e \mod n.
3. Decryption:
o Plaintext M=Cdmod nM = C^d \mod n.
Applications of RSA:
• Secure email (PGP).
• Digital signatures.
• HTTPS/TLS encryption.
10. Digital Signatures
A digital signature is an authentication mechanism using public-key cryptography.
How It Works:
1. The sender hashes the message using SHA-256.
2. The sender encrypts the hash using their private key (this becomes the digital
signature).
3. The receiver decrypts the signature using the sender’s public key.
4. The receiver compares the hash of the received message with the decrypted hash.
Examples:
• RSA Digital Signatures
• ECDSA (Elliptic Curve Digital Signature Algorithm)
11. Key Management
Key management involves the generation, distribution, storage, and revocation of
cryptographic keys.
Key Management Techniques:
• Key Generation: Creating strong and random keys.
• Key Distribution: Using secure methods like Diffie-Hellman.
• Key Storage: Keeping keys secure (e.g., Hardware Security Modules - HSM).
• Key Revocation: Removing compromised keys.
12. Firewall
A firewall is a network security device that monitors and controls incoming and outgoing
traffic based on security rules.
Types of Firewalls:
1. Packet Filtering Firewall: Filters packets based on IP address, port, and protocol.
2. Stateful Inspection Firewall: Tracks active connections and allows only valid
packets.
3. Proxy Firewall: Acts as an intermediary between internal and external networks.
4. Next-Generation Firewall (NGFW): Includes deep packet inspection, intrusion
prevention, and application control.
Firewall Benefits:
• Prevents unauthorized access.
• Protects against cyberattacks.
• Controls traffic based on policies.
Conclusion
These concepts play a crucial role in cybersecurity, ensuring secure communication,
authentication, and protection against cyber threats. Public-key cryptography, digital
signatures, firewalls, and key management are essential for maintaining security in modern
networks.
Would you like any part explained in more detail?
