Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
16 views17 pages

Lecture 06 Public Key Cryptography

Public key cryptography, or asymmetric encryption, uses a pair of keys (public and private) for encryption and decryption, allowing for confidentiality and authentication. The RSA algorithm is the most widely used public-key cryptosystem, relying on the difficulty of factoring large composite numbers. Users generate key pairs, share their public keys, and use them to securely exchange messages, with only the intended recipient able to decrypt the message using their private key.

Uploaded by

Sumaiyabintemostofa36
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
16 views17 pages

Lecture 06 Public Key Cryptography

Public key cryptography, or asymmetric encryption, uses a pair of keys (public and private) for encryption and decryption, allowing for confidentiality and authentication. The RSA algorithm is the most widely used public-key cryptosystem, relying on the difficulty of factoring large composite numbers. Users generate key pairs, share their public keys, and use them to securely exchange messages, with only the intended recipient able to decrypt the message using their private key.

Uploaded by

Sumaiyabintemostofa36
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 17

Public Key

Cryptography
Professor Dr. Rafiqul Islam
Key Points
• Asymmetric encryption is a form of cryptosystem in which encryption and
decryption are performed using the different keys—one a public key and one a
private key. It is also known as public-key encryption.
• Asymmetric encryption transforms plaintext into ciphertext using a one of two
keys and an encryption algorithm. Using the paired key and a decryption
algorithm, the plaintext is recovered from the ciphertext.
• Asymmetric encryption can be used for confidentiality, authentication, or both.
The most widely used public-key cryptosystem is RSA. The difficulty of
attacking RSA is based on the difficulty of finding the prime factors of a
composite number.
Terminology
Public Key Cryptosystem
Public Key Cryptosystem
• Plaintext: This is the readable message or data that is fed into the algorithm as input.
• Encryption algorithm: The encryption algorithm performs various transformations on the
plaintext.
• Public and private keys: This is a pair of keys that have been selected so that if one is used
for encryption, the other is used for decryption. The exact transformations performed by the
algorithm depend on the public or private key that is provided as input.
• Ciphertext: This is the scrambled message produced as output. It depends on the plaintext
and the key. For a given message, two different keys will produce two different ciphertexts.
• Decryption algorithm: This algorithm accepts the ciphertext and the matching key and
produces the original plaintext.
Essential Steps
• Each user generates a pair of keys to be used for the encryption and
decryption of messages.
• Each user places one of the two keys in a public register or other accessible file.
This is the public key. The companion key is kept private. Each user maintains a
collection of public keys obtained from others.
• If Bob wishes to send a confidential message to Alice, Bob encrypts the message
using Alice’s public key.
• When Alice receives the message, she decrypts it using her private key. No
other recipient can decrypt the message because only Alice knows Alice’s
private key
Differences
Secrecy of Public key Cryptosystem
Applications
RSA Algortihm
RSA Algorithm
RSA Algorithm
Example
1. Select two prime numbers, p = 17 and q = 11.
2. Calculate n = pq = 17 × 11 = 187.
3. Calculate Φ(n) = (p - 1)(q - 1) = 16 × 10 = 160.
4. Select e such that e is relatively prime to Φ(n) = 160 and less than Φ(n);
we choose e = 7.
5. Determine d such that de ≡ 1 (mod 160) and d < 160. The correct value
is d = 23, because 23 × 7 = 161 = (1 × 160) + 1;
The resulting keys are public key PU = {7, 187} and private key PR =
{23, 187}
Example
•
Example
•
Multiple Block Processing
Security of RSA
Four possible approaches to attacking the RSA algorithm are
• Brute force: This involves trying all possible private keys.
• Mathematical attacks: There are several approaches, all equivalent
in effort to factoring the product of two primes.
• Timing attacks: These depend on the running time of the
decryption algorithm.
• Chosen ciphertext attacks: This type of attack exploits properties
of the RSA algorithm

You might also like