Scribd
Upload
4 views

RSA Algorithm

The RSA algorithm, developed by Rivest, Shamir, and Adleman in 1977, is a public-key cryptosystem used for secure data transmission, relying on the difficulty of factoring large prime numbers. It involves generating a public key and a private key through mathematical processes, including the selection of two large primes and calculating Euler’s Totient. RSA remains foundational in cryptography, although its security may be challenged by advancements in quantum computing.

Uploaded by

wabedin470
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
4 views

RSA Algorithm

The RSA algorithm, developed by Rivest, Shamir, and Adleman in 1977, is a public-key cryptosystem used for secure data transmission, relying on the difficulty of factoring large prime numbers. It involves generating a public key and a private key through mathematical processes, including the selection of two large primes and calculating Euler’s Totient. RSA remains foundational in cryptography, although its security may be challenged by advancements in quantum computing.

Uploaded by

wabedin470
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/ 7

RSA

Algorithm
RSA Algorithm
Overview
 RSA, named after its inventors Rivest, Shamir, and Adleman, is
a widely used public-key cryptosystem used for secure data
transmission.
 The concept of public-key cryptography was first introduced in
1976 by Whitfield Diffie and Martin Hellman.
 RSA was developed by Ron Rivest, Adi Shamir, and Leonard
Ron Rivest Adi Shamir
Adleman at the Massachusetts Institute of Technology (MIT) in
1977, focusing on the mathematical difficulty of factoring large
prime numbers.
 The algorithm was officially introduced in 1978, highlighting its
reliance on modular arithmetic and number theory.
 MIT granted a patent for RSA in 1983, which expired in 2000,
making it freely available.
 RSA became the standard for encryption in software like PGP
and protocols like SSL/TLS.
 RSA remains foundational in cryptographic systems, with
newer algorithms like ECC gaining prominence.
 The security of RSA relies on the computational infeasibility of
factoring large numbers, a challenge that quantum computers
could potentially overcome. Leonard Adleman
Encryption

C=P e

mod n
Decryption

P = C mod n
d
RSA Process

Public Key = { e , n }
Private Key = { d , n }

Select Two Large Primes:

•Choose two distinct prime numbers, p and q , ensuring they are large enough to provide
security.

Compute n:
•n=p×q. This value is part of both the public and private keys.

Calculate Euler’s Totient:


•ϕ(n)=(p−1)(q−1).
Choose Public Exponent (e)

e must satisfy 1<e<ϕ(n) and


gcd(e,ϕ(n))=1.

This ensures e is coprime with ϕ(n).

Determine Private Exponent (d)

Compute d such that d×e = 1(modϕ(n).

D is the modular multiplicative inverse of


e modulo ϕ(n).

Result

Public Key: (e,n)

Private Key: (d,n)


Example : Key Generation.

Get two prime numbers p=3,q=5

n=p*q
N=5*3
= 15

ϕ(n)=(p−1)(q−1)
=(3-1) (5-1)
=(2 * 4 )
=8

Assume e such that gcd ( e , ϕ(n) ) = 1

1 < e < ϕ(n)


gcd (3 , 8 ) = 1
gcd (5 , 8 ) = 1
e=3
gcd (7 , 8 ) = 1
Find d : Public Key = { e , n } = { 3 , 15 }
Private Key = { d , n } = { 3 , 15 }
d * e = 1(mod ϕ(n)
d * e (mod ϕ(n) = 1 Encryption, Decryption,
d * 3 mod 8 = 1
Consider plaintext p = 8 P = Cd mod n
Consider d = 3 23 mod 15
3 * 3 mod 8 = 1 8 mod 15
9 mod 8 = 1 C = Pe mod n P=8
1=1 83 mod 15
d=3 512 mod 15
C=2

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