{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:52:14Z","timestamp":1740099134065,"version":"3.37.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319935621"},{"type":"electronic","value":"9783319935638"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-93563-8_22","type":"book-chapter","created":{"date-parts":[[2018,6,22]],"date-time":"2018-06-22T07:30:02Z","timestamp":1529652602000},"page":"261-273","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Software Implementation of Modular Multiplication in Prime Fields on TI\u2019s DSP TMS320C6678"],"prefix":"10.1007","author":[{"given":"Eito","family":"Miyamoto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takeshi","family":"Sugawara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazuo","family":"Sakiyama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,23]]},"reference":[{"key":"22_CR1","unstructured":"Costello, C.: Pairings for beginners. \nhttp:\/\/www.craigcostello.com.au\/pairings\/PairingsForBeginners.pdf"},{"key":"22_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-3-540-28632-5_9","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2004","author":"N Gura","year":"2004","unstructured":"Gura, N., Patel, A., Wander, A., Eberle, H., Shantz, S.C.: Comparing elliptic curve cryptography and RSA on 8-bit CPUs. In: Joye, M., Quisquater, J.-J. (eds.) CHES 2004. LNCS, vol. 3156, pp. 119\u2013132. Springer, Heidelberg (2004). \nhttps:\/\/doi.org\/10.1007\/978-3-540-28632-5_9"},{"key":"22_CR3","unstructured":"Kargl, A., Pyka, S., Seuschek, H.: Fast arithmetic on ATmega128 for elliptic curve cryptography. Cryptology ePrint Archive, Report 2008\/442 (2008). \nhttp:\/\/eprint.iacr.org\/2008\/442"},{"key":"22_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-540-85053-3_6","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2008","author":"R Szerwinski","year":"2008","unstructured":"Szerwinski, R., G\u00fcneysu, T.: Exploiting the power of GPUs for asymmetric cryptography. In: Oswald, E., Rohatgi, P. (eds.) CHES 2008. LNCS, vol. 5154, pp. 79\u201399. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-85053-3_6"},{"issue":"1","key":"22_CR5","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s13389-012-0029-z","volume":"2","author":"CPL Gouv\u00eaa","year":"2012","unstructured":"Gouv\u00eaa, C.P.L., Oliveira, L.B., L\u00f3pez, J.: Efficient software implementation of public-key cryptography on sensor networks using the MSP430x microcontroller. J. Cryptograph. Eng. 2(1), 19\u201329 (2012)","journal-title":"J. Cryptograph. Eng."},{"key":"22_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/3-540-48059-5_7","volume-title":"Cryptographic Hardware and Embedded Systems","author":"K Itoh","year":"1999","unstructured":"Itoh, K., Takenaka, M., Torii, N., Temma, S., Kurihara, Y.: Fast implementation of public-key cryptography on a DSP TMS320C6201. In: Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 1999. LNCS, vol. 1717, pp. 61\u201372. Springer, Heidelberg (1999). \nhttps:\/\/doi.org\/10.1007\/3-540-48059-5_7"},{"key":"22_CR7","unstructured":"Texas Instruments: C66x CPU and instruction set reference guide. \nhttp:\/\/www.ti.com\/lit\/ug\/sprugh7\/sprugh7.pdf"},{"key":"22_CR8","unstructured":"Texas Instruments: AM572x Sitara processors. \nhttp:\/\/www.tij.co.jp\/jp\/lit\/ds\/symlink\/am5728.pdf"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Kornerup, P.: High-radix modular multiplication for cryptosystems. In: Proceedings of the 11th Symposium on Computer Arithmetic 1993, pp. 277\u2013283. IEEE (1993)","DOI":"10.1109\/ARITH.1993.378082"},{"key":"22_CR10","unstructured":"Texas Instruments: C66x DSP cache user\u2019s guide. \nhttp:\/\/www.ti.com\/lit\/ug\/sprugy8\/sprugy8.pdf"},{"issue":"170","key":"22_CR11","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."},{"key":"22_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/11545262_15","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2005","author":"ME Kaihara","year":"2005","unstructured":"Kaihara, M.E., Takagi, N.: Bipartite modular multiplication. In: Rao, J.R., Sunar, B. (eds.) CHES 2005. LNCS, vol. 3659, pp. 201\u2013210. Springer, Heidelberg (2005). \nhttps:\/\/doi.org\/10.1007\/11545262_15"},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"Mentens, N., Sakiyama, K., Preneel, B., Verbauwhede, I.: Efficient pipelining for modular multiplication architectures in prime fields. In: Proceedings of the 17th ACM Great Lakes symposium on VLSI, pp. 534\u2013539. ACM (2007)","DOI":"10.1145\/1228784.1228911"},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"Fan, J., Sakiyama, K., Verbauwhede, I.: Montgomery modular multiplication algorithm on multi-core systems. In: 2007 IEEE Workshop on Signal Processing Systems, pp. 261\u2013266. IEEE (2007)","DOI":"10.1109\/SIPS.2007.4387555"},{"key":"22_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-642-13797-6_12","volume-title":"Arithmetic of Finite Fields","author":"M Kne\u017eevi\u0107","year":"2010","unstructured":"Kne\u017eevi\u0107, M., Vercauteren, F., Verbauwhede, I.: Speeding up bipartite modular multiplication. In: Hasan, M.A., Helleseth, T. (eds.) WAIFI 2010. LNCS, vol. 6087, pp. 166\u2013179. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-13797-6_12"},{"issue":"3","key":"22_CR16","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1109\/40.502403","volume":"16","author":"\u00c7K Ko\u00e7","year":"1996","unstructured":"Ko\u00e7, \u00c7.K., Acar, T., Kaliski, B.S.: Analyzing and comparing Montgomery multiplication algorithms. IEEE Micro 16(3), 26\u201333 (1996)","journal-title":"IEEE Micro"},{"key":"22_CR17","unstructured":"Recommended elliptic curves for federal government use. \nhttp:\/\/csrc.nist.gov\/groups\/ST\/toolkit\/documents\/dss\/NISTReCur.pdf"},{"issue":"9","key":"22_CR18","doi-asserted-by":"publisher","first-page":"1215","DOI":"10.1109\/TC.2003.1228516","volume":"52","author":"AF Tenca","year":"2003","unstructured":"Tenca, A.F., Ko\u00e7, \u00c7.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":"22_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/3-540-45353-9_19","volume-title":"Topics in Cryptology \u2014 CT-RSA 2001","author":"M Brown","year":"2001","unstructured":"Brown, M., Hankerson, D., L\u00f3pez, J., Menezes, A.: Software implementation of the NIST elliptic curves over prime fields. In: Naccache, D. (ed.) CT-RSA 2001. LNCS, vol. 2020, pp. 250\u2013265. Springer, Heidelberg (2001). \nhttps:\/\/doi.org\/10.1007\/3-540-45353-9_19"}],"container-title":["Lecture Notes in Computer Science","Information Security Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-93563-8_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,6,22]],"date-time":"2018-06-22T07:43:03Z","timestamp":1529653383000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-93563-8_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319935621","9783319935638"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-93563-8_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}