References
[1]. Shiann- Rong Kuang, Kun- Yi Wu, and Ren-Yao Lu,
(2015). “Low Cost High Performance VLSI Architecture For
Montgomery Modular Multiplication”. IEEE Transactions on
Very Large Scale Integration (VLSI) Systems. Vol.24, No.2,
pp.434-443.
[2]. Khalid Javeed, Xiaojun Wang and Mike Scott, (2015).
“Serial and Parallel Interleaved Modular Multipliers on
th FPGA Platform”. 25 International Conference on Field
Programmable Logic and Applications (FPL).
[3]. R. L. Rivest, A. Shamir, and L. Adleman, (1978). “A
method for obtaining digital signatures and public-key
cryptosystems”. Commun. ACM, Vol.21, No.2, pp.120-
126.
[4]. V. S. Miller, (1986). “Use of elliptic curves in
cryptography ”. In Advances in Cryptology. Berlin,
Germany: Springer-Verlag, pp.417-426.
[5]. N. Koblitz, (1987). “Elliptic curve cryptosystems”. Math.
Comput., Vol.48, No.177, pp.203-209.
[6]. P. L. Montgomery, (1985). “Modular multiplication
without trial division”. Math. Comput., Vol.44, No.170, pp.519-521.
[7]. Y. S. Kim, W. S. Kang, and J. R. Choi, (2000).
“Asynchronous implementation of 1024-bit modular
nd processor for RSA cryptosystem”. In Proc. 2 IEEE Asia-
Pacific Conf. ASIC, pp.187-190.
[8]. V. Bunimov, M. Schimmler, and B. Tolg, (2002). “A
complexity-effective version of Montgomery's algorihm”.
In Proc. Workshop Complex Effective Designs.
[9]. H. Zhengbing, R. M. Al Shboul, and V. P. Shirochin,
(2007). “An efficient architecture of 1024-bits
cryptoprocessor for RSA cryptosystem based on modified
th Montgomery's algorithm”. In Proc. 4 IEEE Int. Workshop
Intell. Data Acquisition Adv. Comput. Syst., pp.643-646.
[10]. Y.-Y. Zhang, Z. Li, L. Yang, and S.-W. Zhang, (2007).
“An efficient CSA architecture for Montgomery modular
multiplication”. Microprocessors Microsyst., Vol.31, No.7,
pp.456-459.
[11]. C. McIvor, M. McLoone, and J. V. McCanny, (2004).
“Modified Montgomery modular multiplication and RSA
exponentiation techniques”. IEE Proc.-Comput. Digit.
Techn., Vol.151, No.6, pp.402-408.
[12]. S.-R. Kuang, J.-P. Wang, K.-C. Chang, and H.-W. Hsu,
(2013). “Energy-efficient high-throughput Montgomery
modular multipliers for RSA cryptosystems”. IEEE Trans. Very
Large Scale Integr. (VLSI) Syst., Vol.21, No.11, pp.1999-
2009.
[13]. K. Javeed and X. Wang, (2014). “Radix-4 and radix-8
booth encoded interleaved modular multipliers over
general Fp”. In Field Programmable Logic and
th Applications (FPL), 2014 24 International Conference on,
pp.1-6.
[14]. M. Joye and S.-M. Yen, (2003). “The Montgomery
powering ladder”. In Cryp-tographic Hardware and
Embedded Systems-CHES 2002. Springer, pp.291-302.
