Al-Farg'oniy avlodlari (The descendants of Al-Fargani)
Published May 5, 2026 | Version v1
Journal article Open

EYLER FUNKSIYASI VA TEOREMASINING OCHIQ KALITLI KRIPTOTIZIMLARDAGI AHAMIYATI

Authors/Creators

  • 1. Farg'ona davlat texnika universiteti "Dasturiy injiniring va kiberxavfsizlik" kafedrasi assistenti

Description

Ushbu maqola Eyler funksiyasi va Eyler teoremasining ochiq kalitli kriptotizimlar, xususan RSA algoritmidagi fundamental rolini yoritadi. Maqolada Eyler funksiyasining matematik asoslari, uning multiplikativlik xususiyati, Eyler teoremasining isboti va ularning kriptografik qo'llanilishi tahlil qilinadi. Shuningdek, Eyler funksiyasini hisoblash murakkabligi va uning kriptotizimlar kriptografik mustahkamligiga ta'siri hamda Eyler funksiyasining zamonaviy kriptografiyadagi dolzarbligini va qo'llanilish istiqbollarini ochib beradi.

Files

18_1141-117-119-Arabboyev.pdf

Files (278.5 kB)

Name Size
md5:34a2443ff1d673f68835a595d4c5097d
278.5 kB Preview Download

Additional details

References

  • Chapman R., Dirichlet's theorem: a real variable approach, unpublished work.
  • Kraft, J.S., Washington, L.C. Elementary Number Theory. CRC Press, 2014.
  • Grytczuk A. and W´ojtowicz M., On a Lehmer problem concerning Euler's totient function, Proc. Japan Acad., 79, Ser. A, 136-138 (2003)
  • Holm, T. Modular Arithmetic. From Integers to Cryptography. Wiesbaden: Springer Spektrum, 2020. 43 p.
  • Hoffstein, J., Pipher, J., Silverman, J.H. An Introduction to Mathematical Cryptography. 2nd ed. New York: Springer, 2014. 538 p.
  • Zheng, Z. Modern Cryptography Volume 1: A Classical Introduction to Informational and Mathematical Principle. Springer, 2022.
  • Kumar, P., Singhal, N., Pandey, D. "Euler Totient Function and Fermat-Euler Theorem Based on Optimized Key Management Scheme for Securing Mobile Agents Migration". Electronic Systems and Intelligent Computing, vol. 860, pp. 533, 2022.
  • Childs, L.N. Cryptology and Error Correction: An Algebraic Introduction and Real-World Applications. Cham: Springer International Publishing, 2019. 351 p.
  • Rybalov, A.N. "On the generic complexity of the problem of computing the Euler function". Prikladnaya Diskretnaya Matematika, 2024, no. 65, pp. 110–117.