{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T16:17:09Z","timestamp":1761581829731},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,5,7]],"date-time":"2019-05-07T00:00:00Z","timestamp":1557187200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptogr Eng"],"published-print":{"date-parts":[[2019,11]]},"DOI":"10.1007\/s13389-019-00213-7","type":"journal-article","created":{"date-parts":[[2019,5,7]],"date-time":"2019-05-07T20:41:40Z","timestamp":1557261700000},"page":"333-339","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Uniform Montgomery multiplier"],"prefix":"10.1007","volume":"9","author":[{"given":"Gokay","family":"Saldamli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoo-Jin","family":"Baek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,5,7]]},"reference":[{"key":"213_CR1","doi-asserted-by":"crossref","unstructured":"Bhattacharya, S., Mukhopadhyay, D.: Who watches the watchmen? Utilizing performance monitors for compromising keys of RSA on intel platforms. In: Proceedings of the 17th International Workshop on Cryptographic Hardware and Embedded Systems\u2014CHES 2015, pp. 248\u2013266 (2015)","DOI":"10.1007\/978-3-662-48324-4_13"},{"key":"213_CR2","doi-asserted-by":"crossref","unstructured":"Boneh, D., DeMillo, R.A., Lipton, R.J.: On the importance of checking cryptographic protocols for faults. In: EUROCRYPT\u201997, Lecture Notes in Computer Science, vol. 1233, pp. 37\u201351. Springer (1997)","DOI":"10.1007\/3-540-69053-0_4"},{"issue":"2","key":"213_CR3","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1093\/qjmam\/4.2.236","volume":"4","author":"AD Booth","year":"1951","unstructured":"Booth, A.D.: A signed binary multiplication technique. Q. J. Mech. Appl. Math. 4(2), 236\u2013240 (1951)","journal-title":"Q. J. Mech. Appl. Math."},{"key":"213_CR4","doi-asserted-by":"crossref","unstructured":"Boscher, A., Naciri, R., Prouff, E.: CRT RSA algorithm protected against fault attacks. In: WISTP 2007, Lecture Notes in Computer Science, vol. 4262, pp. 229\u2013243. Springer (2007)","DOI":"10.1007\/978-3-540-72354-7_19"},{"key":"213_CR5","unstructured":"Brumley, D., Boneh, D.: Remote timing attacks are practical. In: Proceedings of the 12th Conference on USENIX Security Symposium, SSYM\u201903, vol. 12. USENIX Association, Berkeley, CA, USA (2003)"},{"key":"213_CR6","doi-asserted-by":"crossref","unstructured":"Coron, J.S.: Resistance against differential power analysis for elliptic curve cryptosystems. In: Proceedings of the First International Workshop on Cryptographic Hardware and Embedded Systems\u2014CHES 1999, LNCS, vol. 1717, pp. 292\u2013302. Springer (1999)","DOI":"10.1007\/3-540-48059-5_25"},{"issue":"9","key":"213_CR7","doi-asserted-by":"publisher","first-page":"1116","DOI":"10.1109\/TC.2006.135","volume":"55","author":"C Giraud","year":"2006","unstructured":"Giraud, C.: An RSA implementation resistant to fault attacks and to simple power analysis. IEEE Trans. Comput. 55(9), 1116\u20131120 (2006)","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"213_CR8","first-page":"83","volume":"38","author":"RR Goundar","year":"2008","unstructured":"Goundar, R.R., Shiota, K., Toyonaga, M.: SPA resistant scalar multiplication using golden ratio addition chain method. IAENG Int. J. Appl. Math. 38(2), 83\u201388 (2008)","journal-title":"IAENG Int. J. Appl. Math."},{"key":"213_CR9","doi-asserted-by":"crossref","unstructured":"Hachez, G., Quisquater, J.J.: Montgomery exponentiation with no final subtractions: improved results. In: Proceedings of the 2nd International Workshop on Cryptographic Hardware and Embedded Systems\u2014CHES 2000, LNCS, vol. 1965, pp. 293\u2013301. Springer (2000)","DOI":"10.1007\/3-540-44499-8_23"},{"key":"213_CR10","doi-asserted-by":"crossref","unstructured":"Joye, M.: Highly regular $$m$$-ary powering ladders. In: Proceedings of Selected Areas in Cryptography\u2014SAC 2009, pp. 350\u2013363. Springer (2009)","DOI":"10.1007\/978-3-642-05445-7_22"},{"key":"213_CR11","doi-asserted-by":"crossref","unstructured":"Joye, M., Tunstall, M.: Exponent recoding and regular exponentiation algorithms. In: AfricaCrypt 2009, LNCS, vol. 5580, pp. 334\u2013349. Springer (2009)","DOI":"10.1007\/978-3-642-02384-2_21"},{"key":"213_CR12","unstructured":"Ko\u00e7, C.K.: High-speed RSA implementation. Technical report TR 201, RSA Laboratories (1994). \n                    ftp:\/\/ftp.rsasecurity.com\/pub\/pdfs\/tr201.pdf"},{"key":"213_CR13","doi-asserted-by":"crossref","unstructured":"Kocher, P.C., Jaffe, J., Jun, B.: Differential power analysis. In: Proceedings of the 19th International Cryptology Conference on Advances in Cryptology\u2014CRYPTO 1999, LNCS, vol. 1666, pp. 388\u2013397. Springer (1999)","DOI":"10.1007\/3-540-48405-1_25"},{"key":"213_CR14","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, 519\u2013519 (1985)","journal-title":"Math. Comput."},{"issue":"1","key":"213_CR15","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/JRPROC.1961.287779","volume":"49","author":"OL MacSorley","year":"1961","unstructured":"MacSorley, O.L.: High-speed arithmetic in binary computers. IEEE Proc. IRE 49(1), 67\u201391 (1961)","journal-title":"IEEE Proc. IRE"},{"key":"213_CR16","doi-asserted-by":"crossref","unstructured":"M\u00f6ller, B.: Securing elliptic curve point multiplication against side-channel attacks. In: ISC 2001, Lecture Notes in Computer Science, vol. 2200, pp. 324\u2013334. Springer (2001)","DOI":"10.1007\/3-540-45439-X_22"},{"issue":"2","key":"213_CR17","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"},{"issue":"1\u20132","key":"213_CR18","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/j.mcm.2011.06.017","volume":"55","author":"I Vasyltsov","year":"2012","unstructured":"Vasyltsov, I., Saldamli, G.: Fault detection and a differential fault analysis countermeasure for the Montgomery power ladder in elliptic curve cryptography. Math. Comput. Model. 55(1\u20132), 256\u2013267 (2012)","journal-title":"Math. Comput. Model."},{"key":"213_CR19","doi-asserted-by":"crossref","unstructured":"Vuillaume, C., Okeya, K.: Flexible exponentiation with resistance to side channel attacks. In: ACNS 2006, Lecture Notes in Computer Science, vol. 3989, pp. 268\u2013283. Springer (2006)","DOI":"10.1007\/11767480_18"},{"issue":"21","key":"213_CR20","doi-asserted-by":"publisher","first-page":"1831","DOI":"10.1049\/el:19991230","volume":"35","author":"CD Walter","year":"1999","unstructured":"Walter, C.D.: Montgomery exponentiation needs no final subtractions. Electron. Lett. 35(21), 1831\u20131832 (1999)","journal-title":"Electron. Lett."},{"key":"213_CR21","doi-asserted-by":"crossref","unstructured":"Walter, C.D.: Leakage from Montgomery multiplication. In: Cryptographic Engineering, pp. 431\u2013449. Springer (2009)","DOI":"10.1007\/978-0-387-71817-0_16"},{"key":"213_CR22","first-page":"1115","volume":"2017","author":"CD Walter","year":"2017","unstructured":"Walter, C.D.: Hardware aspects of Montgomery modular multiplication. IACR Cryptol. 2017, 1115 (2017)","journal-title":"IACR Cryptol."},{"key":"213_CR23","doi-asserted-by":"crossref","unstructured":"Witteman, M.F., van Woudenberg, J.G.J., Menarini, F.: Defeating RSA multiply-always and message blinding countermeasures. In: Proceedings of the 11th International Conference on Topics in Cryptology: CT-RSA 2011, LNCS, vol. 6558, pp. 77\u201388. Springer (2011)","DOI":"10.1007\/978-3-642-19074-2_6"}],"container-title":["Journal of Cryptographic Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13389-019-00213-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13389-019-00213-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13389-019-00213-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,5]],"date-time":"2020-05-05T23:46:33Z","timestamp":1588722393000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13389-019-00213-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,7]]},"references-count":23,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,11]]}},"alternative-id":["213"],"URL":"https:\/\/doi.org\/10.1007\/s13389-019-00213-7","relation":{},"ISSN":["2190-8508","2190-8516"],"issn-type":[{"value":"2190-8508","type":"print"},{"value":"2190-8516","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,5,7]]},"assertion":[{"value":"8 June 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 November 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 May 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}