|
[1] RSA Laboratories, Frequently Asked Questions About Today’s Cryptography, Version 4.0, pp.1-101, 1999. [2] Jennifer Seberry, Josef Pieprzyk, Cryptography, An Introduction to Computer Security, pp.1-130, Prentice Hall, 1989. [3] R.L. Rivest, A. Shamir, and L. Adleman, “A method for obtaining digital signatures and public-key cryptosystems,” Communications of the ACM, Vol.21, No.2, pp.120-126, Feb. 1978. [4] Kenneth H. Rosen, Elementary Number Theory And Its Applications, Second edition, pp.61-237, Addison-Wesley Publishing Company, 1988. [5] W.T. Penzhorn, “Fast algorithms for the generation of large primes for the RSA cryptosystem,” Proceedings of the 1992 South African Symposium on Communications and Signal Processing, COMSIG '92, pp.169 —172, 1992. [6] M.J.B. Robshaw, “Security estimates for 512-bit RSA,” Conference record of Microelectronics Communications Technology Producing Quality Products Mobile and Portable Power Emerging Technologies, WESCON '95, pp-409, 1995. [7] J. Hastad, M. Naslund, “The security of individual RSA bits,” Proceedings of 39th Annual Symposium on Foundations of Computer Science, pp.510 -519, 1998. [8] M. Shand, J. Vuillemin, “Fast implementations of RSA cryptography,” Proceedings of 11th IEEE Symposium on Computer Arithmetic, pp.252-259, 1993. [9] P. L. Montgomery, “Modular multiplication without trial division,” Mathematics of Computation, Vol.44, No.170, pp.519-521, Apr. 1985. [10] S.E. Eldridge, C.D. Walter, “Hardware Implementation of Montgomery’s Modular Multiplication Algorithm,” IEEE Transaction on Computers, Vol.42, No.6, pp.693-699, Jun. 1993. [11] C.D. Walter, “Systolic modular multiplication,” IEEE Transactions on Computers, Vol.42, No.3, pp.376-378, Mar. 1993. [12] A.A. Tiountchik, “Systolic nodular exponentiation via Montgomery algorithm,” Electronics Letters, 30th, Vol.34, No.9, pp.874-875, Apr. 1998. [13] Po-Song Chen, Shih-Arn Hwang, Cheng-Wen Wu, “A systolic RSA public key cryptosystem,” IEEE International Symposium on Circuits and Systems, ISCAS '96, Connecting the World, Vol.4, pp.408-411, 1996. [14] Ching-Chao Yang, Chein-Wei Jen, Tian-Sheuan Chang, “The IC design of a high speed RSA processor,” Proceedings of IEEE Asia Pacific Conference on Circuits and Systems ‘96, pp.33-36, 1996. [15] Ching-Chao Yang, Tian-Sheuan Chang, Chien-Wei Jen, “A new RSA cryptosystem hardware design based on Montgomery's algorithm,” IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, Vol.45, No.7, pp.908-913, Jul. 1998. [16] Neil H.E. Weste, Kamran Eshraghian, Principles Of CMOS VLSI DESIGN, A System Perspective, Second Edition, Addison-Wesley Publishing Company, pp.465-624, 1993. [17] von Volker Schindler, “High Speed RSA Hardware Based on Low-Power Pipelined Logic,” Doctor’s dissertation, Technische University at Graz, Austria, Jan. 1997. [18] N. Takagi, “A radix-4 modular multiplication hardware algorithm for modular exponentiation,” IEEE Transactions on Computers, Vol.41, No.8, pp.949-956, Aug. 1992. [19] C.D. Walter, “Space/Time Trade-offs for Higher Radix Modular Multiplication Using Repeated Addition,” IEEE Transactions on Computers, Vol.46, No.2, pp.139-141, Feb. 1997. [20] S.Y. Kung, VLSI ARRAY PROCESSORS, Prentice Hall, pp.197-268, 1988. [21] K. F. Lin, "Design and Implementation of an Encryption/Decryption Coprocessor", master thesis, 1998.
|