Scribd
Upload
46 views

The Golden Bough, Sir James George Frazer

Public key cryptography uses two keys, a public key and a private key. The public key can encrypt messages but not decrypt, while the private key can decrypt but not encrypt. This allows for secure communication without pre-sharing keys. RSA is a commonly used public key algorithm that relies on the difficulty of factoring large prime numbers. It involves generating two primes to compute the modulus n, then choosing exponents e and d that are inverse modulo phi of n to encrypt with the public key and decrypt with the private key.

Uploaded by

jagmohan bisht
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
46 views

The Golden Bough, Sir James George Frazer

Public key cryptography uses two keys, a public key and a private key. The public key can encrypt messages but not decrypt, while the private key can decrypt but not encrypt. This allows for secure communication without pre-sharing keys. RSA is a commonly used public key algorithm that relies on the difficulty of factoring large prime numbers. It involves generating two primes to compute the modulus n, then choosing exponents e and d that are inverse modulo phi of n to encrypt with the public key and decrypt with the private key.

Uploaded by

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

Public Key Cryptography and RSA

Every Egyptian received two names, which were


known respectively as the true name and the
good name, or the great name and the little
name; and while the good or little name was
made public, the true or great name appears
to have been carefully concealed.
—The Golden Bough, Sir James George Frazer
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
• Hence does not protect sender from
receiver forging a message & claiming is
sent by sender
Public-Key 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.
• Complements rather than replaces private key
cryptosystem.
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 invention due to Whitfield Diffie &
Martin Hellman at Stanford university in
1976
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)
Public-Key Cryptosystems
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
Security of Public Key Schemes
• Like private key schemes brute force exhaustive
search attack is always theoretically possible
• But keys used are too large (>512bits)
• Security relies on a large enough difference in
difficulty between easy (en/decrypt) and hard
(cryptanalyse) problems
• More generally the hard problem is known, but is
made hard enough to be impractical to break
• Requires the use of very large numbers
• Hence is slow compared to private key schemes
RSA
• By Rivest, Shamir & Adleman of MIT in 1977
• Best known & widely used public-key scheme
• Based on exponentiation in a finite GF over
integers modulo a prime
– NB. exponentiation takes O([log n]3)
operations (easy)
• Uses large integers (e.g. 1024 bits)
• 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 cipher text C the owner:
– Uses their private key PR={d,n}
– Computes: M = Cd mod n
• Note that the message M must be
smaller than the modulus n (block if
needed)
Why RSA Works
• Because of Euler's Theorem:
– aø(n)mod n = 1 where gcd(a, n)=1
• In RSA, we have:
– n=p.q
– ø(n)=(p-1)(q-1)
– carefully chose e & d to be inverses mod ø(n)
– hence e.d=1+k.ø(n) for some k
• Hence :
Cd = Me.d = M1+k.ø(n) = M1.(Mø(n))k
= M1.(1)k = M1 = M 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)=16x10=160
4. Select e: gcd(e,160)=1; choose e=7
5. Determine d: de=1 mod 160 and
d < 160. Value is d=23 since
23x7=161= 1x160+1
6. Publish public key PU={7,187}
7. Keep secret private key PR={23,187}
RSA Example - En/Decryption
• Sample RSA encryption/decryption is:
• Given message M =88 (NB. 88<187)
• Encryption:
C = 887 mod 187 = 11
• Decryption:
M = 1123 mod 187 = 88
RSA Key Generation
• Users of RSA must:
– Determine two primes at random - p, q
– Select either e or d and compute the other
• Primes p,q must not be easily derived
from modulus n=p.q
– Means must be sufficiently large
– Typically guess and use probabilistic test
• Exponents e, d are inverses, so use
inverse algorithm to compute the other
Summary

• Have considered:
–Principles of public-key cryptography
–RSA algorithm, implementation,
security

You might also like