KARAKORAM INTERNATIONAL UNIVERSITY

GROUP MEMBERS
1. MEHNAZ
2. SHUJAAT AHMED
3. SHAHADAT HUSSAIN
4. SHABANA NAZ
TABLE OF CONTENT
 WHAT IS ASYMMETRIC CRYPTOGRAPHY
 MODULE OBJECTIVES
 ASYMMETRIC ENCRYPTION FOR MESSAGE CONFIDENTIALITY
 DIGITAL SIGNATURE FOR AUTHENICATION
What is Cryptography?
Cryptography is a method of protecting information and communications through the use of
so that only those for whom the information is intended can read and process it.
ASYMMETRIC CRYPTOGRAPHY
• Asymmetric cryptography, also known as public-key cryptography, is a
cryptographic system that uses a pair of mathematically related keys for secure
communication. Unlike symmetric cryptography, which uses a single key for both
encryption and decryption, asymmetric cryptography employs two different
keys: a public key and a private key.
• Public Key: Each user generates a pair of keys, consisting of a public key and a
private key. The public key is freely distributed and can be made available to
anyone.
• Private Key: The private key is kept secret and known only to the owner. It should
never be shared with anyone else
EXAMPLE
• One popular example of asymmetric cryptography is the RSA algorithm, named after its
inventors, Rivest, Shamir, and Adelman. Here's a simplified example of how RSA works:
• Key Generation:
• Bob generates a public-private key pair. The public key consists of two components: the modulus
(N) and the encryption exponent (e), while the private key contains the decryption exponent (d).
• Bob keeps the private key secret and shares the public key with others.

• Encryption:
• Alice wants to send a confidential message to Bob.
• Alice obtains Bob's public key (N, e).
• She converts her message into a numerical representation, typically using a scheme like ASCII or
Unicode.
 • Alice raises each character to the power of e and takes the modulus N to obtain the
encrypted value for each character.
• She sends the encrypted message to Bob.
• Decryption:
• Bob receives the encrypted message from Alice.
• He uses his private key (d) to decrypt each character.
• Bob raises each encrypted character to the power of d and takes the modulus N to
obtain the original numerical representation of the message.
• He converts the numerical representation back into readable text, revealing the
decrypted message.
• The security of RSA lies in the difficulty of factoring large numbers into their prime
factors. Breaking RSA encryption requires finding the prime factors of the modulus N,
which becomes computationally infeasible for sufficiently large prime numbers.
MODULE OBJECTIVES

• Confidentiality: Asymmetric cryptography aims to provide confidentiality

by allowing two parties to communicate securely over an insecure channel.
• Integrity: Integrity ensures that the message has not been tampered with
during transmission. Asymmetric cryptography achieves message integrity
through the use of digital signature.
• Authentication: Authentication verifies the identity of the communicating
parties. Asymmetric cryptography enables authentication by using digital
certificates. A trusted third party, known as a certificate authority (CA),
issues digital certificates that bind a user's identity to their public key.
• Non-repudiation: Non-repudiation ensures that the sender cannot
deny sending a message. With asymmetric cryptography, a digital
signature provides non-repudiation. Once the sender signs a message
with their private key, they cannot later deny their involvement, as the
signature can be verified using their public key.
• Key Exchange: Asymmetric cryptography facilitates secure key
exchange between parties who have never communicated before. This
allows for the establishment of a shared secret key for subsequent
symmetric encryption, which can be more computationally efficient for
large amounts of data.
ASYMMETRIC ENCRYPTION FOR MESSAGE CONFIDENTIALITY
Asymmetric encryption plays a crucial role in achieving message confidentiality in secure
communication. Here's how it works:
• Key Generation:
• The recipient generates a key pair consisting of a public key and a private key.
• The recipient keeps the private key secret and shares the public key with others.
• Encryption:
• The sender obtains the recipient's public key.
• The sender converts the message into a numerical representation, typically using a
character encoding scheme like ASCII or Unicode.
• For each character or block of the message, the sender applies the recipient's public key
to encrypt it.
• The encrypted message is sent to the recipient
• Decryption:
• The recipient receives the encrypted message.
• The recipient uses their private key to decrypt each character or block
of the message.
• Applying the private key, the recipient retrieves the original numerical
representation of the message.
• The recipient converts the numerical representation back into readable
text, revealing the decrypted message.
DIGITAL SIGNATURE FOR AUTHENICATION

• Digital signatures play a crucial role in authentication and ensuring the

integrity of electronic documents or messages. Here's how digital
signatures work to achieve authentication:
• Key Generation:
• The sender generates a key pair consisting of a private key and a
corresponding public key.
• The sender keeps the private key secure and shares the public key with
others.
• Signing Process:
• The sender wants to sign a document or message to authenticate it.
• The sender calculates a cryptographic hash function (such as SHA-256)
on the document, which produces a fixed-size digest that uniquely
represents the document's content.
• The sender then encrypts the digest using their private key, creating
the digital signature.
• The digital signature is attached to the document or message and sent
to the recipient.
• Verification Process:
• The recipient receives the document or message along with the digital signature.
• The recipient obtains the sender's public key from a trusted source (such as a digital certificate
or a key distribution infrastructure).
• The recipient decrypts the digital signature using the sender's public key, which yields the
original digest.
• The recipient independently calculates the cryptographic hash function on the received
document, generating a new digest.
• If the decrypted digest matches the independently calculated digest, the digital signature is
valid, indicating that the document has not been tampered with and that it was indeed signed
by the sender.
THANK YOU