{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T18:33:19Z","timestamp":1767983599770,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662434130","type":"print"},{"value":"9783662434147","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43414-7_24","type":"book-chapter","created":{"date-parts":[[2014,5,20]],"date-time":"2014-05-20T10:57:06Z","timestamp":1400583426000},"page":"471-489","source":"Crossref","is-referenced-by-count":20,"title":["Montgomery Multiplication Using Vector Instructions"],"prefix":"10.1007","author":[{"given":"Joppe W.","family":"Bos","sequence":"first","affiliation":[]},{"given":"Peter L.","family":"Montgomery","sequence":"additional","affiliation":[]},{"given":"Daniel","family":"Shumow","sequence":"additional","affiliation":[]},{"given":"Gregory M.","family":"Zaverucha","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,5,21]]},"reference":[{"key":"24_CR1","unstructured":"ARM. Cortex-A9. Technical Reference Manual (2010). Version r2p2"},{"key":"24_CR2","unstructured":"ARM. Cortex-A9 NEON Media Processing Engine. Technical Reference Manual (2012). Version r4p1"},{"key":"24_CR3","unstructured":"ARM Limited. ARM Architechture Reference Manual ARMv7-A and ARMv7-R edition (2010)"},{"issue":"7","key":"24_CR4","doi-asserted-by":"publisher","first-page":"766","DOI":"10.1109\/12.709376","volume":"47","author":"J-C Bajard","year":"1998","unstructured":"Bajard, J.-C., Didier, L.-S., Kornerup, P.: An RNS Montgomery modular multiplication algorithm. IEEE Trans. Comput. 47(7), 766\u2013776 (1998)","journal-title":"IEEE Trans. Comput."},{"key":"24_CR5","unstructured":"Bernstein, D.J., Lange, T. (eds).: eBACS: ECRYPT Benchmarking of Cryptographic Systems. \n                      http:\/\/bench.cr.yp.to\n                      \n                    . Accessed 2 July 2013"},{"key":"24_CR6","series-title":"LNCS","first-page":"320","volume-title":"CHES 2012","author":"DJ Bernstein","year":"2012","unstructured":"Bernstein, D.J., Schwabe, P.: NEON crypto. In: Prouff, E., Schaumont, P. (eds.) CHES 2012. LNCS, vol. 7428, pp. 320\u2013339. Springer, Heidelberg (2012)"},{"key":"24_CR7","series-title":"LNCS","first-page":"7","volume-title":"WAIFI 2010","author":"JW Bos","year":"2010","unstructured":"Bos, J.W.: High-performance modular multiplication on the cell processor. In: Hasan, M.A., Helleseth, T. (eds.) WAIFI 2010. LNCS, vol. 6087, pp. 7\u201324. Springer, Heidelberg (2010)"},{"key":"24_CR8","series-title":"LNCS","first-page":"477","volume-title":"PPAM 2009, Part I","author":"JW Bos","year":"2010","unstructured":"Bos, J.W., Kaihara, M.E.: Montgomery multiplication on the cell. In: Wyrzykowski, R., Dongarra, J., Karczewski, K., Wasniewski, J. (eds.) PPAM 2009, Part I. LNCS, vol. 6067, pp. 477\u2013485. Springer, Heidelberg (2010)"},{"issue":"4","key":"24_CR9","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1147\/sj.294.0526","volume":"29","author":"PG Comba","year":"1990","unstructured":"Comba, P.G.: Exponentiation cryptosystems on the IBM PC. IBM Syst. J. 29(4), 526\u2013538 (1990)","journal-title":"IBM Syst. J."},{"key":"24_CR10","series-title":"LNCS","first-page":"183","volume-title":"EUROCRYPT 1992","author":"B Dixon","year":"1993","unstructured":"Dixon, B., Lenstra, A.K.: Massively parallel elliptic curve factoring. In: Rueppel, R.A. (ed.) EUROCRYPT 1992. LNCS, vol. 658, pp. 183\u2013193. Springer, Heidelberg (1993)"},{"key":"24_CR11","series-title":"LNCS","first-page":"10","volume-title":"CRYPTO 1984","author":"T ElGamal","year":"1985","unstructured":"ElGamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. In: Blakley, G., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 10\u201318. Springer, Heidelberg (1985)"},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"Faz-Hernandez, A., Longa, P., Sanchez, A.H.: Efficient and secure algorithms for GLV-based scalar multiplication and their implementation on GLV-GLS curves. Cryptology ePrint Archive, Report 2013\/158 (2013). \n                      http:\/\/eprint.iacr.org\/\n                      \n                    . CT\\_RSA. doi:10.1007\/978-3-319-04852-9_1","DOI":"10.1007\/978-3-319-04852-9_1"},{"key":"24_CR13","unstructured":"Free Software Foundation, Inc. GMP: The GNU Multiple Precision Arithmetic Library (2013). \n                      http:\/\/www.gmplib.org\/"},{"key":"24_CR14","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1109\/TEC.1959.5219515","volume":"8","author":"HL Garner","year":"1959","unstructured":"Garner, H.L.: The residue number system. IRE Trans. Electron. Comput. 8, 140\u2013147 (1959)","journal-title":"IRE Trans. Electron. Comput."},{"key":"24_CR15","series-title":"LNCS","first-page":"35","volume-title":"SAC 2008","author":"P Grabher","year":"2009","unstructured":"Grabher, P., Gro\u00dfsch\u00e4dl, J., Page, D.: On software parallel implementation of cryptographic pairings. In: Avanzi, R.M., Keliher, L., Sica, F. (eds.) SAC 2008. LNCS, vol. 5381, pp. 35\u201350. Springer, Heidelberg (2009)"},{"issue":"2","key":"24_CR16","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1177\/1094342003017002004","volume":"17","author":"J Gro\u00dfsch\u00e4dl","year":"2003","unstructured":"Gro\u00dfsch\u00e4dl, J.: Architectural support for long integer modulo arithmetic on RISC-based smart cards. Int. J. High Perform. Comput. Appl. - IJHPCA 17(2), 135\u2013146 (2003)","journal-title":"Int. J. High Perform. Comput. Appl. - IJHPCA"},{"key":"24_CR17","series-title":"LNCS","first-page":"75","volume-title":"CHES 2005","author":"J Gro\u00dfsch\u00e4dl","year":"2005","unstructured":"Gro\u00dfsch\u00e4dl, J., Avanzi, R.M., Sava\u015f, E., Tillich, S.: Energy-efficient software implementation of long integer modular arithmetic. In: Rao, J.R., Sunar, B. (eds.) CHES 2005. LNCS, vol. 3659, pp. 75\u201390. Springer, Heidelberg (2005)"},{"key":"24_CR18","series-title":"LNCS","first-page":"119","volume-title":"WAIFI 2012","author":"S Gueron","year":"2012","unstructured":"Gueron, S., Krasnov, V.: Software implementation of modular exponentiation, using advanced vector instructions architectures. In: \u00d6zbudak, F., Rodr\u00edguez-Henr\u00edquez, F. (eds.) WAIFI 2012. LNCS, vol. 7369, pp. 119\u2013135. Springer, Heidelberg (2012)"},{"key":"24_CR19","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/978-3-642-02384-2_22","volume-title":"AFRICACRYPT 2009","author":"O Harrison","year":"2009","unstructured":"Harrison, O., Waldron, J.: Efficient acceleration of asymmetric cryptography on graphics hardware. In: Preneel, B. (ed.) AFRICACRYPT 2009. LNCS, vol. 5580, pp. 350\u2013367. Springer, Heidelberg (2009)"},{"key":"24_CR20","doi-asserted-by":"crossref","unstructured":"Holz, R., Braun, L., Kammenhuber, N., Carle, G.: The SSL landscape: a thorough analysis of the x.509 PKI using active and passive measurements. In: Proceedings of the 2011 ACM SIGCOMM Conference on Internet Measurement Conference, IMC \u201911, pp. 427\u2013444. ACM (2011)","DOI":"10.1145\/2068816.2068856"},{"key":"24_CR21","unstructured":"Intel Corporation. Using streaming SIMD extensions (SSE2) to perform big multiplications. Whitepaper AP-941 (2000). \n                      http:\/\/software.intel.com\/file\/24960"},{"key":"24_CR22","unstructured":"Intel Corporation. Intel 64 and IA-32 Architectures Software Developers Manual (Combined Volumes 1, 2A, 2B, 2C, 3A, 3B and 3C) (2013). \n                      http:\/\/download.intel.com\/products\/processor\/manual\/325462.pdf"},{"key":"24_CR23","series-title":"LNCS","first-page":"477","volume-title":"EUROCRYPT 1992","author":"K Iwamura","year":"1993","unstructured":"Iwamura, K., Matsumoto, T., Imai, H.: Systolic-arrays for modular exponentiation using montgomery method. In: Rueppel, R.A. (ed.) EUROCRYPT 1992. LNCS, vol. 658, pp. 477\u2013481. Springer, Heidelberg (1993)"},{"issue":"2","key":"24_CR24","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1109\/TC.2007.70793","volume":"57","author":"ME Kaihara","year":"2008","unstructured":"Kaihara, M.E., Takagi, N.: Bipartite modular multiplication method. IEEE Trans. Comput. 57(2), 157\u2013164 (2008)","journal-title":"IEEE Trans. Comput."},{"key":"24_CR25","first-page":"293","volume":"145","author":"AA Karatsuba","year":"1962","unstructured":"Karatsuba, A.A., Ofman, Y.: Multiplication of many-digital numbers by automatic computers. Proc. USSR Acad. Sci. 145, 293\u2013294 (1962)","journal-title":"Proc. USSR Acad. Sci."},{"issue":"3","key":"24_CR26","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1109\/40.502403","volume":"16","author":"K Koc","year":"1996","unstructured":"Koc, K., Acar, T., Kaliski Jr, B.S.: Analyzing and comparing montgomery multiplication algorithms. IEEE Micro 16(3), 26\u201333 (1996)","journal-title":"IEEE Micro"},{"key":"24_CR27","series-title":"LNCS","first-page":"104","volume-title":"CRYPTO 1996","author":"PC Kocher","year":"1996","unstructured":"Kocher, P.C.: Timing attacks on implementations of Diffie-Hellman, RSA, DSS and other systems. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 104\u2013113. Springer, Heidelberg (1996)"},{"key":"24_CR28","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1007\/978-3-642-32009-5_37","volume-title":"CRYPTO 2012","author":"AK Lenstra","year":"2012","unstructured":"Lenstra, A.K., Hughes, J.P., Augier, M., Bos, J.W., Kleinjung, T., Wachter, C.: Public keys. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 626\u2013642. Springer, Heidelberg (2012)"},{"issue":"2","key":"24_CR29","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1109\/PGEC.1964.263777","volume":"EC\u201313","author":"RD Merrill","year":"1964","unstructured":"Merrill, R.D.: Improving digital computer performance using residue number theory. IEEE Trans. Electron. Comput. EC\u201313(2), 93\u2013101 (1964)","journal-title":"IEEE Trans. Electron. Comput."},{"issue":"170","key":"24_CR30","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":"24_CR31","unstructured":"National Institute of Standards and Technology. Special publication 800\u201357: Recommendation for key management part 1: General (revision 3). \n                      http:\/\/csrc.nist.gov\/publications\/nistpubs\/800-57\/sp800-57_part1_rev3_general.pdf"},{"key":"24_CR32","unstructured":"OpenSSL. The open source toolkit for SSL\/TLS (2013)"},{"issue":"11","key":"24_CR33","doi-asserted-by":"publisher","first-page":"1474","DOI":"10.1109\/TC.2004.100","volume":"53","author":"D Page","year":"2004","unstructured":"Page, D., Smart, N.P.: Parallel cryptographic arithmetic using a redundant Montgomery representation. IEEE Trans. Comput. 53(11), 1474\u20131482 (2004)","journal-title":"IEEE Trans. Comput."},{"key":"24_CR34","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, 120\u2013126 (1978)","journal-title":"Commun. ACM"},{"key":"24_CR35","series-title":"LNCS","first-page":"322","volume-title":"ACNS 2013","author":"AH S\u00e1nchez","year":"2013","unstructured":"S\u00e1nchez, A.H., Rodr\u00edguez-Henr\u00edquez, F.: NEON implementation of an attribute-based encryption scheme. In: Jacobson, M., Locasto, M., Mohassel, P., Safavi-Naini, R. (eds.) ACNS 2013. LNCS, vol. 7954, pp. 322\u2013338. Springer, Heidelberg (2013)"},{"key":"24_CR36","unstructured":"U.S. Department of Commerce\/National Institute of Standards and Technology. Digital Signature Standard (DSS). FIPS-186-3 (2009). \n                      http:\/\/csrc.nist.gov\/publications\/fips\/fips186-3\/fips_186-3.pdf"}],"container-title":["Lecture Notes in Computer Science","Selected Areas in Cryptography -- SAC 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43414-7_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T17:35:35Z","timestamp":1558892135000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43414-7_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662434130","9783662434147"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43414-7_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}