Scribd
Upload
54 views

Public Key Cryptography (PKC) : 1 Dr. Reema Patel, Is - 2019, B.Tech, Ce/Ict, Sot, Pdpu

Public key cryptography (PKC) uses two keys - a public key and a private key - to address issues with symmetric key cryptography like key distribution and providing message authentication. It allows secure communication over insecure channels without needing to pre-share keys. A PKC system is based on mathematical problems that make determining a private key from a public key computationally infeasible, while allowing easy encryption and decryption by the respective keys. Popular PKC algorithms include RSA, Diffie-Hellman, and ElGamal.

Uploaded by

Apoorva Panchal
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
54 views

Public Key Cryptography (PKC) : 1 Dr. Reema Patel, Is - 2019, B.Tech, Ce/Ict, Sot, Pdpu

Public key cryptography (PKC) uses two keys - a public key and a private key - to address issues with symmetric key cryptography like key distribution and providing message authentication. It allows secure communication over insecure channels without needing to pre-share keys. A PKC system is based on mathematical problems that make determining a private key from a public key computationally infeasible, while allowing easy encryption and decryption by the respective keys. Popular PKC algorithms include RSA, Diffie-Hellman, and ElGamal.

Uploaded by

Apoorva Panchal
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/ 19

Public Key Cryptography

(PKC)

DR. REEMA PATEL, IS - 2019, B.TECH, CE/ICT, SOT,PDPU 1


Introduction
• Traditional private/secret/single key cryptography uses one key
◦ shared by both sender and receiver - symmetric, parties are equal
◦ does not protect the sender,
◦ receiver can forge a message & claim that it has sent by sender
• if this key is disclosed, communications are compromised
• Therefore, a secure channel is required
◦ to secretly transfer the key to receiver
• How to establish the secure channel – a practical problem
• Why can’t the message itself be communicated through this ?

DR. REEMA PATEL, IS - 2019, B.TECH, CE/ICT, SOT,PDPU 2


PKC - Motivation
• How many pairs of keys are required for say n users ? (symmetric key)

DR. REEMA PATEL, IS - 2019, B.TECH, CE/ICT, SOT,PDPU 3


PKC - Motivation
• total of (n2 –n)/2 potential pairs: who wish to communicate privately !!

• it is unrealistic to assume that (n2 –n)/2 pairs can be arranged

• PKC was proposed as


◦ communication over a public channel
◦ using publicly known techniques

DR. REEMA PATEL, IS - 2019, B.TECH, CE/ICT, SOT,PDPU 4


PKC
• PKC is modern cryptography
◦ probably most significant advance in the 3000 year history of cryptography
◦ uses two keys – a public & a private key
◦ asymmetric since parties are not equal
◦ uses clever application of number theoretic concepts to function

• developed to address two key issues:


◦ key distribution – how to have secure communications in general without having to trust a KDC
with your key
◦ digital signatures – how to verify a message comes intact from the claimed sender

DR. REEMA PATEL, IS - 2019, B.TECH, CE/ICT, SOT,PDPU 5


PKC
• Symmetric and asymmetric-key cryptography will exist in parallel and continue to serve
the community.
◦ they are complements of each other;
◦ the advantages of one can compensate for the disadvantages of the other.

Symmetric-key cryptography is based on sharing secrecy;


Asymmetric-key cryptography is based on personal secrecy.

DR. REEMA PATEL, IS - 2019, B.TECH, CE/ICT, SOT,PDPU 6


PKC
• Asymmetric key cryptography uses two separate keys: one private and one public.

DR. REEMA PATEL, IS - 2019, B.TECH, CE/ICT, SOT,PDPU 7


General Idea of PKC

DR. REEMA PATEL, IS - 2019, B.TECH, CE/ICT, SOT,PDPU 8


