{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T04:11:48Z","timestamp":1748751108426,"version":"3.41.0"},"reference-count":34,"publisher":"EDP Sciences","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[2015,7]]},"DOI":"10.1051\/ita\/2015007","type":"journal-article","created":{"date-parts":[[2015,11,27]],"date-time":"2015-11-27T08:48:37Z","timestamp":1448614117000},"page":"255-268","source":"Crossref","is-referenced-by-count":2,"title":["Algorithm design and theoretical analysis of a novel CMM modular exponentiation algorithm for large integers"],"prefix":"10.1051","volume":"49","author":[{"given":"Abdalhossein","family":"Rezai","sequence":"first","affiliation":[]},{"given":"Parviz","family":"Keshavarzi","sequence":"additional","affiliation":[]}],"member":"250","published-online":{"date-parts":[[2015,11,27]]},"reference":[{"key":"R1","unstructured":"Arno S. and Wheeler F.S., Signed digit representations of minimal Hamming weight.IEEE Trans. Comput.42(1993) 1007\u20131010."},{"key":"R2","unstructured":"Blum T. and Paar C., High-radix Montgomery multiplication on reconfigurable hardware.IEEE Trans. Comput.50(2001) 759\u2013764."},{"key":"R3","doi-asserted-by":"crossref","unstructured":"Booth A., A signed binary multiplication technique.J. Mech. Appl. Math.4(1951) 236\u2013240.","DOI":"10.1093\/qjmam\/4.2.236"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"S.R. Dusse and B.S Kaliski, A cryptographic library for the Motorola DSP 56000.Proc. of Adv. Cryptol. EUROCRYPT\u201990. In vol. 73 ofLect. Notes Comput. Sci.(1990) 230\u2013244.","DOI":"10.1007\/3-540-46877-3_21"},{"key":"R5","unstructured":"Egecioglu O. and Koc C.K., Exponentiation using Canonical Recoding.Theoret. Comput. Sci.129(1994) 407\u2013417."},{"key":"R6","doi-asserted-by":"crossref","unstructured":"Y. Fan, T. Ikenaga and S. Goto, A high-speed design of Montgomery multiplier.IEICE Trans. Fundam. Electron., Commun. ComputersE91-A(2008) 971\u2013977.","DOI":"10.1093\/ietfec\/e91-a.4.971"},{"key":"R7","doi-asserted-by":"crossref","unstructured":"A.P. Fournaris and O. Koufopavlou, A new RSA encryption architecture and hardware implementation based on optimized Montgomery multiplication. InProc. of IEEE ISCAS(2005) 4645\u20134648.","DOI":"10.1109\/ISCAS.2005.1465668"},{"key":"R8","unstructured":"Ha J.C. and Moon S.J., A common-multiplicand method to the Montgomery algorithm for speeding up exponentiation.Inf. Process. Lett.66(1998) 105\u2013107."},{"key":"R9","unstructured":"Ibrahim A., Elsimary H. and Gebali F., Low-power, high-speed unified and scalable word-based radix-8 architecture for Montgomery modular multiplication.Arab J. Sci. Eng.39(2014) 7847\u20137863."},{"key":"R10","unstructured":"P. Keshavarzi and C. Harrison, A New Modular Multiplication Algorithm for VLSI Implementation of Public-Key Cryptography. InProc. of 1st Int. Symp. Commun. Syst. Digit. signal Process. CSDSP98, Sheffield, UK(1998) 516\u2013519."},{"key":"R11","unstructured":"Lee D.C. and Wu C.L., Parallel exponentiation using common-multiplicand-multiplication and signed-digit-folding techniques.Int. J. Comput. Math.81(2004) 1187\u20131202."},{"key":"R12","unstructured":"Montgomery P.L., Modular multiplication without trial division.Math. Comput.44(1985) 519\u2013521."},{"key":"R13","doi-asserted-by":"crossref","unstructured":"Nedjah N. and Mourelle L.M., High-performance hardware of the sliding-window method for parallel computation of modular exponentiations.Int. J. Parallel program.37(2009) 537\u2013555.","DOI":"10.1007\/s10766-009-0108-7"},{"key":"R14","doi-asserted-by":"crossref","unstructured":"Nedjah N. and Mourelle L.M., A hardware\/software co-design versus hardware-only implementation of modular exponentiation using the sliding-window method.J. Circuits Syst. Comput.18(2009) 295\u2013310.","DOI":"10.1142\/S0218126609005071"},{"key":"R15","unstructured":"Neto J.C., Tenca A.F. and Ruggiero W.V., A parallel and uniformly k-partition method for Montgomery multiplication.IEEE Trans. Comput.63(2014) 2122\u20132133."},{"key":"R16","doi-asserted-by":"crossref","unstructured":"A. Rezai and P. Keshavarzi, High-Performance Implementation Approach of Elliptic Curve Cryptosystem for Wireless Network Applications. InProc. of IEEE. Int. Conf. Consum. Electron. Commun. Netw.(CECNet 2011). Xianning, China (2011) 1323\u20131327.","DOI":"10.1109\/CECNET.2011.5768248"},{"key":"R17","doi-asserted-by":"crossref","unstructured":"A. Rezai and P. Keshavarzi, High-performance modular exponentiation algorithm by using a new modified modular multiplication algorithm and common-multiplicand-multiplication method. InProc. of IEEE. World Congr. Internet Secur. London, UK(2011) 192\u2013197.","DOI":"10.1109\/WorldCIS17046.2011.5749849"},{"key":"R18","unstructured":"Rezai A. and Keshavarzi P., CCS Representation: A new non-adjacent form and its application in ECC.J. Basic. Appl. Sci. Res.2(2012) 4577\u20134586."},{"key":"R19","unstructured":"Rezai A. and Keshavarzi P., A new finite field multiplication algorithm to improve elliptic curve cryptosystem implementations.J. Inf. Syst. Telecom.1(2013) 119\u2013129."},{"key":"R20","unstructured":"Rezai A. and Keshavarzi P., High-throughput modular multiplication and exponentiation algorithms using multibit-scan-multibit-shift technique.IEEE Trans. Very Large Scale Integr. Syst.23(2015) 1710\u20131719."},{"key":"R21","unstructured":"Reitwiesner G.W., Binary arithmetic.Adv. Comput.1(1960) 231\u2013308."},{"key":"R22","unstructured":"Sutter G.D., Deschamps J.P. and Imana J.L., Modular multiplication and exponentiation architectures for fast RSA cryptosystem based on digit serial computation.IEEE Trans. Indust. Electron.58(2011) 3101\u20133109."},{"key":"R23","doi-asserted-by":"crossref","unstructured":"San I. and At N., Improving the computational efficiency of modular operations for embedded systems.J. Syst. Arch.60(2014) 440\u2013451.","DOI":"10.1016\/j.sysarc.2013.10.013"},{"key":"R24","unstructured":"Tunstall M. and Joye M., The distributions of individual bits in the output of multiplicative operations.Crypto. Commun.7(2015) 71\u201390."},{"key":"R25","unstructured":"Tawalbeh L.A., Tenca A.F. and Koc C.K., A radix-4 scalable design.IEEE Potentials.24(2005) 16\u201318."},{"key":"R26","doi-asserted-by":"crossref","unstructured":"A.F. Tenca and L. Tawalbeh, An Efficient and Scalable Radix-4 Modular Multiplier Design using Recoding Techniques. InProc. of IEEE. Asilomar Conf. signals, syst., comput., Monterey, CA(2003) 1445\u20131450.","DOI":"10.1109\/ACSSC.2003.1292225"},{"key":"R27","unstructured":"Pinckney N. and Harris D., Parallelized radix-4 scalable Montgomery multipliers.J. Integr. Sysyt.3(2008) 39\u201345."},{"key":"R28","doi-asserted-by":"crossref","unstructured":"Walter C.D., Systolic modular multiplication.IEEE Trans. Comput.42(1993) 376\u2013378.","DOI":"10.1109\/12.210181"},{"key":"R29","unstructured":"Wu T., Li S. and Liu L., Fast, compact and symmetric modular exponentiation architecture by common-multiplicand Montgomery modular multiplication.Integr. VLSI J.36(2013) 323\u2013332."},{"key":"R30","doi-asserted-by":"crossref","unstructured":"C.L. Wu, D.C. Lou and T.J. Chang, An Efficient Montgomery Exponentiation Algorithm for Public-key Cryptosystem. InProc. of IEEE. Int. Conf. Intell. Security Inform., Taipei, Taiwan(2008) 284\u2013285.","DOI":"10.1109\/ISI.2008.4565086"},{"key":"R31","unstructured":"Wu C.L., An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation.Inform. Sci.179(2009) 410-421."},{"key":"R32","unstructured":"Wu C.L., Lou D.C. and Chang T.J., Fast modular multiplication based on complement representation and canonical recoding.Int. J. comput. Math.87(2010) 2871\u20132879."},{"key":"R33","doi-asserted-by":"crossref","unstructured":"Xie J.J., He J. and Meher P.K., Low latency systolic Montgomery multiplier for finite field GF(2m) based on pentanomials.IEEE Trans. Very Large Scale Integr. (VLSI) Syst.21(2013) 385\u2013389.","DOI":"10.1109\/TVLSI.2012.2185257"},{"key":"R34","doi-asserted-by":"crossref","unstructured":"Yoshino M., Okeya K. and Vuillaume C., Bipartite modular multiplication with twice the bit-length of multipliers.Int. J. Inform. Security8(2009) 13\u201323.","DOI":"10.1007\/s10207-008-0060-3"}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/2015007\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T15:37:38Z","timestamp":1748705858000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/2015007"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7]]},"references-count":34,"journal-issue":{"issue":"3"},"alternative-id":["ita150021"],"URL":"https:\/\/doi.org\/10.1051\/ita\/2015007","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"type":"print","value":"0988-3754"},{"type":"electronic","value":"1290-385X"}],"subject":[],"published":{"date-parts":[[2015,7]]}}}