Shov's Algorim
crybrtytems ae based on e
’ Pablic hoy cen not e
belief ht centn foolles
hey cryphgrafbhy à aymehi hey
’ Padle
Lrgptosysem.
hoy i wed to deaybt he daa.
’ fivat hat
algonhms baed on he fact
’ RSA atsihm that
heres ho lasical, eno
Can
a lange himden.
1. Selet tuo lange rinenspa
2. Corut the faodut
shall odd estee
3. Selact a tan don -pg-).
e'hati corime wilth do)
9. Compt
ed moduls dh) =l
privala heyo S= Cd, n).
1994 shoued hat ASA lsoilhn
Peten Shor tn Me shoed a guanhe alsh
can be rshon. faoa a lae
hat cam s find ha prjne
nmben effiiens.
detail af
DBelre going -énto e leann
Shors algoih,lts tne
malhemahcal bchs.
1. Quanhem Fowitn Trcnsfn
Letw conider discveta cobe data set
..
The dicret fourin banlrm f le data
Set i give bg N-l
N
e
j=o
eg. het data set be
2
j=0
So
25 is
data t e t ,
Quantem Foritn Traemi baically
the DETof the ambhds of quanhem
states N-I
N-I
kzo
N-!
tshae Che
VN
2. Eucld Theorem
ke?'aamdbbe trs ttogeu eith ay6
be remainden hen ais
Let
divided bys "
6) = gcd(6,).
gcd (a, be
gcdof shalles
suducad to Ma
henbeu a
hll be got eemader
We coninue
Ze.
eg Find gcd of 62s, 143o
6924 = 4X1430t lloS
FtoR |430 = 1X)0s +3 25
1los - 3x32s t|3O
32S =2X130 + 65
130 2x65 wih ze6npnaca
) gcd (625,1430) = 65
3. Periodof a modaar fenchon
be lhogh af as
Modelan aihmehe can
aoilhmehc af smain de.
For any pasihe tnteges x, n they ca
X=hn +
s want
sLetnlamben N' to feind prine fators af a
°x'hat ç c9-pome cih N
’hetuchose 1).
(coprme nembas haue fator
xtNae Cofrimc hen gcd a)=l
So by Edid also thay ei the, we geta
a
'ht
The sma llest bosih ue totege
atih satufies
TodN=l
àcaled as den of (t nod N)
hod N X mod NI
Ahe period afthe modulen
J is
tunchia mod N.
eg hetw wantto fatoiz N=l5.
Let =7
tabe
gcd CI5;) =!
We sea hat Coprihe uilth 15.
7i
-)
xmod N = 7mod l5 = 1
zmodN = 7'med 15 = 7
zmod N 7 mod )5 = 4
7od 15 = 13
2 od N =
zmod N
74 med 15 = I
N
75 rod IS =7
x°md N
- 7 ' had 1S = l3
So penid f
TBieany to see ht
fellowins three case aiH.
Now
t odd
(6)
(c) i euen and ud Nt-/
(a) C6) ae a no wsebut cc) wsehl.
Let b)mod N= O
=) +)( ) m d N-0
N mut hane at least oe commo fas
Butewnt non -hivial factos
mod N |
AmodN-1
ye can Jee
hen atleat one f e ho nantes
gcd (N, z ) i a honbivial
has e
eduad to feindng he orden al
the fenchan
mod N = l/
4. Conbnud fachon apresabio
berbresented a
Aeal nchnben Rcan
an
eg. R== 15
R= 15 3+
=3 +
dR=E = [3, 1,3J
eg. R- 432 o
30
|+
2+.
R=L2, 39
3+
So hetoatogy to ftnd poime fat
a large ncyba i thi
4. Randoly choe a hlnte Dc
that is co-briewih'N?
2. Find theorde nd N
[Link] i euen ed mdN = -1
Conhnue to nect steb oebe go oteß 1.
4. Computa 9cd ( x , N), fantheone
f hom Cuill be he han-hivial fa ir
Here only stef 2 is Quantem
Ohe shep
shos algoslhm a.
The shebs tinvelueden Cstop2.
Shor d: Coeata tws quanh nemog
hps
ragstes md inihalize
Here B alog, N Zt<alog, VaN
l-no af gubids needed to stoe N.
Log, 15 = 39, og, Vax)S = 44
Shar fe.:l Find
oab/ami
2t
dn)
VatM
sha
ue will obew a sat f hh
n
Exanpé
t=,l=4
Mere
14>=
Vaso
+/3>lds)+ .... +h) I-ndu)
Shor2: Uee t Hadamand gate to 2*da
Creat egual subeboiha oo
Sha3: Pelom amdulan eafonet of Jhe
fut aguto second.
Vatl2/2mod N)
Sher measunehe stat fregisten 2.
mod N= 9
shata of tho vales af which ae
cernsd N
As 2cmod beiedic wih odes
cwill be
M4
Vd+m
Vm
Ma
Chak
<
/ 7hd1S = d
2
Chach
fom cJnhe
en Cancan ihih
be
,2]
Supor
wegiita
1 meare weNloc
afugua
1) (shat
l47-+1)
+hs) The
)blaun wegisten2 Suffose
4)s>7t.
Vasó
3 (48,1s) gcd
d(7,
S)
(x,N) d
faca Thed
now
mods
=l 7Hat find lwe
(2)
Chech