1. Inyutin, S.A. Modulyarnye vychisleniya v sverkhbol'shikh komp'yuternykh diapazonakh /
2. S.A. Inyutin // Izv. vuzov. Elektron. − 2001. − № 6. − S. 65−73.
3. Inyutin, S.A. Osnovy mnogorazryadnoi algoritmiki / S.A. Inyutin. − Surgut : RIO,
4. - 137 s.
5. Chetyrekhmodul'naya sistema modulyarnoi obrabotki informatsii dlya vysokotochnykh vychislenii / A.A. Kolyada [i dr.] // Informatika. − 2008. − № 1 (21). − S. 18−30.
6. Umnozhenie po bol'shomu modulyu v minimal'no izbytochnoi modulyarnoi sisteme
7. schisleniya s primeneniem operatsii masshtabirovaniya / A.F. Chernyavskii [i dr.] // Informatika. − 2009. − № 4 (24). − S. 49−65.
8. Posch, K.S. Modulo reduction in residue number system / K.S. Posch, R. Posch // IEEE
9. Trans. on parallel and distributed syst. - 1995. - Vol 6, № 5. - P. 449-454.
10. Schwemmlein, J. RNS-modulo reduction upon a restricted base value set and its applicability to RSA cryptography / J. Schwemmlein, K.S. Posch, R. Posch // Comput. and security. - 1998. - Vol. 17, № 7. - P. 637-650.
11. Bajart, J.-C. An RNS montgomery modular multiplication algorithm / J.-C. Bajart,
12. L.-S. Didier, P. Kornerup // IEEE Trans. Comput. − 1998. − Vol. 47, № 7. - P. 766−776.
13. Hiasat, A.A. New efficient structure for a modular multiplier for RNS / A.A. Hiasat // IEEE
14. Trans. Comput. - 2000. - Vol. 49, № 2. - P. 170−174.
15. Cox-Rower architecture for fast parallel Montgomery multiplication / S. Kawamura [et al.] // Eurocrypt 2000, LNCS. - Berlin, 2000. - Vol. 1807. - P. 523-538.
16. Implementation of RSA Algorithm Based on RNS Montgomery Multiplication / H. Nozaki
17. [et al.] // Proc. Cryptographic Hardware and Embedded Systems (CHES 2001). - USA, 2001. -
18. P. 364-376.
19. Alia, G. Fast modular exponentiation of large number with large exponents / G. Alia,
20. E. Martinelli // J. Syst. Archit. - 2002. - Vol. 47, № 14-15. - P. 1079-1088.
21. Lee, K.-J. Systolic multiplier for Montgomery’s algorithm / K.-J. Lee, K.-J. Yoo // Integration. - 2002. - Vol. 32, № 1-2. - P. 99-109.
22. RSA speedup with residue number system immune against hardware fault cryptanalysis / S.-M. Yen [et al.] // Lect. Notes Comput. Sci. - 2002. - Vol. 2288. - P. 297-413.
23. Bajard, J.-C. A Full RNS Implementation of RSA / J.-C. Bajard, L. Imbert // IEEE Trans.
24. Comp. - 2004. - Vol. 53, № 6. - P. 769-774.
25. Lim, Z. An RNS-Enhanced microprocessor implementation of public key cryptography /
26. Z. Lim, B.J. Phillips // Signals, Systems and Computers. ACSSC 2007. Conf. Rec. of the forte-first Asilomar Conf. - USA, 2007. - 2007. - P. 1430-1434.
27. Kolyada, A.A. Modulyarnye struktury konveiernoi obrabotki tsifrovoi informatsii / A.A. Kolyada, I.T. Pak. - Minsk : Universitetskoe, 1992. - 256 s.
28. Chernyavskii, A.F. Obshchaya tekhnologiya vychisleniya integral'nykh kharakteristik modulyarnogo koda / A.F. Chernyavskii, A.A. Kolyada // Doklady NAN Belarusi. - 2008. - T. 52, № 4. - C. 38-44.
29. Montgomery, P.L. Modular multiplication without trial division / P.L. Montgomery //
30. Mathematics of Computation. - 1985. - Vol. 170, № 44. - P. 519-521.
31. Kharin, Yu.S. Komp'yuternyi praktikum po matematicheskim metodam zashchity infor-
32. matsii / Yu.S. Kharin, S.V. Agievich. - Minsk : BGU, 2001. - 190 c.
33. Matematicheskie i komp'yuternye osnovy kriptologii / Yu.S. Kharin [i dr.] - Minsk : Novoe znanie, 2003. - 382 s.
34. Funktsional'nye osobennosti i obshchie printsipy realizatsii modulyarnoi vychislitel'noi tekhnologii na diapazonakh bol'shoi moshchnosti / S.M. Zavgorodnev [i dr.] // Elektronika info. - 2008. - № 12. - S. 50-55.
35. Chernyavskii, A.F. Umnozhenie po bol'shim prostym modulyam na osnove minimal'no izbytochnoi modulyarnoi skhemy Barretta / A.F. Chernyavskii, A.A. Kolyada // Doklady NAN Belarusi. - 2010. - T. 54, № 2. - S. 40−53.