
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Miaoqing Huang, Kris Gaj, Tarek ElGhazawi, "New Hardware Architectures for Montgomery Modular Multiplication Algorithm," IEEE Transactions on Computers, vol. 60, no. 7, pp. 923936, July, 2011.  
BibTex  x  
@article{ 10.1109/TC.2010.247, author = {Miaoqing Huang and Kris Gaj and Tarek ElGhazawi}, title = {New Hardware Architectures for Montgomery Modular Multiplication Algorithm}, journal ={IEEE Transactions on Computers}, volume = {60}, number = {7}, issn = {00189340}, year = {2011}, pages = {923936}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2010.247}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  New Hardware Architectures for Montgomery Modular Multiplication Algorithm IS  7 SN  00189340 SP923 EP936 EPD  923936 A1  Miaoqing Huang, A1  Kris Gaj, A1  Tarek ElGhazawi, PY  2011 KW  Montgomery multiplication KW  MWR2MM algorithm KW  hardware optimization KW  fieldprogrammable gate arrays. VL  60 JA  IEEE Transactions on Computers ER   
[1] R.L. Rivest, A. Shamir, and L. Adleman, "A Method for Obtaining Digital Signatures and PublicKey Cryptosystems," Comm. ACM, vol. 21, no. 2, pp. 120126, 1978.
[2] P.L. Montgomery, "Modular Multiplication without Trial Division," Math. of Computation, vol. 44, no. 170, pp. 519521, Apr. 1985.
[3] K. Gaj et al., "Implementing the Elliptic Curve Method of Factoring in Reconfigurable Hardware," Proc. Cryptographic Hardware and Embedded Systems (CHES '06), pp. 119133, Oct. 2006.
[4] A.F. Tenca and Ç.K. Koç, "A Scalable Architecture for Montgomery Multiplication," Proc. First Int'l Workshop Cryptographic Hardware and Embedded Systems (CHES '99), pp. 94108, 1999.
[5] A.F. Tenca and Ç.K. Koç, "A Scalable Architecture for Modular Multiplication Based on Montgomery's Algorithm," IEEE Trans. Computers, vol. 52, no. 9, pp. 12151221, Sept. 2003.
[6] A.F. Tenca, G. Todorov, and Ç.K. Koç, "HighRadix Design of a Scalable Modular Multiplier," Proc. Third Int'l Workshop Cryptographic Hardware and Embedded Systems (CHES '01), pp. 185201, 2001.
[7] D. Harris, R. Krishnamurthy, M. Anders, S. Mathew, and S. Hsu, "An Improved Unified Scalable Radix2 Montgomery Multiplier," Proc. 17th IEEE Symp. Computer Arithmetic (ARITH), pp. 172178, June 2005.
[8] N. Jiang and D. Harris, "Parallelized Radix2 Scalable Montgomery Multiplier," Proc. IFIP Int'l Conf. Very Large Scale Integration (VLSISoC '07), pp. 146150, Oct. 2007.
[9] N. Pinckney and D.M. Harris, "Parallelized Radix4 Scalable Montgomery Multipliers," J. Integrated Circuits and Systems, vol. 3, no. 1, pp. 3945, Mar. 2008.
[10] K. Kelly and D. Harris, "Parallelized Very High Radix Scalable Montgomery Multipliers," Proc. 39th Asilomar Conf. Signals, Systems and Computers, pp. 11961200, Oct. 2005.
[11] E.A. Michalski and D.A. Buell, "A Scalable Architecture for RSA Cryptography on Large FPGAs," Proc. Int'l Conf. Field Programmable Logic and Applications, (FPL '06), pp. 145152, Aug. 2006.
[12] Ç.K. Koç, T. Acar, and B.S. KaliskiJr., "Analyzing and Comparing Montgomery Multiplication Algorithms," IEEE Micro, vol. 16, no. 3, pp. 2633, June 1996.
[13] C. McIvor, M. McLoone, and J.V. McCanny, "HighRadix Systolic Modular Multiplication on Reconfigurable Hardware," Proc. IEEE Int'l Conf. FieldProgrammable Technology (ICFPT '05), pp. 1318, Dec. 2005.
[14] C. McIvor, M. McLoone, and J.V. McCanny, "Modified Montgomery Modular Multiplication and RSA Exponentiation Techniques," IEE Proc.—Computers and Digital Techniques, vol. 151, no. 6, pp. 402408, Nov. 2004.
[15] L. Batina and G. Muurling, "Montgomery in Practice: How to Do It More Efficiently in Hardware," Proc. Cryptographer's Track at the RSA Conf. Topics in Cryptology (CTRSA '02), pp. 4052, Feb. 2002.
[16] C.D. Walter, "Precise Bounds for Montgomery Modular Multiplication and Some Potentially Insecure RSA Moduli," Proc. Cryptographer 's Track at the RSA Conf. Topics in Cryptology (CTRSA '02), pp. 3039, Feb. 2002.