
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Zhimin Chen, Patrick Schaumont, "A Parallel Implementation of Montgomery Multiplication on Multicore Systems: Algorithm, Analysis, and Prototype," IEEE Transactions on Computers, vol. 60, no. 12, pp. 16921703, December, 2011.  
BibTex  x  
@article{ 10.1109/TC.2010.256, author = {Zhimin Chen and Patrick Schaumont}, title = {A Parallel Implementation of Montgomery Multiplication on Multicore Systems: Algorithm, Analysis, and Prototype}, journal ={IEEE Transactions on Computers}, volume = {60}, number = {12}, issn = {00189340}, year = {2011}, pages = {16921703}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2010.256}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  A Parallel Implementation of Montgomery Multiplication on Multicore Systems: Algorithm, Analysis, and Prototype IS  12 SN  00189340 SP1692 EP1703 EPD  16921703 A1  Zhimin Chen, A1  Patrick Schaumont, PY  2011 KW  Montgomery multiplication KW  publickey cryptography KW  parallel programming KW  tiled processor. VL  60 JA  IEEE Transactions on Computers ER   
[1] D. Geer, “Chip Makers Turn to Multicore Processors,” Computer, vol. 38, no. 5, pp. 1113, 2005.
[2] IBM DeveloperWorks “Cell Broadband Engine Programming Handbook (Version 1.1),” http://www.ibm.com/ developerworks/ power/librarypacellperf/, 2005.
[3] ARM “ARM11 MPCore Processor Technical Reference Manual,” http://infocenter.arm.com/help/index.jsp?topic=/ com. arm. doc.ddi0360fin dex.html , 2011.
[4] Intel “Intel Xeon Processor 7400 Series Datasheet,” http://www.intel.com/Assets/en_US/PDF/datasheet 320335.pdf, 2011.
[5] AMD “SixCore AMD Opteron Processor Product Brief,” http://www.amd.com/us/products/server/processors/ sixcore opteron/Pages sixcoreopteronproductbrief.aspx, 2011.
[6] P.L. Montgomery, “Modular Multiplication without Trial Division,” Math. of Computation, vol. 44, no. 170, pp. 519521, 1985.
[7] Ç.K. Koç, T. Acar, and B.S. Kaliski,Jr., “Analyzing and Comparing Montgomery Multiplication Algorithms,” IEEE Micro, vol. 16, no. 3, pp. 2633, June 1996.
[8] N. Costigan and P. Schwabe, “Fast EllipticCurve Cryptography on the Cell Broadband Engine,” Proc. Int'l Conf. Cryptology in Africa: Progress in Cryptology (AFRICACRYPT '09), pp. 368385, 2009.
[9] R. Szerwinski and T. Güneysu, “Exploiting the Power of GPUs for Asymmetric Cryptography,” Proc. Workshop Cryptographic Hardware and Embedded System (CHES '08), pp. 7999, 2008.
[10] A. Moss, D. Page, and N.P. Smart, “Toward Acceleration of RSA Using 3D Graphics Hardware,” Proc. IMA Int'l Conf. Cryptography and Coding 2007, pp. 213220, 2007.
[11] S. Fleissner, “GPUAccelerated Montgomery Exponentiation,” Proc. Int'l Conf. Computational Science (ICCS '07), pp. 213220, 2007.
[12] N. Costigan and M. Scott, “Accelerating SSL Using the Vector Processors in IBM's Cell Broadband Engine for Sonys Playstation 3,” Proc. 2009 SPEED Workshop, http://www. hyperelliptic.orgSPEED, Nov. 2009.
[13] R. Rivest, A. Shamir, and L. Adleman, “A Method for Obtaining Digital Signatures and Public Key Cryptosystems,” Comm. ACM, vol. 21, pp. 120126, 1978.
[14] National Institute of Standards and Technology (NIST), “Digital Signature Standard (FIPS 1862),” 2000.
[15] N. Koblitz, “Elliptic Curve Cryptosystems,” Math. of Computation, vol. 48, no. 177, pp. 203209, 1987.
[16] J.C. Bajard, L.S. Didier, and P. Kornerup, “An RNS Montgomery Modular Multiplication Algorithm,” IEEE Trans. Computers, vol. 47, no. 7, pp. 766776, July 1998.
[17] M.E. Kaihara and N. Takagi, “Bipartite Modular Multiplication,” Proc. Workshop Cryptographic Hardware and Embedded System (CHES '05), pp. 201210, 2005.
[18] M.E. Kaihara and N. Takagi, “Bipartite Modular Multiplication Method,” IEEE Trans. Computers, vol. 57, no. 2, pp. 157164, Feb. 2008.
[19] K. Sakiyama, M. Knezevic, J. Fan, B. Preneel, and I. Verbauwhede, “Tripartite Modular Multiplication,” technical report, COSIC Internal Report, 2009.
[20] K. Sakiyama, L. Batina, B. Preneel, and I. Verbauwhede, “Multicore CurveBased Cryptoprocessor with Reconfigurable Modular Arithmetic Logic Units over GF($2^n$ ),” IEEE Trans. Computers, vol. 56, no. 9, pp. 12691282, Sept. 2007.
[21] J. Fan, K. Sakiyama, and I. Verbauwhede, “Elliptic Curve Cryptography on Embedded Multicore Systems,” Design Automation for Embedded Systems, vol. 12, no. 3, pp. 231242, 2008.
[22] J. Fan, K. Sakiyama, and I. Verbauwhede, “Montgomery Modular Multiplication Algorithm for MultiCore Systems,” Proc. IEEE Workshop Signal Processing Systems, pp. 261266, 2007.
[23] B. Baldwin, W.P. Maranane, and R. Granger, “Reconfigurable Hardware Implementation of Arithmetic Modulo Minimal Redundancy Cyclotomic Primes for ECC,” Proc. Int'l Conf. Reconfigurable Computing and FPGAs, pp. 255260, 2009.
[24] Multicore Processors and Systems (Integrated Circuits and Systems), S. Keckler, K. Olukotun, and P.H. Hofstee, eds. Springer, 2009.
[25] K. Sankaralingam, R. Nagarajan, R. Desikan, S. Drolia, M.S. Govindan, P. Gratz, D. Gulati, H. Hanson, C. Kim, H. Liu, N. Ranganathan, S. Sethumadhavan, S. Sharif, P. Shivakumar, S.W. Keckler, and D. Burger, “Distrubuted Microarchitectural Protocols in the Trips Prototype Processor,” Proc. 39th Ann. Int'l Symp. Microarchitecture, pp. 480491, 2006.
[26] M. Baron, “LowKey Intel 80Core Intro: The Tip of the Iceberg,” microprocessor report, 2007.
[27] D. Wentzlaff, P. Griffin, H. Hoffmann, L. Bao, B. Edwards, C. Ramey, M.M.C.C. Miao, J.F. Brown, and A. Agarwal, “OnChip Interconnection Architecture of the Tile Processor,” IEEE Micro, vol. 27, no. 5, pp. 1531, Sept./Oct. 2007.
[28] M.B. Taylor, J. Kim, J. Miller, D. Wentzlaff, F. Ghodrat, B. Greenwald, H. Hoffmann, P. Johnson, J.W. Lee, W. Lee, A. Ma, A. Saraf, M. Seneski, N. Shnidman, V. Strumpen, M. Frank, S. Amarasinghe, and A. Agarwal, “The Raw Microprocessor: A Computational Fabric for Software Circuits and General Purpose Programs,” IEEE Micro, vol. 22, no. 2, pp. 2535, Mar./Apr. 2002.
[29] Z. Chen and P. Schaumont, “pSHS: A Scalable Parallel Software Implementation of Montgomery Multiplication for Multicore Systems,” Proc. Design, Automation and Test in Europe (DATE '10), pp. 843848, 2010.
[30] C.D. Walter, “Montgomery Exponentiation Needs No Final Subtractions,” Electronics Letters, vol. 35, no. 21, pp. 18311832, 1999.
[31] A. Karatsuba and Y. Ofman, “Multiplication of ManyDigital Numbers by Automatic Computers,” Proc. USSR Academy of Sciences, vol. 145, pp. 293294, 1962.
[32] Intel “Intel SingleChip Cloud Computers,” http://techresearch. intel.com/articles/ TeraScale1826.htm, 2011.
[33] N. Gura, A. Patel, A. Wander, H. Eberle, and S.C. Shantz, “Comparing Elliptic Curve Cryptography and RSA on 8Bit CPUs,” Proc. Cryptographic Hardware and Embedded Systems (CHES '04), pp. 119132, 2004.
[34] M. Koschuch, J. Lechner, A. Weitzer, J. Großschädl, A. Szekely, S. Tillich, and J. Wolkerstorfer, “Hardware/Software CoDesign of Elliptic Curve Cryptography on an 8051 Microcontroller,” Proc. Cryptographic Hardware and Embedded Systems (CHES '06), pp. 430444, 2006.