O’ZBEKISTON RESPUBLIKASI AXBOROT TEXNOLOGIYALARI VA KOMMUNIKATSIYALARINI RIVOJLANTIRISH VAZIRLIGI MUHAMMAD AL-XORAZMIY NOMIDAGI TОSHKЕNT AХBОRОT TЕХNОLОGIYALARI UNIVЕRSITЕTI Kriptografiya 1 fanidan Loyiha ishi Bajardi: Raxmatov Bexzod,Valiyev Mansurxon,Zokirjonov Diyorbek,Komiljonov Yusufbek Tekshirdi: Mardiev Ulug’bek Toshkеnt – 2023
3-variant Topshiriq: Quyidagi shifr mattni rasshifrovkalang (to‘rt kishi uchun). c = 1946990934266279413917993964398835970466043305162067149027416
2053008128349816033069247844970800863920955661712219866590366
9590908102703307250646216395967327417349581565673419272952219
8445430968778476727718084419319887006224079130320273805411547
7138201099392091672934450078062438509784548210810385639731494
7527381565904894782921374911825451607
n = 3521965691682498349894156297871351510003392837134480208222044
4753957752560806765915557404471872854222134926440656261548716
5251895509139075621688493447805478090729096096693340629223579
5059531555148850225316762953811321830535065868925602454064437
6849173366230815779694365269990430445181132796913932904941185
478344783047790284034086549612594449881
e = 65537
Javoblar: Biz bu shifir matinni RSA yordamida rasshifrovkalaymiz buning uchun biz
quydagi ketma-ketlikdan foydalanamiz. Aslida faktorlarga ajratishning bir necha
usullari mavjud bular : Leman , Pollard, Ferma va boshqa turlari mavjud . Lekin biz
bulardan Pollard usulini tanladik ozimiz uchun.
