# Burxonov uktam

 Sana 20.10.2023 Hajmi 140.73 Kb. #1712217
Bog'liq
Burxonov U

Akkauntni o’chirmaslik
BURXONOV UKTAM

chiqishdan oldin tekshirish kerak
Qayta shifrlash kerak

Kiberxujumlar ko’payishi

Ishonchsiz saytdan foydalanish

Maxfiy ma’lumotlarning tarqalishi

aybdorni topish
Rasmiylik kerak
Qonuniy chora ko’rish kerak

Xodim ishdan bo’shatilsa

Ishonchli odamlarga ma’lumotlarni berish kerak kerak

O’rin almashtirish usullari
O’rin almashtirish shifirlash algoritimi uch qisimdan iborat.Oddiy o’rin almashtirish, kalit yordamida o’rin almashtirish va ikki tomonlama o’rin almashtirish.
1 Oddiy o’rin almashtirish
T0 = Kiber xafsizlig fa;
 K R S I I X I G B A Z F E F L A
K =5x5;

T1 =KRSI_IXIG_BAZF_EFLA
2.kalit yordamida o’rin almashtirish
T0 = Surxondaryo viloyat;
K= Uktami;
Matnda 18- ta kalitda 3- ta harflar bor 3x6 jadval tuzamiz.
 S X D Y I Y U O A O L A R N R V O T

 U K T A M I 1 2 3 4 5 6 S X D Y I Y U O A O L A R N R V O T

 A I K M T U 1 2 3 4 5 6 Y Y X I D S O A O L A U V T N O R R

T1=yyxids oaolau vtnorr
Ikki tomonlama o’rin almashtirish usuli
T=Uktambek Burxonov
K1=1342 va K2=3214

 K1/K2 1 3 4 2 3 U M B O 2 K B U N 1 T E R O 4 A K X V

 K1/K2 1 2 3 4 1 T O E R 2 K N B U 3 U O M B 4 A V K X

T1=TOERKNBUUOMBAVKX

Vernar usul

T0 = Burxonov Xolbekovich
K= Uktam
B=1=00001 U=20=10100 BU=10101===V
U=20=10100 K=10=01001 UK=10101===V
R=17=10001 T=19=10011 RT=00010===C
X=23=10111 A=0=00000 XA=10111===X
0=14=01110 M=12=01100 OM=00010===C
N=13=01101 U=20=10100 NU=11001===Z
O=14=01110 K=10=01010 OK=00100===E
V=21=10101 T=19=10011 VT=00110===G
X=23=10111 A=0=00000 XA=10111===X
O=14=01110 M=12=01100 0M=00010===C
L=11=01011 U=20=10100 LU=11111*
B=1=00001 K=10=01010 BK=01011===L
E=4=00100 T=19=10011 ET=10111===X
K=10=01010 A=0=00000 KA=01010===K
O=14=01110 U=20=10100 OU=10010===S
V=21=10101 K=10=01010 VK=11111===*
I=8=01000 T=19=10011 IT=11011===!
C=2=00010 A=0=00000 CA=00010===C
H=7=00111 M=12=01100 HM=01011==L
T1=VVCXCZEGXC*LXKS*!CL

A5/1 shifrlash algoritimi

A5/1 shifrlash algoritmida dastlabki kalitning uzunligi 64 bitni tashkil etib, u quyidagi uchta registorga qiymat qilib beriladi:

• X: 19 bit (x0,x1,x2, …,x18)

• Y: 22 bit (y0,y1,y2, …,y21)

• Z: 23 bit (z0,z1,z2, …,z22)

• masalan: maj(0,1,0) = 0 vа maj(1,1,0) = 1

• agar x8 = m ga teng bo‘lsa, u holda X registor qiymatlari

• t = x13  x16  x17  x18

• xi = xi1 for i = 18,17,…,1 va x0 = t

• agar y10 = m ga teng bo‘lsa, u holda Y registor qiymatlari

• t = y20  y21

• yi = yi1 for i = 21,20,…,1 and y0 = t

• agar z10 = m ga teng bo‘lsa, u holda Z registor qiymatlari

• t = z7  z20  z21  z22

• zi = zi1 for i = 22,21,…,1 and z0 = t

• natijaviy kalit ketma-ketligi x18  y21  z22 ga teng bo‘ladi.

masalan quyidagi ko’rsatilgan hol uchun;

m = maj(x8, y10, z10) = maj(1,0,1) = 1 ga teng bo‘ladi. Natijada X registor siljiydi, Y registor siljimaydi va Z registor siljiydi. O‘ng tomondagi bitlar XOR amal bo‘yicha qo‘shiladi va 0  1  0 = 1 qiymat olinadi.
Ushbu usulda bir siklda bir bit kalit x xosil qilinadi.

rsa usuli

1. p=3 q=11 UKTAM

2. 2)n=p*q=33

3. 3) =(p-1)(q-1)=20

4. e=7 e*d*mod) =1

5. 7*d*mod20=1 d=3

6. C1=Hmodn=207