Scribd
Upload
90 views28 pages

1 Public Key & RSA

Public-key cryptography uses two keys: a public key to encrypt messages and a private key to decrypt them. This allows secure communication without pre-sharing keys. The most widely used public-key cryptosystem is RSA, which is based on the difficulty of factoring large prime numbers. RSA involves generating a public/private key pair using prime numbers, then encrypting with the public key and decrypting with the private key. It remains secure as long as factoring large numbers remains computationally infeasible.

Uploaded by

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

1 Public Key & RSA

Public-key cryptography uses two keys: a public key to encrypt messages and a private key to decrypt them. This allows secure communication without pre-sharing keys. The most widely used public-key cryptosystem is RSA, which is based on the difficulty of factoring large prime numbers. RSA involves generating a public/private key pair using prime numbers, then encrypting with the public key and decrypting with the private key. It remains secure as long as factoring large numbers remains computationally infeasible.

Uploaded by

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

Chapter 9 – Public Key Cryptography

and RSA
Private-Key Cryptography
 Traditional private/secret/single key
cryptography uses one key

 Shared by both sender and receiver

 If this key is disclosed communications are


compromised

 Also is symmetric, parties are equal


Public-Key Cryptography
 Probably most significant advance in the 3000 year
history of cryptography

 Encryption and decryption are performed using the


different keys (A) public key and (B) private key

 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.
Public-Key Cryptography
 Used for confidentiality, authentication, or both
 Also known as Asymmetric encryption
 The most widely used public-key cryptosystem is
RSA
Why Public-Key Cryptography?
 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
Public-Key Cryptography
 Public-key/two-key/asymmetric cryptography
involves the use of two keys:
 A public-key, which may be known by anybody, and can
be used to encrypt messages, and verify signatures
 A private-key, known only to the recipient, used to
decrypt messages, and sign (create) signatures

 Is asymmetric because
 Those who encrypt messages or verify signatures cannot
decrypt messages or create signatures
Public-Key Cryptography
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 public-key encryption scheme has six
ingredients

Plaintext
Encryption algorithm
Public key
Private key
Ciphertext
Decryption algorithm
Public-Key Cryptosystems
Public-Key Cryptosystem: Authentication
Public-Key Cryptosystem: Authentication and Secrecy
Public-Key Applications
 Can classify uses into 3 categories:
 Encryption/decryption (provide secrecy)
 Digital signatures (provide authentication)
 Key exchange (of session keys)
 Some algorithms are suitable for all uses,
others are specific to one
Public-Key Cryptanalysis
 Brute-force attack
 To compute the private key given the public
key
 Probable message attack
RSA
 By Rivest, Shamir & Adleman of MIT in 1977
 Best known & widely used public-key scheme
 Based on exponentiation in a finite (Galois) field over
integers modulo a prime
 Uses large integers
 Security due to cost of factoring large numbers
RSA Key Setup
 Each user generates a public/private key pair by:
 Selecting two large primes at random - p, q
 Computing their system modulus n=p.q
 note ø(n)=(p-1)(q-1)
 Selecting at random the encryption key e
 where 1<e<ø(n), gcd(e,ø(n))=1
 Solve following equation to find decryption key d
 e.d=1 mod ø(n) and 0≤d≤n
 Publish their public encryption key: PU={e,n}
 Keep secret private decryption key: PR={d,n}
RSA Use
 To encrypt a message M the sender:
 obtains public key of recipient PU={e,n}
 computes: C = Me mod n, where 0≤M<n
 To decrypt the ciphertext C the owner:
 uses their private key PR={d,n}
 computes: M = Cd mod n
RSA Example - Key Setup
1. Select primes: p=17 & q=11
2. Compute n = pq =17 x 11=187
3. Compute ø(n)=(p–1)(q-1)= 16 x 10 = 160
4. Select e: gcd(e,160)=1; choose e=7
5. Determine d: (d*e) mod 160 = 1 and d < 160 Value
is d=23 since (23x7=161)mod 160=1
6. Publish public key PU={7,187}
7. Keep secret private key PR={23,187}
RSA Security
 Possible approaches to attacking RSA are:
 Brute force key search (infeasible given size of
numbers)
 Mathematical attacks (based on difficulty of
computing ø(n), by factoring modulus n)
 Timing attacks (on running of decryption)
 Chosen ciphertext attacks (given properties of
RSA)
Summary
Principles of public-key cryptography
RSA algorithm, implementation, security

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy