|
[1] R. L. Rivest, A. Shamir, and L. Adleman, “A method for obtaining digital signature and public-key cryptosystems,” Com. of the ACM, vol.32, pp.120-126, Feb. 1978. [2] P. L. Montgomery, “Modular multiplication without trial division,” Mathematics of Computation, 44(170):519-521, April 1985. [3] Po-Song Chen, Shih-Arn Hwang, and Cheng-Wen Wu, “A systolic RSA public key cryptosystem,” Proc. IEEE Int. Symp. Circuits and Systems (ISCAS), pp. 408-411, May 1996. [4] Ching-Chao Yang, Tian-Sheuan Chang, Chein-Wei Jen, “A new RSA cryptosystem hardware design based on Montgomery’s algorithm,” IEEE Transaction on Circuit and System II: Analog and Digital Signal Processing, vol.45, pp.908-913, 1998. [5] Jin-Hua Hong and Cheng-Wen Wu, “Radix-4 modular multiplication and exponentiation algorithms for the RSA public-key cryptosystem,” Proceedings of the ASP-DAC 2000 on Design Automation Conference, pp.565-570, 2000. [6] Jin-Hua Hong and Cheng-Wen Wu, “Cellular-array modular multiplier for fast RSA public-key cryptosystem based on modified Booth’s algorithm,” IEEE Trans. VLSI System, 2003. [7] R. K. Kolagotla and W. R. Griescbach, “VLSI implementation of a 350MHz 0.35um 8-bit merged squarer,” Electron. Lett., vol.34, pp.47-48, Jan.1998. [8] J. S. Wang et al, “An Ultra Low Power, Fast Lock-in, Small Jitter, All Digital Delay Locked Loop,” Proc. IEEE ISSCC, 2005, paper 22.7. [9] H. T. Bui, Y. Wang, and Y. Jiang, “Design and Analysis of Low-Power 10-Transistor Full Adders Using Novel XOR-XNOR Gates,” IEEE Transaction on Circuit and System, vol. 49, January 2002. [10] Oscal T. -C. Chen, and Robin Buey-Sin Sheen, “A Power-Efficient Wide-Range Phase-Locked Loop,” IEEE Solid-State Circuits, Vol. 37, No. 1, Jan. 2002.
|