pcceceathihniy ace :
Retatvily puime numbas
HEE GCD > Greatest Common Divisior - Highest common. fexclor
Two numbeis ate Satd tobe wesc ety Ppame
ep they have no pume faciess fF Common. cand
thels only common factos tS 1
% Tf G@cDCab)=t then a 6 ate Pelstively prime
number
¥ co- prime
© Ext Ave 4 seratively prime
Common Divi + Ye
getarivery Prime numbtr
Divisers
Hpig are
Divisior
Common Divisio: |
Sued
qcp(a.b) Reicstively ment )
—j—_. Paime’>? |e
? Yes ‘a’ Bb ate
a yes ‘ais prime is
‘bts compost
12 at 1 yes Sg ahd B are
| Composite
iEutes’s Totent Funceto® 2-
> feerceton
oe Denotd as PCr?
% cm) = Number of posite
shat ave velatively
ye tarceens Less thon
prime tO?
ex fend $s)
Hewe ns
Mee ess we? em
e@=!* 1B
getakively prime ?
yes
yes
qed
gencis) =!
qcD@-)=! yes
yes
qed ur
[xe sud
2) find 9c)
Hese net
Numbers Less then (1 ame 12. 2 EAB A HlO
fo CUD= 10
=o) $6¢8) = 41
Hese n=8
wumbas less than 8 awe 62,3,6786 OF
Ged Retarivety Prin.
(usd=) wa
C2922 *
(3.99) vi
(wary a
(a)*! ve
8)z2 x
asl vs
a ee. SDvem mal BNCr BY
where Pipa, are
distinck Primes
Etther a a8 fs
camposite
Rach W p'b ere
composite
HBametons’ gs) there ore 4 numbers acho OC
Heve 25 MeeeR AGRE cate vetaasiait
afed= 4 Ser aes
:
a) Find aca
(31) = 30
a) FInd las)
2 a6
op ts. procluct of 5 cael
gen) = PACT = (5-1
gcaea= 24 .
4) Find 4 (ooo)
nz inno 294x657
Distince prime factors Qe 9 cand 5
Mme Cb
a (#) (#) | :
y AGA) = 4x6 = 94
saw
e)= 400ee
5) ¢ (tooo ) v
: = xs*xH! : wy
PN era Was
Cn) = 4o00x (1-4) 0-3) 04 Ne
> C4000)= 2400
eBmats little theosem
rf P ts a prime number and a’ is @
POSrtive tnteger not divisible by p then
P= 1 (modp)
Example:
') Does feomar's
theotern, hold. 4ee for P25 a2
PHS & G2
aM=| (modp) ye?
Sor alg
2 \ (mods )
a4 t(mads )
te (mod 5)
Fermest'’s theorem holds
tre for pos
Pp c=2
ay ps8 casi 3) P26 and az2
Pl 5
a’ = |fmodp ) = Imode 2?
= id. 0.
1” = (media) 32 = 1 modé 30
1A nnad3 = 1 does not hold trees.
2 i
-2 “mod (3 =) 4) pell Ee
-20"9 = q™od 137 ee.
a2 ' Gnod@ ) 55-1 modu
at = 1 cmedta}
CH= | modar
Holds tee fox pris P aall
2
at
wo) aewey
Tmad 9.
(Prove Exeter's theorem hold tee for G29 (Neo
oak nao
ane = \ mod)
Batic © to(oene bets)
= > 0) Gn
= t modo
4
i modto
tolds true
a
2) asa
They ave
Nelo
or metarveny PUM
0
86) 2 moat
ghee) = i medio
Cio =4r
at S tmod io
te = | mod 10
does not holds twat
D asio neil #) on
cn)
ad att = tmodcn ot holds tree
10%) Be en
qc) =10
ne ag
1 mod!
1 (modi)
= 1 tmodu)
Holds tee forPrlmetive
« ts
E cemples
> T8eome
a’ mod
>> maxis
a wx
2
9' mod?
a® mod?
29 ‘.
2 mod t
et mod t
Roots
Sil te be PHimetive Wot of prime nS
* mad Pp, xmalp xPthodp eure distinct
primitive Foot of Prime heamb 5
a 2 meds
xt 14 owod 1
|
vox & Pine, number & S
primutive yoot Of prime Namber 7
1
prin
4
u mod
pot a primitive Tot of Prime ncember
i
modsmeee |
”
Chinese Reminder —
ESE mcetndes theprem
> Used 45 solve @ See of diffacas Congrant eesen
with one variaHe bet Sfeoent bese hele ephech,
AWE Teleetivery poi rnc
X= SiCrodm,)
X So (modm2)
>
{
% = @nCmodmnpy
PR Sietes thos Che hovel. gzescetéons (hae
CMMs Sokstton of the ro dete cee Tetativetty Prime
~! Pa
X= Camm +£A2M9Mg' +03 magia. __ +GeMpMa ) med rn.
Exc. rples +
y X=2lmod a)
fi
x
2X = 9 med3
3 mtd 5) > yx
rod 4 => x
3 mode
2 mtd t
x = Coun pas! B+ O2mMy
Ms" +Qgm3mq ) medny
cee is Big TO Fine Mt, M2.mg PM", nat
92229 macs M
as=2 rmge7
[i Mixmaxm3= gysxq =10s |
MizM ~ 105
i ge Mr = Minmi=mod ms = 251m Limeda
ce 3 Ma! = Maxmg = mod mo <9)xm3! =Imeds
Mazi _ 05 = al A 03 > SKM g\= | matt
mg > “gs Iygl = Ma amg =modms = 1SKMg
M32 x iC) ~
ieee
pol oa
a of
X= 9(35)08) + 3 (a1) + 2(15)C!)
ro &, = (40 +62486) mod 1s
= (233)mod 05 -
f a a SOS2x = 6 mod 20
Recerstteng
HxX= 5 modq
5
°
Yxup ies a'x 5 mod4
2x3 (m6d 20)
X 5 i qmodq)xémed9)
@+F 15 (mo 9)
ax
35 mod 4
air
M= mitme =4120 =180
aar3
=M igo i
Pee = q 720 mon
Bees te. = q xMa= | mode
qe eee
Me'=q
X= ge x20xs +
= 800+ 843 mod (80
\oy3° mod 180
= (43senete log ctithem
ClOCK Cet ovithen
owe one, omy Feanceron,
«4
te ' :
“6 3
m4 4
“ ‘ §
2
u $
to 4,8 7
a
OO meadin
quately dispebiel
6 ts
PR bev! wot of
Mw Tf S*mod 1 = 2
* | bi medp
eu : = | x
() solve less 4 mod
2 u
He Pp.
\
| bg, 5X nmodp |
Leb temm—aed |
‘ ‘
m
owed oJ? mod
pine 69 moder
s 41
ered (4 fit ened tf
6" malt ied [4
3 molt Be d
66 wodlt si
st modit Sona ™
52 modit
6ST madtt
5!® modit
5s” modit
PEE Neem bee 14
X= 2" mod P
1 =a’ modu
Tey 1
(nz6]n= Cx) OY)
=O) a)
Bae xs Vigyey®
; x= Visite oH inte er
x= {191+3? = ae =
eeueves)
2) Factee n= 3233
x= VEa5a4+y>
a (s233447 = V32y9q = 9%
¥esSt ye
n =, (69 (5D
mn = 32723me
Ri 8S. Fields © Finite Fie ’
R ts denoted by {pi+,t }
Set Of Clements with too binasy operations adblienhis
Such that for at! a,b.cce
integyrot domain, Commusafive wing
Ftelds
jeiteth. - see OF Elements with te00 binary
Operation. such thof for au a.bC.CF the Tolling cruioms
Mustipliccttive tnyerse si ore. obeyed
Finite Fietds
Fretd Contcins finite number Of clans
Meee mod p 150 puma. nambor——_
Testing, for _primeutivity
Dy Eotmar's Primeetity test
aPa 4 pis prime if ths isa roustiPle of P’
for au 1SA
-3 = 240
42-4 = 1020 <
fi) 3753-° a= 14@4 3952
Impossible meennsucelly
theon 4cets S61 7S Prime
but F
less accuse
25
siepi
Step 2 2 Choose ‘a
bo=a™(mod )
( composite
— probably Ptime
1
=2
Bo 3 b2= 166 modn
bi = bo mod D b2= 64
ee Composite.Sirota hi tbelicen:. Crows
A Geoup G denoted by {G+}. ts a Set under at
i Some Spexctions G:) if it ScosSfies the CAIN pxope
* C~ Closure ~ .
HR — Associative
*L - Tdensty
NN nWesse
Group ts said to be Abelian if it ane ;
SFeup and Commetcsive prop erty ts also fic
Tee (a-6)=Cb0) fos atl aben G
Closure =40,b EG then GEG
Asscackt => G-Cbec) ab).C for Cal) A,b.C EG
Tdlenadty ele —> (, a for all a.e6G
Toverse eled=> C
atl waleg
Cornmsstt => Gob) = (
7s not a groupyy Bencrasion
Step t Select 2 larpe prime pole Pea
© for more security
Ux3'= 33
the :
a coulcaseate cn) = c0-G-1)
mi =.03-419 Cun)
_ = Sxto
4m) = 20 |
4) choose the vatuc of (6) Such thot
qceF¥d mod20 =
y x3 modad =1
ss ade i
Public key = fean} = $4:39} —s fy se
Private leey = elon) Se 63h eae i
Se
Used. e
eeeencryption
cem®eod n mss no.of digits Cr pr
= (1) moda3 Ta 'Sighe text
=u] men
let (m= aly
=, plosn tor
Deny prion
m oF modn
a
m= 4°) mod 33
6y mod 33
3)}
}
4
Muttiplicarteve inverse
x10 1 4
~—t
|
Be). .°h
a uw @rds
4 5 =
Vi a \yt
g |
=> 4
-2 ca
“g> 6
yo
3
—~>6