KATTA SONLARNI FAKTORIZATSIYA QILISH MUAMMOSINI SAMARALI HAL QILISHDA SHOR ALGORITIMDA FOYDALANISHNING BOSHQA ALGORITMLARDA SAMARADORLIGI
Keywords:
Faktorizatsiya, Shor algoritmi, RSA algoritmi, Brute Force algoritmi, Trial Division algoritmi, Fermatning faktorizatsiya usulli, Pollard’s Rho algoritm.Abstract
Ushbu maqoladi katta sonlarni faktoralizatsiya qilish uchun ishlatiladigan Shor algoritimini boshqa RSA, Brute Force, Trial Division, Fermatning foktaralizatsiya usuli, Pollard Rho algoritmidan farqlari pythonning numpy va pyplot va kutubxonalarni qollsh ososida olingan natijalar orqali tahlil qilinadi.
References
Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. Introduction to Algorithms. MIT Press, 2009.
Crandall, R., & Pomerance, C. Prime Numbers: A Computational Perspective. Springer, 2005.
Riesel, H. Prime Numbers and Computer Methods for Factorization. Birkhäuser Basel, 2012.
Bressoud, D. M. Factorization and Primality Testing. Springer, 1989.
Pollard, J. M. "A Monte Carlo Method for Factorization." BIT Numerical Mathematics, 15(3), 1975, pp. 331-334.
Knuth, D. E. The Art of Computer Programming, Volume 2: Seminumerical Algorithms. Addison-Wesley, 1997.
Shor, P. W. "Algorithms for Quantum Computation: Discrete Logarithms and Factoring." Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994, pp. 124-134.
Nielsen, M. A., & Chuang, I. L. Quantum Computation and Quantum Information. Cambridge University Press, 2010.
Downloads
Published
Issue
Section
License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.