1. Zhang Zhenxiang. Finding C3-strong pseudoprimes // Mathematics of Computation. 2004. Vol. 74. No. 250. P. 1009-1024. DOI: 10.1090/S0025-5718-04-01693-X
2. Xiao Li, Xia Xiang-Gen, Wang Wenjie. Multi-stage robust Chinese remainder theorem // IEEE Transactions on Signal Processing. 2014. Vol. 62. Issue 18. P. 4772-4785. DOI: 10.1109/TSP.2014.2339798
3. Медных А.Д., Медных И.А. Циклические накрытия графов. Перечисление отмеченных остовных лесов и деревьев, индекс Кирхгофа и якобианы // Успехи математических наук. 2023. Т. 78. Вып. 3 (471). С. 115-164. DOI: 10.4213/rm10098
4. Медных А.Д., Медных И.А., Соколова Г.К. Сопровождающая матрица суперпозиции полиномов и ее применение к теории узлов // Доклады Российской академии наук. Математика, информатика, процессы управления. 2025. Т. 521. С. 72-80. https://www.mathnet.ru/rus/danma621.
5. Нестеренко Ю.В. Теория чисел. М.: Академия, 2008. https://zbmath.org/1231.11001.
6. Vallée B. Dynamical analysis of a class of Euclidean algorithms // Theoretical Computer Science. 2003. Vol. 297. Issues 1-3. P. 447-486. DOI: 10.1016/S0304-3975(02)00652-7
7. Morris I.D. A rigorous version of R.P. Brent’s model for the binary Euclidean algorithm // Advances in Mathematics. 2016. Vol. 290. P. 73-143. DOI: 10.1016/j.aim.2015.12.008
8. Dupré A. Sur le nombre de divisions à effectuer pour obtenir le plus grand commun diviseur entre deux nombres entiers // Journal de Mathématiques Pures et Appliquées, Serie 1. 1846. Vol. 11. P. 41-64. https://www.numdam.org/item/JMPA_1846_1_11__41_0.
9. Goodman A.W., Zaring W.M. Euclid’s algorithm and the least-remainder algorithm // The American Mathematical Monthly. 1952. Vol. 59. Issue 3. P. 156-159. DOI: 10.1080/00029890.1952.11988092
10. Johar M.S. Minimal number of steps in the Euclidean algorithm and its application to rational tangles // Rose-Hulman Undergraduate Mathematics Journal. 2015. Vol. 16. No. 1. Article 3. P. 57-72. https://scholar.rose-hulman.edu/rhumj/vol16/iss1/3.
11. Brown Jr. J.L., Duncan R.L. The least remainder algorithm // The Fibonacci Quarterly. 1971. Vol. 9. Issue 4. P. 347-350. DOI: 10.1080/00150517.1971.12430990
12. Shea D.D. On the number of divisions needed in finding the greatest common divisor // The Fibonacci Quarterly. 1969. Vol. 7. Issue 4. P. 337-340. DOI: 10.1080/00150517.1969.12431141
13. Çelik S., Durukan İ., Özkan E. New recurrences on Pell numbers, Pell-Lucas numbers, Jacobsthal numbers, and Jacobsthal-Lucas numbers // Chaos, Solitons and Fractals. 2021. Vol. 150. 111173. DOI: 10.1016/j.chaos.2021.111173
14. Кан И.Д. Достижимость неравенств из теоремы Ламе // Дальневосточный математический журнал. 2024. Т. 24. № 1. С. 45-54. DOI: 10.47910/FEMJ202405
15. Гашков С.Б. Занимательная компьютерная арифметика. Быстрые алгоритмы для операций с числами и многочленами. М.: URSS, 2012. https://www.elibrary.ru/item.asp?id=19466675.
16. Bernstein D.J., Chen Han-Ting, Harrison J.R., Huang C., Maxwell G., Wang Bow-Yaw, Wuille P., Yang Bo-Yin. Accelerating and verifying constant-time modular inversion // Advances in Cryptology - EUROCRYPT 2026. 45th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Rome, Italy, May 10-14, 2026, Proceedings, Part VII. Cham: Springer, 2026. P. 598-627. DOI: 10.1007/978-3-032-25336-1_21
17. Bernstein D.J., Yang Bo-Yin. Fast constant-time gcd computation and modular inversion // IACR Transactions on Cryptographic Hardware and Embedded Systems. 2019. Vol. 2019. Issue 3. P. 340-398. DOI: 10.13154/tches.v2019.i3.340-398
18. Savaş E., Koç Ç.K. Montgomery inversion // Journal of Cryptographic Engineering. 2018. Vol. 8. Issue 3. P. 201-210. DOI: 10.1007/s13389-017-0161-x
19. Aldaya A.C., Sarmiento A.J.C., Sánchez-Solano S. SPA vulnerabilities of the binary extended Euclidean algorithm // Journal of Cryptographic Engineering. 2017. Vol. 7. Issue 4. P. 273-285. DOI: 10.1007/s13389-016-0135-4
20. Jin Yaoan, Miyaji Atsuko. Compact and efficient constant-time GCD and modular inversion with short-iteration // IEICE Transactions on Information and Systems. 2023. Vol. E106.D. Issue 9. P. 1397-1406. DOI: 10.1587/transinf.2022ICP0009
21. Zhou Qiang, Tian Chengliang, Zhang Hanlin, Yu Jia, Li Fengjun. How to securely outsource the extended Euclidean algorithm for large-scale polynomials over finite fields // Information Sciences. 2020. Vol. 512. P. 641-660. DOI: 10.1016/j.ins.2019.10.007
22. Koshy T. Pell and Pell-Lucas numbers with applications. New York: Springer, 2014. DOI: 10.1007/978-1-4614-8489-9
23. Weyl H. Über die Gleichverteilung von Zahlen mod. Eins // Mathematische Annalen. 1916. Vol. 77. Issue 3. P. 313-352. DOI: 10.1007/BF01475864
24. Cohn J.H.E. Perfect Pell powers // Glasgow Mathematical Journal. 1996. Vol. 38. Issue 1. P. 19-20. DOI: 10.1017/S0017089500031207
25. Cao Zhengjun, Lui Lihua. An elementary proof for Ljunggren equation // arXiv:1705.03011v3 [math.NT]. 2017. DOI: 10.48550/arXiv.1705.03011