ELLIPTIK EGRI CHIZIQ KRIPTOGRAFIYASI ASOSIDA KVANT KALIT ALMASHINUVI SXEMASINI MODELLASHTIRISH
Qabul qilingan: 2026-07-15 13:01:55
Nashr etilgan: 2026-04-18
Annotatsiya
Ushbu maqolada Elliptik egri chiziq kriptografiyasi (ECC) asosida kalit almashinuvi jarayoni va uning kvant simulyatsiyasi Qiskit muhiti yordamida amalga oshiriladi. Elliptik egri chiziq ustida nuqta qo‘shish va ko‘paytirish amallari orqali Alice va Bob o‘zlarining maxfiy va ochiq kalitlarini generatsiya qiladi. Shundan so‘ng, ular o‘zaro umumiy kalitni hisoblaydilar va ushbu kalit bir xil natijaga ega bo‘lishi tekshiriladi. Maqolada kvant simulyatsiya bosqichi sifatida Hadamard va CNOT kvant darvozalari ishlatilgan bo‘lib, ular orqali kvant holatlaridagi superpozitsiya va bog‘liqlik (entanglement) jarayoni modellashtirilgan. Natijalar kvant hisoblashning ECC asosidagi xavfsiz kalit almashinuvi tizimlarini yanada takomillashtirish imkonini berishini ko‘rsatadi.
Kalit so'zlar
Adabiyotlar ro'yxati
-
Swan M. Blockchain: Blueprint for a New Economy. — Sebastopol, CA, USA: O’Reilly Media, 2015. — 352 p.
-
Bennett C. H., Brassard G. Quantum cryptography: Public key distribution and coin tossing //Proc. IEEE Int. Conf. Comput. Syst. Signal Process. — 1984. — P. 175–179.
-
Lenstra A. K., Verheul E. R. Selecting cryptographic key sizes // Journal of Cryptology. — 2001. — Vol. 14, № 4. — P. 255–293.
-
Shor P. W. Polynomial–time algorithms for prime factorization and discrete logarithms on a quantum computer // SIAM Review. — 1997. — Vol. 41, № 2. — P. 303–332.
-
Diffie W., Hellman M. E. New directions in cryptography // IEEE Transactions on Information Theory. — 1976. — Vol. 22, № 6. — P. 644–654.
-
Rivest R. L., Shamir A., Adleman L. A method for obtaining digital signatures and public–key cryptosystems // Communications of the ACM. — 1978. — Vol. 21, № 2. — P. 120–126.
-
Koblitz N. Elliptic curve cryptosystems // Mathematics of Computation. — 1987. — Vol. 48, № 177. — P. 203–209.
-
Miller V. S. Use of elliptic curves in cryptography // Advances in Cryptology — CRYPTO '85. — 1986. — P. 417–426.
-
Menezes A. J., van Oorschot P. C., Vanstone S. A. Handbook of Applied Cryptography. — Boca Raton: CRC Press, 1996. — 780 p.
-
Gentry C. Fully homomorphic encryption using ideal lattices // Proceedings of the 41st Annual ACM Symposium on Theory of Computing (STOC '09). — 2009. — P. 169–178.
-
Joye M., Yen S.–M. The Montgomery power ladder in elliptic curve cryptography // Cryptology ePrint Archive, Report 2002/088. — 2002. — URL: https://eprint.iacr.org/2002/088.
-
Galbraith S. D., Lin X. Implementing cryptographic pairings // Post–Quantum Cryptography.— 2011. — P. 265–289.
-
Hoffstein J., Pipher J., Silverman J. H. An Introduction to Mathematical Cryptography. — New York: Springer Science & Business Media, 2008. — 512 p.
-
Menezes A., Vanstone S. Practical Cryptography in the Global Computing Environment // Proceedings of the 1st Workshop on Cryptography and Network Security. — 1994. — P. 1–16.
-
Wang W. A blockchain–based quality acceptance system for construction projects with human– computer interaction // Proc. Int. Conf. Eng. Constr. Manage. Innov. — 2024. — P. 300–305.
-
Zhang G. et al. A blockchain–based method and system for the quality acceptance of concealed engineering // Proc. Int. Symp. Cybersecurity Inf. Secur. — 2024. — P. 20–25.
-
Zubayda Jumayeva, Nurbek Khushvaktov, Rustam Nizomov. BIO Web Conf., 173 (2025) 01030. DOI:https://doi.org/10.1051/bioconf/202517301030
Mualliflar haqida
License
This work is licensed under a Creative Commons Attribution 4.0 International License.
How to Cite