PKC
• Plaintext/Ciphertext
◦ Unlike in symmetric-key cryptography, plaintext and ciphertext are treated as integers in
asymmetric-key cryptography.
• The main idea behind asymmetric-key cryptography is the concept of the trapdoor one-
way function.

A function as rule mapping a domain to a range

DR. REEMA PATEL, IS - 2019, B.TECH, CE/ICT, SOT,PDPU 9


PKC
• One-Way Function (OWF)

1. f is easy to compute.
2. f −1 is difficult to compute.
• Trapdoor One-Way Function (TOWF)

3. Given y and a trapdoor, x can be


computed easily.
DR. REEMA PATEL, IS - 2019, B.TECH, CE/ICT, SOT,PDPU 10
Example
• Example 1:
◦ When n is large, n = p × q is a one-way function.
◦ Given p and q , it is always easy to calculate n ;
◦ given n, it is very difficult to compute p and q. This is the factorization problem.

• Example 2:
◦ When n is large, the function y = xk mod n is a trapdoor one-way function.
◦ Given x, k, and n, it is easy to calculate y.
◦ Given y, k, and n, it is very difficult to calculate x.

DR. REEMA PATEL, IS - 2019, B.TECH, CE/ICT, SOT,PDPU 11


Asymmetric Encryption

DR. REEMA PATEL, IS - 2019, B.TECH, CE/ICT, SOT,PDPU 12


PKC Authentication

DR. REEMA PATEL, IS - 2019, B.TECH, CE/ICT, SOT,PDPU 13


PKC – Encryption & Authentication

DR. REEMA PATEL, IS - 2019, B.TECH, CE/ICT, SOT,PDPU 14


PKC Applications
• can classify uses into 3 categories
◦ encryption/decryption
◦ the sender encrypts a message with the recipient’s public key.
◦ digital signature
◦ the sender ”signs” a message with its private key.
◦ key exchange
◦ two sides cooperate two exchange a session key.

• some algorithms are suitable for all uses, others are specific to one

DR. REEMA PATEL, IS - 2019, B.TECH, CE/ICT, SOT,PDPU 15


Public key Characteristics
• Public-Key algorithms rely on two keys where:
◦ it is computationally infeasible to find decryption key knowing only algorithm & encryption key
◦ it is computationally easy to en/decrypt messages when the relevant (en/decrypt) key is known
◦ either of the two related keys can be used for encryption, with the other used for decryption (for some
algorithms)

• a problem being computationally easy means


◦ it can be solved in polynomial time as a function of its input n i.e.
◦ if the length of the input is n bits,
◦ then the time to compute is proportional to na (a = some constant value)

DR. REEMA PATEL, IS - 2019, B.TECH, CE/ICT, SOT,PDPU 16


Public key Characteristics
• computationally infeasible is difficult to define
• a problem is infeasible to solve
◦ if grows faster than the polynomial time as a function of input size
◦ i.e., if the length of the input is n bits, then
◦ the time to compute is proportional to 2n

• A one way trap door function

DR. REEMA PATEL, IS - 2019, B.TECH, CE/ICT, SOT,PDPU 17


Security of public key
• brute force exhaustive search attack is always possible
◦ like private key schemes
◦ but keys proposed and used are too large (>1024bits)
◦ For example: p=170141183460469231731687303715884105727,
◦ renders brute force attack impractical
◦ solution (security) relies
◦ on a large enough difference in difficulty
◦ between easy (en/decrypt) and hard (cryptanalyse) problems

DR. REEMA PATEL, IS - 2019, B.TECH, CE/ICT, SOT,PDPU 18


PKC Algorithms
• RSA
• Diffie-Hellman
• Rabin’s PKE scheme
• ElGammal encryption scheme
• McEliece PKE scheme
• Merkle-Hellman knapsack PKE scheme
• Chor-Rivest encryption scheme
• Probabilistic PKE scheme

DR. REEMA PATEL, IS - 2019, B.TECH, CE/ICT, SOT,PDPU 19

You might also like