Scribd
Upload
21 views8 pages

RSA Public Key Cryptosystem: Rivest, Shamir, Adleman)

RSA is a public key cryptosystem that uses a public key to encrypt messages and a private key to decrypt them. It relies on the fact that finding the prime factors of a large number is computationally infeasible. Specifically, RSA uses two large prime numbers p and q to generate the public key n and works by raising encrypted messages to a power modulo n, where only knowledge of the private key allows decryption by raising to a different power modulo n.

Uploaded by

kala
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
21 views8 pages

RSA Public Key Cryptosystem: Rivest, Shamir, Adleman)

RSA is a public key cryptosystem that uses a public key to encrypt messages and a private key to decrypt them. It relies on the fact that finding the prime factors of a large number is computationally infeasible. Specifically, RSA uses two large prime numbers p and q to generate the public key n and works by raising encrypted messages to a power modulo n, where only knowledge of the private key allows decryption by raising to a different power modulo n.

Uploaded by

kala
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/ 8

RSA

(Rivest, Shamir, Adleman)


Public Key Cryptosystem

http://www.rsasecurity.com/rsalabs/faq/3-1.html
Hard Problems

• Some problems are hard to solve.


– No polynomial time algorithm is known.
– e.g., NP-hard problems such as machine scheduling, bin
packing, 0/1 knapsack, finding prime factors of an n-digit
number.

• Is this necessarily bad?

• No!
Data encryption relies on difficult to solve problems.
Cryptography

encryption
message encryption key
algorithm

Transmission
Channel

decryption
decryption key message
algorithm
Public Key Cryptosystem (RSA)
• A public encryption method that relies on a public
encryption algorithm, a public decryption algorithm, and
a public encryption key.

• Using the public key and encryption algorithm, everyone


can encrypt a message.

• The decryption key is known only to authorized parties.


Public Key Cryptosystem (RSA)
• p and q are two prime numbers.
• n = pq
• m = (p-1)(q-1)
• a is such that 1 < a < m and gcd(m,a) = 1.
• b is such that (ab) mod m = 1.
• a is computed by generating random positive
integers and testing gcd(m,a) = 1 using the
extended Euclid’s gcd algorithm.
• The extended Euclid’s gcd algorithm also
computes b when gcd(m,a) = 1.
RSA Encryption And Decryption

• Message M < n.
• Encryption key = (a,n).
• Decryption key = (b,n).
• Encrypt => E = Ma mod n.
• Decrypt => M = Eb mod n.
Breaking RSA

• Factor n and determine p and q, n = pq.


• Now determine m = (p-1)(q-1).
• Now use Euclid’s extended gcd algorithm to
compute gcd(m,a). b is obtained as a byproduct.
• The decryption key (b,n) has been determined!
Security Of RSA

• Relies on the fact that prime factorization is


computationally very hard.
• Let k be the number of bits in the binary
representation of n.
• No algorithm, polynomial in k, is known to find
the prime factors of n.
• Try to find the factors of a 100 bit number.

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