{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T08:10:10Z","timestamp":1751703010681,"version":"3.41.0"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319944715"},{"type":"electronic","value":"9783319944722"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-94472-2_3","type":"book-chapter","created":{"date-parts":[[2018,6,22]],"date-time":"2018-06-22T08:03:52Z","timestamp":1529654632000},"page":"33-47","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["RSA Cryptosystem Based on Early Word Based Montgomery Modular Multiplication"],"prefix":"10.1007","author":[{"given":"Rupali","family":"Verma","sequence":"first","affiliation":[]},{"given":"Maitreyee","family":"Dutta","sequence":"additional","affiliation":[]},{"given":"Renu","family":"Vig","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,6,23]]},"reference":[{"issue":"2","key":"3_CR1","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"RL Rivest","year":"1978","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120\u2013126 (1978)","journal-title":"Commun. ACM"},{"key":"3_CR2","unstructured":"Koc, C.K.: High-Speed RSA Implementation, RSA Labs, Redwood City, CA, Technical report (1994)"},{"issue":"170","key":"3_CR3","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1090\/S0025-5718-1985-0777282-X","volume":"44","author":"PL Montgomery","year":"1985","unstructured":"Montgomery, P.L.: Modular multiplication without trial division. Math. Comput. 44(170), 519\u2013521 (1985)","journal-title":"Math. Comput."},{"issue":"9","key":"3_CR4","doi-asserted-by":"publisher","first-page":"1215","DOI":"10.1109\/TC.2003.1228516","volume":"52","author":"AF Tenca","year":"2003","unstructured":"Tenca, A.F., Koc, C.K.: A Scalable architecture for modular multiplication based on montgomery\u2019s algorithm. IEEE Trans. Comput. 52(9), 1215\u20131221 (2003)","journal-title":"IEEE Trans. Comput."},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Harris, D., Krishnamurthy, R., Anders, M., Mathew, S., Hsu, S.: An improved unified scalable radix 2 Montgomery multiplier. In: Proceedings of the 17th IEEE Symposium on Computer Arithmetic (ARITH), pp. 172\u2013178 (2005)","DOI":"10.1109\/ARITH.2005.9"},{"issue":"8","key":"3_CR6","doi-asserted-by":"publisher","first-page":"1145","DOI":"10.1109\/TC.2010.72","volume":"59","author":"MD Shieh","year":"2010","unstructured":"Shieh, M.D., Lin, W.C.: Word based Montgomery modular multiplication algorithm for low latency scalable architectures. IEEE Trans. Comput. 59(8), 1145\u20131151 (2010)","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"3_CR7","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1109\/TC.2012.218","volume":"63","author":"WC Lin","year":"2014","unstructured":"Lin, W.C., Ye, J.H., Shieh, M.D.: Scalable Montgomery modular multiplication architecture with low-latency and low-memory bandwidth requirement. IEEE Trans. Comput. 63(2), 475\u2013483 (2014)","journal-title":"IEEE Trans. Comput."},{"issue":"7","key":"3_CR8","doi-asserted-by":"publisher","first-page":"923","DOI":"10.1109\/TC.2010.247","volume":"60","author":"M Huang","year":"2011","unstructured":"Huang, M., Gaj, K., Ghazawi, T.E.: New hardware architectures for Montgomery modular multiplication algorithm. IEEE Trans. Comput. 60(7), 923\u2013936 (2011)","journal-title":"IEEE Trans. Comput."},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Chen, D.S., Li, H.T., Wang, Y.W.: A prediction-based scalable design for Montgomery modular multiplication. In: Proceedings of 3rd International Conference on Electric and Electronics, pp. 46\u201350 (2013)","DOI":"10.2991\/eeic-13.2013.11"},{"issue":"6","key":"3_CR10","first-page":"402","volume":"151","author":"C McIvor","year":"2004","unstructured":"McIvor, C., McLoone, M., McCanny, J.V.: Modified Montgomery modular multiplication and RSA exponentiation techniques. IEE Proc. Comput. Digit. Techniques 151(6), 402\u2013408 (2004)","journal-title":"Techniques"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Verma, R., Dutta, M., Vig, R.: Early-word-based Montgomery modular multiplication algorithm. In: Proceedings of IEEE 2nd International conference on SPIN, pp. 595\u2013600 (2015)","DOI":"10.1109\/SPIN.2015.7095268"},{"issue":"7","key":"3_CR12","doi-asserted-by":"publisher","first-page":"3101","DOI":"10.1109\/TIE.2010.2080653","volume":"58","author":"GD Sutter","year":"2011","unstructured":"Sutter, G.D., Deschamps, J.-P., Imana, J.L.: Modular multiplication and exponentiation architectures for fast RSA cryptosystem based on digit serial computation. IEEE Trans. Ind. Electron. 58(7), 3101\u20133109 (2011)","journal-title":"IEEE Trans. Ind. Electron."},{"issue":"9","key":"3_CR13","doi-asserted-by":"publisher","first-page":"1151","DOI":"10.1109\/TVLSI.2008.2000524","volume":"16","author":"MD Shieh","year":"2008","unstructured":"Shieh, M.D., Chen, J.H., Wu, H.H., Lin, W.C.: A new modular exponentiation architecture for efficient design of RSA cryptosystem. IEEE Trans. VLSI Syst. 16(9), 1151\u20131161 (2008)","journal-title":"IEEE Trans. VLSI Syst."},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/3-540-36400-5_22","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2002","author":"M Joye","year":"2003","unstructured":"Joye, M., Yen, S-M.: The Montgomery powering ladder. In: Kaliski, B.S., Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 2002. LNCS, vol. 2523, pp. 291\u2013302. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36400-5_22"},{"key":"3_CR15","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/j.vlsi.2012.09.002","volume":"46","author":"T Wu","year":"2013","unstructured":"Wu, T., Li, S., Liu, L.: Fast, compact and symmetric modular exponentiation architecture by common multiplicand Montgomery modular multiplication. Integr. VLSI J. 46, 323\u2013332 (2013)","journal-title":"Integr. VLSI J."},{"issue":"5","key":"3_CR16","doi-asserted-by":"publisher","first-page":"851","DOI":"10.3844\/ajassp.2014.851.856","volume":"11","author":"R Verma","year":"2014","unstructured":"Verma, R., Dutta, M., Vig, R.: Carry save common multiplicand Montgomery for RSA cryptosystem. Am. J. Appl. Sci. 11(5), 851\u2013856 (2014)","journal-title":"Am. J. Appl. Sci."},{"issue":"21","key":"3_CR17","doi-asserted-by":"publisher","first-page":"1831","DOI":"10.1049\/el:19991230","volume":"32","author":"CD Walter","year":"1999","unstructured":"Walter, C.D.: Montgomery exponentiation needs no final subtractions. Electron. Lett. 32(21), 1831\u20131832 (1999)","journal-title":"Electron. Lett."},{"issue":"6","key":"3_CR18","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1109\/12.277287","volume":"42","author":"SE Elridge","year":"1993","unstructured":"Elridge, S.E., Walter, C.D.: Hardware implementation of Montgomery\u2019s modular multiplication algorithm. IEEE Trans. Comput. 42(6), 693\u2013699 (1993)","journal-title":"IEEE Trans. Comput."},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Mesquita, D., Perin, G., Herrmann, F.L., Martins, J.B.: An efficient implementation of montgomery powering ladder in reconfigurable hardware. In: Proceedings of 23rd Annual Symposium on Integrated Circuits and Systems Design SBCCI, pp. 121\u2013126 (2010)","DOI":"10.1145\/1854153.1854184"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Perin, G., Mesquita, D.G., Herrmann, F.L., Martins, J.B.: Montgomery modular multiplication on reconfigurable hardware: fully systolic array vs parallel implementation. In: Proceedings of IEEE VI Southern Programmable Logic Conference, pp. 61\u201366 (2010)","DOI":"10.1109\/SPL.2010.5483003"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Wang, P., Liu, Z., Wang, L., Gao, N.: High radix montgomery modular multiplier on modern FPGA. In: Proceedings of 12th IEEE International Conference on Trust, Security and Privacy in Computing and Communication, pp. 1484\u20131489 (2013)","DOI":"10.1109\/TrustCom.2013.180"},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Fournaris, A.P.: Fault and simple power attack resistant RSA using Montgomery modular multiplication. In: Proceedings of 2010 IEEE International Symposium on Circuits and Systems, pp. 1875\u20131878 (2010)","DOI":"10.1109\/ISCAS.2010.5537879"}],"container-title":["Lecture Notes in Computer Science","Services \u2013 SERVICES 2018"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-94472-2_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T07:48:25Z","timestamp":1751701705000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-94472-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319944715","9783319944722"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-94472-2_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"23 June 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SERVICES","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"World Congress on Services","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Seattle, WA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"services2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.servicescongress.org\/2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"www.confhub.com","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"22","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"45% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}