{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T09:00:17Z","timestamp":1775638817088,"version":"3.50.1"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,4,5]],"date-time":"2012-04-05T00:00:00Z","timestamp":1333584000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Cryptogr Eng"],"published-print":{"date-parts":[[2012,5]]},"DOI":"10.1007\/s13389-012-0031-5","type":"journal-article","created":{"date-parts":[[2012,4,4]],"date-time":"2012-04-04T15:27:35Z","timestamp":1333553255000},"page":"31-43","source":"Crossref","is-referenced-by-count":23,"title":["Efficient software implementations of modular exponentiation"],"prefix":"10.1007","volume":"2","author":[{"given":"Shay","family":"Gueron","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,4,5]]},"reference":[{"key":"31_CR1","doi-asserted-by":"crossref","unstructured":"Acii\u00e7mez, O., Gueron, S., Seifert, J.P.: New Branch Prediction Vulnerabilities in Open SSL and necessary software countermeasures. In: Cryptography and Coding, 11th IMA International Conference (IMA Int. Conf. 2007), Lecture Notes in Computer Science, vol. 4887, pp. 185\u2013203 (2007)","DOI":"10.1007\/978-3-540-77272-9_12"},{"key":"31_CR2","doi-asserted-by":"crossref","unstructured":"Acii\u00e7mez, O., Koc\u00e7, C.K., Seifert, J.P.: Predicting secret keys via branch prediction. In: Lecture Notes in Computer Science, vol. 4377, pp. 225\u2013242 (2007)","DOI":"10.1007\/11967668_15"},{"key":"31_CR3","doi-asserted-by":"crossref","unstructured":"Acii\u00e7mez, O., Schindler, W.: A vulnerability in RSA implementations due to instruction cache analysis and its demonstration on OpenSSL. In: CT-RSA 2008, pp. 256\u2013273 (2008)","DOI":"10.1007\/978-3-540-79263-5_16"},{"key":"31_CR4","unstructured":"Barker, E., Roginsky, A.: Transitions: Recommendation for transitioning the use of cryptographic algorithms and key lengths. In: NIST Special Publication 800-131A, p. 5 (2011). http:\/\/csrc.nist.gov\/publications\/nistpubs\/800-131A\/sp800-131A.pdf"},{"key":"31_CR5","unstructured":"Brent, R., Zimmermann, P.: Modern Computer Arithmetic. Cambridge University Press (2010). (retrieved from http:\/\/www.loria.fr\/~zimmerma\/mca\/pub226.html )"},{"key":"31_CR6","unstructured":"Brumley, D., Boneh, D.: Remote timing attacks are practical. In: Proceedings of the 12th USENIX Security Symposium. pp. 1\u201314 (2003)"},{"key":"31_CR7","unstructured":"Gopal, V., Guilford, J., Ozturk, E., Feghali, W., Wolrich, G., Dixon, M.: Fast and constant-time implementation of modular exponentiation. In: 28th International Symposium on Reliable Distributed Systems. Niagara Falls, New York, USA (2009). http:\/\/www.cse.buffalo.edu\/srds2009\/escs2009_submission_Gopal.pdf"},{"key":"31_CR8","unstructured":"Gueron, S., Krasnov, V.: Efficient and side channel analysis resistant 512-bit and 1,024-bit modular exponentiation for optimizing RSA1024 and RSA2048 on \u00d786_64 platforms, OpenSSL #2582 patch. http:\/\/rt.openssl.org\/Ticket\/Display.html?id=2582&user=guest&pass=guest (posted Aug 2011)"},{"key":"31_CR9","doi-asserted-by":"crossref","unstructured":"Gueron, S., Krasnov, V.: Speeding up Big-Number Squaring. (to be published; ITNG 2012)","DOI":"10.1109\/ITNG.2012.61"},{"key":"31_CR10","unstructured":"Gueron, S.: Efficient Software Implementations of Modular Exponentiation. eprint (2011) http:\/\/eprint.iacr.org\/2011\/239"},{"key":"31_CR11","doi-asserted-by":"crossref","unstructured":"Gueron, S.: Enhanced Montgomery multiplication. In: Cryptographic Hardware and Embedded Systems (CHES 2002), Lecture Notes in Computer Science, vol. 2523, pp. 46\u201356 (2002)","DOI":"10.1007\/3-540-36400-5_5"},{"key":"31_CR12","unstructured":"Intel: Intel\u00ae 64 and IA-32 Architectures Optimization Reference Manual (2011) http:\/\/www.intel.com\/Assets\/PDF\/manual\/248966.pdf"},{"key":"31_CR13","doi-asserted-by":"crossref","unstructured":"Ko\u00e7, \u00c7.K., Walter, C.D.: Montgomery arithmetic. In: van Tilborg, H. (ed.) Encyclopedia of Cryptography and Security. pp. 298\u2013394, Springer (2005)","DOI":"10.1007\/0-387-23483-7_263"},{"key":"31_CR14","doi-asserted-by":"crossref","unstructured":"Koc, \u00c7.K., Kaliski, B.S.: Analyzing and comparing Montgomery multiplication algorithms. Micro 16(3), 26\u201333 (1996) http:\/\/islab.oregonstate.edu\/papers\/j37acmon.pdf","DOI":"10.1109\/40.502403"},{"key":"31_CR15","unstructured":"Kounavis, M.E., Kang, X., Grewal, K., Eszenyi, M., Gueron, S., Durham, D.: Encrypting the internet. In: Proceedings of the ACM SIGCOMM 2010 Conference on SIGCOMM (2010) http:\/\/portal.acm.org\/citation.cfm?id=1851182.1851200"},{"key":"31_CR16","unstructured":"Menezes, A.J., van Oorschot P.C., Vanstone, S.A.: Handbook of Applied Cryptography. CRC Press, Boca Raton (2001) (5th printing)"},{"key":"31_CR17","doi-asserted-by":"crossref","unstructured":"Montgomery, P.L.: Modular Multiplication Without Trial Division. In: Mathematics of Computation, Volume 44:519\u2013521 (1985)","DOI":"10.2307\/2007970"},{"key":"31_CR18","unstructured":"OpenSSL: The Open Source toolkit for SSL\/TLS. http:\/\/www.openssl.org\/"},{"key":"31_CR19","unstructured":"OpenSSL: CVS Repository, http:\/\/cvs.openssl.org\/"},{"key":"31_CR20","unstructured":"Percival C.: Cache missing for fun and profit. http:\/\/www.daemonology.net\/papers\/htt.pdf (2005)"},{"key":"31_CR21","unstructured":"Polyakov, A., OpenSSL Team (2011) (personal communications)"},{"key":"31_CR22","doi-asserted-by":"crossref","unstructured":"Schindler, W.: A timing attack against RSA with the Chinese Remainder Theorem. In: Proceedings of the Second International Workshop on Cryptographic Hardware and Embedded Systems, pp. 109\u2013124. Springer (2000)","DOI":"10.1007\/3-540-44499-8_8"},{"key":"31_CR23","unstructured":"Walter, C.D.: Montgomery exponentiation needs no final subtractions. Electron. Lett. 35, 1831\u20131832 (1999)"},{"key":"31_CR24","doi-asserted-by":"crossref","unstructured":"Walter, C.D.: An overview of Montgomery\u2019s multiplication technique: how to make it smaller and faster. In: Paar, C., Ko\u00e7, \u00c7.K. (eds.) Cryptographic Hardware and Embedded Systems, Lecture Notes in Computer Science, vol. 1717, pp. 80\u201393 (1999)","DOI":"10.1007\/3-540-48059-5_9"},{"key":"31_CR25","doi-asserted-by":"crossref","unstructured":"Walter, C.D.: Precise Bounds for Montgomery Modular Multiplication and Some Potentially Insecure RSA Moduli. In: CT-RSA, vol. 2010, pp. 30\u201339 (2002)","DOI":"10.1007\/3-540-45760-7_3"},{"key":"31_CR26","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1049\/ip-cdt:20020235","volume":"149","author":"T. Yan\u0131k","year":"2002","unstructured":"Yan\u0131k T., Sava\u015f E., Koc \u00c7.K.: Incomplete reduction in modular arithmetic. IEEE Proc. Comput. Digital Tech. 149, 46\u201352 (2002)","journal-title":"IEEE Proc. Comput. Digital Tech."},{"key":"31_CR27","unstructured":"Ying, H.: Optimization for 1024 bit RSA on \u00d786_64 platform, OpenSSL #2175 patch, http:\/\/rt.openssl.org\/Ticket\/Display.html?id=2175&user=guest&pass=guest (posted Feb 20, 2010)"}],"container-title":["Journal of Cryptographic Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13389-012-0031-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13389-012-0031-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13389-012-0031-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,26]],"date-time":"2019-06-26T18:49:32Z","timestamp":1561574972000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13389-012-0031-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,4,5]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,5]]}},"alternative-id":["31"],"URL":"https:\/\/doi.org\/10.1007\/s13389-012-0031-5","relation":{},"ISSN":["2190-8508","2190-8516"],"issn-type":[{"value":"2190-8508","type":"print"},{"value":"2190-8516","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,4,5]]}}}