{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:26:34Z","timestamp":1750220794346,"version":"3.41.0"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,4,18]],"date-time":"2017-04-18T00:00:00Z","timestamp":1492473600000},"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":[[2018,9]]},"DOI":"10.1007\/s13389-017-0161-x","type":"journal-article","created":{"date-parts":[[2017,4,18]],"date-time":"2017-04-18T10:10:48Z","timestamp":1492510248000},"page":"201-210","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Montgomery inversion"],"prefix":"10.1007","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4869-5556","authenticated-orcid":false,"given":"Erkay","family":"Sava\u015f","sequence":"first","affiliation":[]},{"given":"\u00c7etin Kaya","family":"Ko\u00e7","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,4,18]]},"reference":[{"key":"161_CR1","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"RL Rivest","year":"1976","unstructured":"Rivest, R.L., Shamir, A., Adleman, A.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21, 120\u2013126 (1976)","journal-title":"Commun. ACM"},{"key":"161_CR2","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Trans. Inf. Theory 22, 644\u2013654 (1976)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"161_CR3","doi-asserted-by":"publisher","unstructured":"National Institute for Standards and Technology. FIPS PUB 186-4 Digital Signature Standard (DSS). doi: 10.6028\/NIST.FIPS.186-4 (2013)","DOI":"10.6028\/NIST.FIPS.186-4"},{"issue":"177","key":"161_CR4","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1090\/S0025-5718-1987-0866109-5","volume":"48","author":"N Koblitz","year":"1987","unstructured":"Koblitz, N.: Elliptic curve cryptosystems. Math. Comput. 48(177), 203\u2013209 (1987)","journal-title":"Math. Comput."},{"key":"161_CR5","first-page":"417","volume-title":"Crypto 1985. Lecture Notes in Computer Science","author":"VS Miller","year":"1986","unstructured":"Miller, V.S.: Use of elliptic curves in cryptography. In: Williams, H.C. (ed.) Crypto 1985. Lecture Notes in Computer Science, vol. 218, pp. 417\u2013426. Springer, Heidelberg (1986)"},{"key":"161_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-3198-2","volume-title":"Elliptic Curve Public Key Cryptosystems","author":"AJ Menezes","year":"1993","unstructured":"Menezes, A.J.: Elliptic Curve Public Key Cryptosystems. Kluwer Academic Publishers, Boston (1993)"},{"key":"161_CR7","unstructured":"Sakai, R., Ohgishi, K., Kasahara, M.: Cryptosystems based on pairing. In: The 2000 Symposium on Cryptography and Information Security, Okinawa, Japan, pp. 135\u2013148 (2000)"},{"issue":"170","key":"161_CR8","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1090\/S0025-5718-1985-0777282-X","volume":"44","author":"P\u00a0L Montgomery","year":"1985","unstructured":"Montgomery, P\u00a0.L.: Modular multiplication without trial division. Math. Comput. 44(170), 519\u2013521 (1985)","journal-title":"Math. Comput."},{"issue":"7","key":"161_CR9","doi-asserted-by":"crossref","first-page":"763","DOI":"10.1109\/12.863048","volume":"49","author":"E Sava\u015f","year":"2000","unstructured":"Sava\u015f, E., Ko\u00e7, \u00c7.K.: The Montgomery modular inverse\u2014revisited. IEEE Trans. Comput. 49(7), 763\u2013766 (2000)","journal-title":"IEEE Trans. Comput."},{"key":"161_CR10","unstructured":"Euclid Thirteen Books of Euclids Elements, vol.\u00a02, Books 3\u20139, 2nd edn, Translated by T.\u00a0L.\u00a0Heath. Dover Publications (1956)"},{"key":"161_CR11","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1016\/0021-9991(67)90047-2","volume":"1","author":"J Stein","year":"1967","unstructured":"Stein, J.: Computational problems associated with Racah algebra. J. Comput. Phys. 1, 397\u2013405 (1967)","journal-title":"J. Comput. Phys."},{"key":"161_CR12","volume-title":"The Art of Computer Programming","author":"DE Knuth","year":"1981","unstructured":"Knuth, D.E.: The Art of Computer Programming, vol. 2, 2nd edn. Addison-Wesley, Reading (1981)","edition":"2"},{"issue":"8","key":"161_CR13","doi-asserted-by":"crossref","first-page":"1064","DOI":"10.1109\/12.403725","volume":"44","author":"BS Kaliski Jr","year":"1995","unstructured":"Kaliski Jr., B.S.: The Montgomery inverse and its applications. IEEE Trans. Comput. 44(8), 1064\u20131065 (1995)","journal-title":"IEEE Trans. Comput."},{"issue":"5","key":"161_CR14","first-page":"733","volume":"E82\u2013A","author":"T Kobayashi","year":"1999","unstructured":"Kobayashi, T., Morita, H.: Fast modular inversion algorithm to match any operand unit. IEICE Trans. Fundam. E82\u2013A(5), 733\u2013740 (1999)","journal-title":"IEICE Trans. Fundam."},{"key":"161_CR15","doi-asserted-by":"crossref","unstructured":"Sava\u015f, E., Ko\u00e7, \u00c7.K.: Architecture for unified field inversion with applications in elliptic curve cryptography. In: Proceedings of the 9th IEEE International Conference on Electronics, Circuits and Systems\u2014ICECS 2002, vol. 3, pp. 1155\u20131158. Dubrovnik, Croatia (2002)","DOI":"10.1109\/ICECS.2002.1046457"},{"key":"161_CR16","first-page":"57","volume-title":"Cryptographic Hardware and Embedded Systems, LNCS","author":"R L\u00f3renz","year":"2002","unstructured":"L\u00f3renz, R.: New algorithm for classical modular inverse. In: Kaliski Jr., B.S., Ko\u00e7, \u00c7.K., Paar, C. (eds.) Cryptographic Hardware and Embedded Systems, LNCS, pp. 57\u201370. Springer, Berlin (2002)"},{"key":"161_CR17","doi-asserted-by":"crossref","unstructured":"Tenca, A.F., Tawalbeh, L.A.: An algorithm for unified modular division in GF(p) and GF(2 $$^{n}$$ n ) suitable for cryptographic hardware. IEE Electron. Lett. 40(5), 304\u2013306 (2004)","DOI":"10.1049\/el:20040233"},{"key":"161_CR18","first-page":"485","volume-title":"Cryptographic Hardware and Embedded Systems, LNCS","author":"AA-A Gutub","year":"2002","unstructured":"Gutub, A.A.-A., Tenca, A.F., Sava\u015f, E., Ko\u00e7, \u00c7.K.: Scalable and unified hardware to compute Montgomery inverse in $${GF}(p)$$ G F ( p ) and $$GF(2^n)$$ G F ( 2 n ) . In: Kaliski Jr., B.S., Ko\u00e7, \u00c7.K., Paar, C. (eds.) Cryptographic Hardware and Embedded Systems, LNCS, pp. 485\u2013500. Springer, Berlin (2002)"},{"issue":"4","key":"161_CR19","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1049\/ip-cdt:20059032","volume":"152","author":"E Sava\u015f","year":"2005","unstructured":"Sava\u015f, E., Naseer, M., Gutub, A.A.-A., Ko\u00e7, \u00c7.K.: Efficient unified Montgomery inversion with multibit shifting. IEE Process. Comput. Digit. Tech. 152(4), 489\u2013498 (2005)","journal-title":"IEE Process. Comput. Digit. Tech."},{"key":"161_CR20","doi-asserted-by":"crossref","unstructured":"Cohen, H., Miyaji, A., Ono, T.: Efficient elliptic curve exponentiation using mixed coordinates. In: ASIACRYPT 1998, pp. 51\u201365","DOI":"10.1007\/3-540-49649-1_6"},{"issue":"4","key":"161_CR21","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/s13389-014-0084-8","volume":"4","author":"JW Bos","year":"2014","unstructured":"Bos, J.W.: Constant time modular inversion. J. Cryptogr. Eng. 4(4), 275\u2013281 (2014)","journal-title":"J. Cryptogr. Eng."},{"key":"161_CR22","unstructured":"Gutub, A.A.-A., Tenca, A.F., Ko\u00e7s, \u00c7.K.: Scalable VLSI architecture for GF(p) Montgomery modular inverse computation. In: IEEE Computer Society Annual Symposium on VLSI, ISVLSI\u201902, pp. 46\u201351. Pittsburgh, Pennsylvania, USA, April 25\u201326 (2002)"},{"key":"161_CR23","doi-asserted-by":"crossref","unstructured":"Gutub, A.A.-A., Tenca, A.F.: Efficient scalable hardware architecture for Montgomery inverse computation in GF( $$p$$ p ). In: IEEE Workshop on Signal Processing Systems (SIPS\u201903), pp. 93\u201398. Seoul, Korea, August 27\u201329 (2003)","DOI":"10.1109\/SIPS.2003.1235650"},{"issue":"2","key":"161_CR24","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/j.vlsi.2003.12.001","volume":"37","author":"AA-A Gutub","year":"2004","unstructured":"Gutub, A.A.-A., Tenca, A.F.: Efficient scalable VLSI architecture for Montgomery inversion in GF( p). Integr. VLSI J. 37(2), 103\u2013120 (2004)","journal-title":"Integr. VLSI J."},{"key":"161_CR25","unstructured":"Gutub, A.A.-A., Sava\u015f, E., Kalganova, T.: Scalable VLSI design for fast GF(p) Montgomery inverse computation. In: IEEE International Conference on Computer and Communication Engineering (ICCCE \u201906). Kuala Lumpur, Malaysia (2006)"},{"issue":"4","key":"161_CR26","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1049\/iet-cdt:20060183","volume":"1","author":"AA-A Gutub","year":"2007","unstructured":"Gutub, A.A.-A.: High speed hardware architecture to compute galois fields GF(p) montgomery inversion with scalability features. IET Comput. Digit. Tech. 1(4), 389\u2013396 (2007)","journal-title":"IET Comput. Digit. Tech."},{"key":"161_CR27","doi-asserted-by":"crossref","unstructured":"Zi-bin, D., Fan, Q., Xiao-hui, Y.: Scalable hardware architecture for montgomery inversion computation in dual-field. In: 2009 WASE International Conference on Information Engineering, pp. 206\u2013209. Taiyuan, Chanxi (2009)","DOI":"10.1109\/ICIE.2009.208"},{"issue":"6","key":"161_CR28","doi-asserted-by":"crossref","first-page":"813","DOI":"10.1080\/00207217.2011.567036","volume":"98","author":"C Chen","year":"2011","unstructured":"Chen, C., Qin, Z.: Efficient algorithm and systolic architecture for modular division. Int. J. Electron. 98(6), 813\u2013823 (2011)","journal-title":"Int. J. Electron."},{"key":"161_CR29","doi-asserted-by":"crossref","unstructured":"Murat, E., Karda\u015f, S., Sava\u015f, E.: Scalable and efficient FPGA implementation of Montgomery inversion. In: Proceedings of the 2011 Workshop on Lightweight Security and Privacy: Devices, Protocols, and Applications, LIGHTSEC\u201911, pp. 61\u201368 (2011)","DOI":"10.1109\/LightSec.2011.14"},{"key":"161_CR30","doi-asserted-by":"crossref","unstructured":"Liu, Z., Wenger, E., Gro\u00dfsch\u00e4dl, J.: MoTE-ECC: energy-scalable elliptic curve cryptography for wireless sensor networks. In: ACNS 2014, pp. 361\u2013379","DOI":"10.1007\/978-3-319-07536-5_22"},{"key":"161_CR31","first-page":"365","volume":"2016","author":"M Ishii","year":"2016","unstructured":"Ishii, M., Detrey, J., Gaudry, P., Inomata, A., Fujikawa, K.: Fast Modular arithmetic on the Kalray MPPA-256 processor for an energy-efficient implementation of ECM. IACR Cryptol. ePrint Arch. 2016, 365 (2016)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"161_CR32","doi-asserted-by":"crossref","unstructured":"Aranha, D.F., Fuentes-Casta\u00f1eda, L., Knapp, E., Menezes, A., Rodr\u00edguez-Henr\u00edquez, F.: Implementing Pairings at the 192-Bit Security Level, pp. 177\u2013195. Pairing (2012)","DOI":"10.1007\/978-3-642-36334-4_11"},{"key":"161_CR33","doi-asserted-by":"crossref","unstructured":"De\u00a0Win, E., Mister, S., Preneel, B., Wiener, M.: On the performance of signature schemes based on elliptic curves. In: Buhler, J.P. (ed) Algorithmic Number Theory: Third International Symposium, ANTS-III, pp. 252\u2013266. Portland, Oregon, USA, June 21\u201325, Springer, Berlin (1998)","DOI":"10.1007\/BFb0054867"},{"key":"161_CR34","doi-asserted-by":"crossref","unstructured":"Fouque, P.-A., Tibouchi, M.: Indifferentiable hashing to Barreto\u2013Naehrig curves. In: LATINCRYPT 2012, pp. 1\u201317","DOI":"10.1007\/978-3-642-33481-8_1"}],"container-title":["Journal of Cryptographic Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13389-017-0161-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13389-017-0161-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13389-017-0161-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:48:58Z","timestamp":1750200538000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13389-017-0161-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4,18]]},"references-count":34,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,9]]}},"alternative-id":["161"],"URL":"https:\/\/doi.org\/10.1007\/s13389-017-0161-x","relation":{},"ISSN":["2190-8508","2190-8516"],"issn-type":[{"type":"print","value":"2190-8508"},{"type":"electronic","value":"2190-8516"}],"subject":[],"published":{"date-parts":[[2017,4,18]]}}}