1. B Premkumar (1992). An RNS to binary converter in 2n+1, 2n, 2n-1 moduli set. IEEE Trans. Circuits Syst. II, 39, 480-482.
2. Bruce Schneier (1996). Special Algorithms for Protocols. Special Algorithms for Protocols, 527-557.
3. R Rivest,A Shamir,L Adleman (1978). A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 21(2), 120-126.
4. P Montgomery (1985). Multiplication without Trial Division. Math. Computation, 44, 519-521.
5. S Eldridge,C Walter (1993). Hardware Implementation of Montgomery's Multiplication Algorithm. IEEE Trans. Comput, 42, 693-699.
6. A Elbirt,C Paar (1999). Towards an FPGA Architecture Optimized for Public-Key Algorithms. the SPIE Symposium on Voice, Video and Communications
7. T Blum,C Paar (1999). Montgomery Exponentiation on Re-configurable Hardware. Proc. 14th Symposium on Computer Arithmetic, 70-77.
8. Y Kim,W Kang,J Choi Implementation of 1024-bit processor for RSA cryptosystem. Implementation of 1024-bit processor for RSA cryptosystem
9. V Bunimov,M Schimmler,B Tolg (2002). A Complexity-Effective Version of Montgomery's Algorithm. Presented at the Workshop on Complexity Effective Designs (WECD02)
10. Gustavo Sutter,Jean-Pierre Deschamps,José Imana (2011). Modular Multiplication and Exponentiation Architectures for Fast RSA Cryptosystem Based on Digit Serial Computation. IEEE Transactions on Industrial Electronics, 58(7), 3101-3109.
11. Jin-Hua Hong,Cheng-Wen Wu (2003). Cellular-Array Modular Multiplier for Fast RSA Public-Key Cryptosystem Based on Modified Booth's Algorithm. IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION SYSTEMS, 11(3)
12. C Mcivor,M Mcloone,J Mccanny (2004). Modified Montgomery modular multiplication and RSA exponentiation techniques. IEE Proceedings - Computers and Digital Techniques, 151(6), 402.
13. Alexandre Tenca,K C¸ Etin,Koc (2003). A Scalable Architecture for Modular Multiplication Based on Montgomery's Algorithm. IEEE TRANSACTIONS ON COMPUTERS, 52(9)
14. Marcelo Kaihara,N Takagi (2005). A Hardware Algorithm for Modular Multiplication/Division. IEEE Transactions on Computers, 54(01), 12-21.
15. C Koç,Acar,Tolga,B Kaliski (1996). Analyzing and comparing Montgomery multiplication algorithms. Micro, IEEE Publication, 16(3), 26-33.
16. Ching-Chao Yang,Tian-Sheuan Chang,Chein-Wei Jen (1998). A New RSA Cryptosystem Hardware Design Based on Montgomery's Algorithm. IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS-II: ANALOG AND DIGITAL SIGNAL PROCESSING, 45(7)
17. Zhimin Chen,Patrick Schaumont (2011). A Parallel Implementation of Montgomery Multiplication on Multicore Systems: Algorithm, Analysis, and Prototype. IEEE Transactions on Computers, 60(12), 1692-1703.
18. Daniel Guilhermeperin,Joãobaptista Mesquita,Martins (2011). Montgomery Modular Multiplication on Reconfigurable Hardware: Systolic versus Multiplexed Implementation. International Journal of Reconfigurable Computing, 2011, 10.
19. P Fournaris,O Koufopavlou (2005). A new RSA encryption architecture and hardware implemen-tation based on optimized Montgomery multiplication. Proc. IEEE ISCAS, 4645-4648.
20. P Montgomery (1985). Modular Multiplication without Trial Division. Math. of Computation, 44(170), 519-521.
21. L Batina,G Muurling (2002). Montgomery in Practice: How to Do It More Efficiently in Hardware. Proc. Cryptographer's Track at the RSA Conf., Topics in Cryptology (CT-RSA '02), 40-52.
22. D Walter (2002). Precise Bounds for Montgomery Modular Multiplication and Some Potentially Insecure RSA Moduli. Lecture Notes in Computer Science, 30-39.
23. Nemanja Perovic,Mena Popovic-Bozovic (2012). FPGA implementation of RSA cryptoalgorithm using shift and carry algorithm. 2012 20th Telecommunications Forum (TELFOR), 1040-1043.
