Scribd
Upload
2 views6 pages

RSA Algorithm Overview and Examples

The document discusses the RSA algorithm, an asymmetric cryptographic method that uses a public and private key for encryption and decryption. It outlines the process of encoding and decoding messages using RSA, including calculations for generating keys and encrypting plaintext. Additionally, it touches on solving Diophantine equations related to the RSA algorithm.

Uploaded by

jnchandan07
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
2 views6 pages

RSA Algorithm Overview and Examples

The document discusses the RSA algorithm, an asymmetric cryptographic method that uses a public and private key for encryption and decryption. It outlines the process of encoding and decoding messages using RSA, including calculations for generating keys and encrypting plaintext. Additionally, it touches on solving Diophantine equations related to the RSA algorithm.

Uploaded by

jnchandan07
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

|RSA Alqovi thm

Adleman
(Ron Rivest, Adi shamir nd Leonard
Alyoitm)
This is a asymnetric Cypgraphie algori tan
(2 keyo ie putlic and private ky)
to all users in netwovk
plie kuyi- kncu
Know
Secvct, not shavable to all
hívate keq' kept
then
used for encryphion
* 1f pLlic key of user A is used
ier for
We have to we the privatt key ot
ot same
Sam

dity phion.
The RSA Schee
Schemeis aa block
is cipher in which tha
plain texk and the cipler text integts blw
are

0 to for Some value 'n. (ipher iz


value is an
data
adg ovi thm fr entnypting and decrypting
a secret code)
Problemy
) Encode STOP RSA
vsing RSA alovi thn wi th Fey
9534, 13) and P= 43, 9 54
Soloi Civen P= Ha, 4-54
and
puplic key - 2534,2- in.e?
n= P9 = 43x54 =2S3+ and e= 13
¢in) =(-) (4-) l. x5¢ J436

Since e= 13, and


|<13 <2436
|ABDEF
qcd (24 36, 12) |
M= STOP = 1814|4|5

let M, = 1819, M, = lS

Eryphon ! C= Mnod n
C,= M modn and , = M, modn

tonider (1814)* = 2068 (mod as31))(wint


Calcuatu)
Cube on both Sides
’(4814)) (20 6s) (mod(3s3)
= 322 Cmed 3534) .(wing cale)
ea(*) and eg? ()6) maliple
=) (1819)1s14) = (G06s x 322) mod as3+
’ (1819)P= 1202 Cmod 2s31) (uig calci)
'y by i814 bs en

’ (819) (1819) =(1202 X 1919) Cmod 25 31)


EJosI (mod 2S31) (way ca)
2.08) ( mod 2S31)|
Now C, = l mod n
G= (0415)" (nod 9531)’ 9
Conider (H
(U4IS)' = I82s (mod as 31) (wiy cle)
2

(0h1s))=(1s2s)' mod 3s31)


> (41s)= 3005 (mod ss31) (uiing cali)
3
eqn(r a)x egn Is) (I415)= (1925 x2005) (nod 3s3)
415) = I12 Cmod 353+) (uinyCali)
by l5 Cn bo tk ide
(1s) (415) = (415 x 2)Cmod 2S 3+)
(HIS)"= al 52 (mod as3t)
be comy

)82 (mod 2s3+)

Thus

C= UHBVHC
sing RSA alyovithm de Crypt oq g1o46|
ing d= q31 , P= 43) Q=54
Stlo: P= 43, q-54
n=pxq = 3Xs4 = J631

4n)=(p-) (9-) = (43-1) (54-i) = 4L x58 =2y36


let sine 1<e<on)
9cd (243b, 13) = |

C= 04g|046
let and

Fos dicYyption , M= c(mod n)


d
and
(nod n)
No, M,= C nodn)
M, (0981) (oncd s3+) 8 M, =(0hb1)nod s53+
93+

’ M,E 0404 (mod as34) M, =I||5 (mod 2s3t)


M, = nS
M, =004
MM, M, =04045
= HELP
-23 3| = xwhere
74 t 25H =1
-23) 543)+ ‘=
7)
+(-) (-1)+t 54(3)+ 1= ’
1(-) t(-)]
+0) SH = 0wing
(-2) I5(3)+
=)
(2 )5
5 [7+5(-)1(-) |:5+
0
2(-2) )|=
t5 (3from
)
5+1-1)
5
5-) 2=7+ 4-5x1+2
0tt(-1) s4 4=x+5
5 ) 5 hane we
)=1 (54, of4c0 .'. soloi
equation diophen
fine the Sole )
Bcblcmu
equationDiophanine
Selve ta
the Dphentine cqutin foxt N2y 168
(Any 2-3,

42= H2-t0xl
1) (i
|12= ox] + 4 to

3) 42)to (I
10= 42 X|+2 8 ) I8= t0- 42X)
28) 4n (1
14)28(2
28
Cony id er

42-0X) +42X

=)(2-ox )x 2 -0x1
’ 19x 2. -tO XL -ox1
) 12 X

l4= to(-2) + I12(2)


Jaz -3 is a pay ti ulay
Valus

You might also like