TE EXTC Data Compression & Cryptography
Sem - V
Module – 5
Asymmetric Key Cryptography
Asymmetric key cryptography, also called public key cryptography, is a cryptographic system that
uses two different keys:
Public key (shared with everyone). Asymmetric key encryption, also known as public-key
cryptography, uses a pair of mathematically related keys – a public key and a private key – for
encrypting and decrypting data, providing confidentiality and authenticity. The public key,
which can be shared widely, is used to encrypt messages or verify signatures, while the
corresponding private key, kept secret, is used to decrypt the messages or create the digital
signatures.
Private key (kept secret by the owner). This system solves the key exchange problem found
in symmetric encryption and is fundamental for secure online communication, digital
signatures, and blockchain technologies.
It solves the key distribution problem of symmetric key cryptography and enables confidentiality,
authentication, integrity, and non-repudiation.
5.1 Principles of Public Key Crypto System, RSA, Key Management,
Diffie–Hellman Key Exchange
5.1.1 Principles of Public Key Crypto System
The principles of a public key crypto system include the use of two related keys, efficient
encryption and decryption, and infeasibility of deriving the private key from the public key. Public
key cryptography supports both encryption/decryption for secure communication and digital
signatures for authentication and integrity verification.
Two Keys:
o Public key for encryption (or verification).
o Private key for decryption (or signing).
Mathematical Foundation: Based on hard problems like prime factorization or discrete
logarithms.
Functions:
1. Encryption/Decryption (confidentiality).
2. Digital Signature (authentication + non-repudiation).
3. Key Exchange.
Requirements:
o Computationally infeasible to determine private key from public key.
o Encryption and decryption must be efficient.
o Either key can be used for encryption/decryption depending on application.
5.1.2 RSA Algorithm (Rivest–Shamir–Adleman)
Based on: Difficulty of factoring large prime numbers.
One of the most widely used algorithms is RSA (Rivest–Shamir–Adleman), which is based
on the difficulty of factoring large prime numbers. In RSA, two large primes are chosen, and their
product forms the modulus n. A public key exponent e and a private key exponent d are calculated
such that they satisfy modular arithmetic properties. Encryption is performed as C=Me mod n and
decryption as M=Cd mod n. RSA ensures both secure communication and digital signatures, but it is
computationally expensive compared to symmetric encryption.
Steps:
By Gauri Joshi VPM’s MPCOE, Velneshwar Page 1
TE EXTC Data Compression & Cryptography
Sem - V
Applications: Secure communication, digital signatures, key exchange.
Limitations: Computationally intensive, slower than symmetric key.
5.1.3 Key Management
Challenges: Secure generation, distribution, storage, and revocation of keys.
Methods:
1. Public Key Infrastructure (PKI): Certificates issued by Certificate Authorities
(CA).
2. Key Revocation: Revocation lists to invalidate compromised keys.
3. Hybrid Systems: Public key used to exchange session keys (symmetric) for faster
encryption (used in SSL/TLS).
5.1.4 Diffie–Hellman Key Exchange
Introduced: 1976, first practical public key algorithm.
Purpose: Establish a shared secret key between two parties over an insecure channel.
Based on: Discrete logarithm problem.
Steps:
Limitation: Vulnerable to Man-in-the-Middle Attack without authentication.
5.2 Message Integrity, Message Authentication and Hash
Functions, SHA, HMAC, Digital Signature Standards
5.2.1 Message Integrity
Ensures message is not altered in transit.
Achieved using hash functions and digital signatures.
5.2.2 Message Authentication
Ensures message is from a legitimate sender.
Achieved using:
1. Message Authentication Codes (MACs).
2. Digital Signatures.
5.2.3 Hash Functions
One-way functions mapping variable-length input → fixed-length output (hash/digest).
By Gauri Joshi VPM’s MPCOE, Velneshwar Page 2
TE EXTC Data Compression & Cryptography
Sem - V
Properties:
o Pre-image resistance.
o Collision resistance.
o Avalanche effect.
Common Algorithms: MD5 (obsolete), SHA family.
5.2.4 Secure Hash Algorithm (SHA)
SHA-1: 160-bit digest (obsolete due to collisions).
SHA-2 family: SHA-224, SHA-256, SHA-384, SHA-512.
SHA-3: Based on Keccak algorithm, more secure and resistant to length-extension attacks.
5.2.5 HMAC (Hash-based Message Authentication Code)
Combines a secret key with a hash function.
Provides integrity + authentication.
Formula:
Widely used in IPSec, SSL/TLS, API authentication.
5.2.6 Digital Signature Standards (DSS)
Defined by NIST.
Algorithms:
1. DSA (Digital Signature Algorithm) – based on discrete logarithms.
2. RSA Digital Signatures – based on RSA key pairs.
3. ECDSA (Elliptic Curve DSA) – more efficient, based on elliptic curves.
Applications:
o Software distribution, e-governance, online banking, blockchain.
By Gauri Joshi VPM’s MPCOE, Velneshwar Page 3
