
Ushbu maqolada Rabin–Miller algoritmiga asoslangan tublikka sinash metodikasi takomillashtirilib, rekursiv funksiyalar yordamida kriptobardoshli kalit generatsiyasining samaradorligi oshirildi. Taklif etilgan 1*-algoritmda murakkab sonlarni aniqlash aniqligi oshgan bo‘lib, "soxta guvohlar" sonini keskin kamaytirish orqali algoritm xavfsizligini kuchaytirishga erishilgan. Takomillashtirilgan algoritm Microsoft Visual Studio 2008 muhitida, C# dasturlash tilida ishlab chiqildi. Dastur MPFR/MPIR kutubxonasi yordamida katta sonlar ustida amallarni amalga oshiradi. Natijalar takomillashgan algoritmning samaradorligi va xavfsizlik darajasi yuqoriligini tasdiqlaydi.
Rabin–Miller testi, rekursiv funksiyalar, kriptobardoshlik, kalit generatsiyasi, soxta guvohlar, C# dasturlash tili, MPFR/MPIR kutubxonasi, axborot xavfsizligi
Rabin–Miller testi, rekursiv funksiyalar, kriptobardoshlik, kalit generatsiyasi, soxta guvohlar, C# dasturlash tili, MPFR/MPIR kutubxonasi, axborot xavfsizligi
| citations The total number of citations received by all articles of the researcher of interest. | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
