{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T03:55:46Z","timestamp":1775620546966,"version":"3.50.1"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"13","license":[{"start":{"date-parts":[[2022,4,19]],"date-time":"2022-04-19T00:00:00Z","timestamp":1650326400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,4,19]],"date-time":"2022-04-19T00:00:00Z","timestamp":1650326400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001427","name":"All India Council for Technical Education","doi-asserted-by":"publisher","award":["NDF-AICTE-ID: 1-4091042410"],"award-info":[{"award-number":["NDF-AICTE-ID: 1-4091042410"]}],"id":[{"id":"10.13039\/501100001427","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2022,9]]},"DOI":"10.1007\/s11227-022-04442-2","type":"journal-article","created":{"date-parts":[[2022,4,19]],"date-time":"2022-04-19T08:02:46Z","timestamp":1650355366000},"page":"15567-15597","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A parallel elliptic curve crypto-processor architecture with reduced clock cycle for FPGA platforms"],"prefix":"10.1007","volume":"78","author":[{"given":"M.","family":"Kalaiarasi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V. R.","family":"Venkatasubramani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V.","family":"Vinoth Thyagarajan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Rajaram","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,4,19]]},"reference":[{"issue":"177","key":"4442_CR1","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1090\/S0025-5718-1987-0866109-5","volume":"48","author":"N Koblitz","year":"1987","unstructured":"Koblitz N (1987) Elliptic curve cryptosystems. Mathematics of computation 48(177):203\u2013209","journal-title":"Mathematics of computation"},{"key":"4442_CR2","doi-asserted-by":"crossref","unstructured":"Miller VS (1985) Use of elliptic curves in cryptography. In: Conference on the Theory and Application of Cryptographic Techniques, pp. 417\u2013426. Springer","DOI":"10.1007\/3-540-39799-X_31"},{"key":"4442_CR3","doi-asserted-by":"publisher","unstructured":"Hankerson D, Menezes A (2011) In: van Tilborg HCA, Jajodia S (eds.) NIST Elliptic Curves, pp. 843\u2013844. Springer, Boston, MA . https:\/\/doi.org\/10.1007\/978-1-4419-5906-5_255","DOI":"10.1007\/978-1-4419-5906-5_255"},{"key":"4442_CR4","doi-asserted-by":"publisher","unstructured":"IEEE standard specifications for public-key cryptography (2000) IEEE Std 1363\u20132000:1\u2013228. https:\/\/doi.org\/10.1109\/IEEESTD.2000.92292","DOI":"10.1109\/IEEESTD.2000.92292"},{"key":"4442_CR5","doi-asserted-by":"publisher","first-page":"22778","DOI":"10.1109\/ACCESS.2018.2828319","volume":"6","author":"M Imran","year":"2018","unstructured":"Imran M, Rashid M, Jafri AR, Najam-ul-Islam M (2018) Acryp-proc: flexible asymmetric crypto processor for point multiplication. IEEE Access 6:22778\u201322793","journal-title":"IEEE Access"},{"issue":"8","key":"4442_CR6","doi-asserted-by":"publisher","first-page":"1256","DOI":"10.1002\/cta.2759","volume":"48","author":"T Kudithi","year":"2020","unstructured":"Kudithi T (2020) An efficient hardware implementation of the elliptic curve cryptographic processor over prime field. International Journal of Circuit Theory and Applications 48(8):1256\u20131273","journal-title":"International Journal of Circuit Theory and Applications"},{"issue":"8","key":"4442_CR7","doi-asserted-by":"publisher","first-page":"1516","DOI":"10.1002\/cta.2498","volume":"46","author":"B Rashidi","year":"2018","unstructured":"Rashidi B (2018) Efficient hardware implementations of point multiplication for binary edwards curves. International Journal of Circuit Theory and Applications 46(8):1516\u20131533","journal-title":"International Journal of Circuit Theory and Applications"},{"key":"4442_CR8","doi-asserted-by":"crossref","unstructured":"Roy SS, Rebeiro C, Mukhopadhyay D (2011) Theoretical modeling of the itoh-tsujii inversion algorithm for enhanced performance on k-lut based fpgas. In: 2011 Design, Automation & Test in Europe, pp. 1\u20136 . IEEE","DOI":"10.1109\/DATE.2011.5763197"},{"key":"4442_CR9","doi-asserted-by":"crossref","unstructured":"Pateriya R, Vasudevan S (2011) Elliptic curve cryptography in constrained environments: a review. In: 2011 International Conference on Communication Systems and Network Technologies, pp. 120\u2013124 . IEEE","DOI":"10.1109\/CSNT.2011.32"},{"key":"4442_CR10","doi-asserted-by":"publisher","first-page":"73898","DOI":"10.1109\/ACCESS.2020.2988379","volume":"8","author":"MM Islam","year":"2020","unstructured":"Islam MM, Hossain MS, Shahjalal M, Hasan MK, Jang YM (2020) Area-time efficient hardware implementation of modular multiplication for elliptic curve cryptography. IEEE Access 8:73898\u201373906","journal-title":"IEEE Access"},{"issue":"5","key":"4442_CR11","doi-asserted-by":"publisher","first-page":"0176214","DOI":"10.1371\/journal.pone.0176214","volume":"12","author":"MS Hossain","year":"2017","unstructured":"Hossain MS, Saeedi E, Kong Y (2017) Parallel point-multiplication architecture using combined group operations for high-speed cryptographic applications. Plos one 12(5):0176214","journal-title":"Plos one"},{"key":"4442_CR12","doi-asserted-by":"publisher","first-page":"153383","DOI":"10.1016\/j.aeue.2020.153383","volume":"125","author":"N Kumar","year":"2020","unstructured":"Kumar N, Shirisha C (2020) An area-efficient ecc architecture over $$GF (2^{m})$$ for resource-constrained applications. AEU-Int J Electron Commun 125:153383","journal-title":"AEU-Int J Electron Commun"},{"issue":"2","key":"4442_CR13","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1002\/cta.2291","volume":"45","author":"V Ro\u017ei\u0107","year":"2017","unstructured":"Ro\u017ei\u0107 V, Reparaz O, Verbauwhede I (2017) A 5.1 $$\\mu$$J per point-multiplication elliptic curve cryptographic processor. Int J Circuit Theory Appl 45(2):170\u2013187","journal-title":"Int J Circuit Theory Appl"},{"key":"4442_CR14","doi-asserted-by":"crossref","unstructured":"Rebeiro C, Roy SS, Mukhopadhyay D (2012) Pushing the limits of high-speed $$GF(2^{m})$$ elliptic curve scalar multiplication on FDGAs. In: Cryptographic Hardware and Embedded Systems \u2013 CHES 2012. Springer, Heidelberg, pp 494\u2013511","DOI":"10.1007\/978-3-642-33027-8_29"},{"issue":"11","key":"4442_CR15","doi-asserted-by":"publisher","first-page":"1078","DOI":"10.1109\/TCSII.2015.2455992","volume":"62","author":"Z-U-A Khan","year":"2015","unstructured":"Khan Z-U-A, Benaissa M (2015) Throughput\/area-efficient ecc processor using montgomery point multiplication on fpga. IEEE Transactions on Circuits and Systems II: Express Briefs 62(11):1078\u20131082. https:\/\/doi.org\/10.1109\/TCSII.2015.2455992","journal-title":"IEEE Transactions on Circuits and Systems II: Express Briefs"},{"key":"4442_CR16","doi-asserted-by":"crossref","unstructured":"Rebeiro C, Mukhopadhyay D (2008) High speed compact elliptic curve cryptoprocessor for fpga platforms. In: International Conference on Cryptology in India, pp. 376\u2013388. Springer","DOI":"10.1007\/978-3-540-89754-5_29"},{"issue":"3","key":"4442_CR17","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0890-5401(88)90024-7","volume":"78","author":"T Itoh","year":"1988","unstructured":"Itoh T, Tsujii S (1988) A fast algorithm for computing multiplicative inverses in $$GF (2^{m})$$ using normal bases. Inf Comput 78(3):171\u2013177","journal-title":"Inf Comput"},{"key":"4442_CR18","doi-asserted-by":"crossref","unstructured":"Kalaiarasi M, Venkatasubramani V, Grace AC, Rajaram S (2020) High-speed inversion using $$x^{4^{n}}$$ units. In: Advances in Communication Systems and Networks, pp. 591\u2013597. Springer, Singapore","DOI":"10.1007\/978-981-15-3992-3_50"},{"issue":"1","key":"4442_CR19","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s10623-007-9073-6","volume":"45","author":"F Rodriguez-Henriquez","year":"2007","unstructured":"Rodriguez-Henriquez F, Morales-Luna G, Saqib NA, Cruz-Corte\u2019s N (2007) Parallel itoh-tsujii multiplicative inversion algorithm for a special class of trinomials. Designs, Codes and Cryptography 45(1):19\u201337","journal-title":"Designs, Codes and Cryptography"},{"issue":"8","key":"4442_CR20","doi-asserted-by":"publisher","first-page":"1508","DOI":"10.1109\/TVLSI.2010.2051343","volume":"19","author":"C Rebeiro","year":"2010","unstructured":"Rebeiro C, Roy SS, Reddy DS, Mukhopadhyay D (2010) Revisiting the itoh-tsujii inversion algorithm for fpga platforms. IEEE Transactions on Very Large Scale Integration (VLSI) systems 19(8):1508\u20131512","journal-title":"IEEE Transactions on Very Large Scale Integration (VLSI) systems"},{"issue":"18","key":"4442_CR21","doi-asserted-by":"publisher","first-page":"20130612","DOI":"10.1587\/elex.10.20130612","volume":"10","author":"V VR","year":"2013","unstructured":"VR V, Murali N, Rajaram S (2013) An improved quad itoh-tsujii algorithm for fpgas. IEICE Electronics Express 10(18):20130612\u201320130612","journal-title":"IEICE Electronics Express"},{"issue":"18","key":"4442_CR22","doi-asserted-by":"publisher","first-page":"1126","DOI":"10.1049\/el.2012.1427","volume":"48","author":"L Parrilla","year":"2012","unstructured":"Parrilla L, Lloris A, Castillo E, Garcia A (2012) Minimum-clock-cycle itoh-tsujii algorithm hardware implementation for cryptography applications over $$ GF(2^{m})$$ fields. Electron Lett 48(18):1126\u20131128","journal-title":"Electron Lett"},{"key":"4442_CR23","doi-asserted-by":"crossref","unstructured":"Kalaiarasi M, Venkatasubramani V, Rajaram S A parallel quad itoh-tsujii multiplicative inversion algorithm for fpga platforms. In: 2020 Third ISEA Conference on Security and Privacy (ISEA-ISAP), pp. 31\u201335. IEEE","DOI":"10.1109\/ISEA-ISAP49340.2020.234996"},{"key":"4442_CR24","doi-asserted-by":"crossref","unstructured":"Kalaiarasi M, Venkatasubramani VR, Rajaram S (2021) A hex itoh-tsujii inversion algorithm for fpga platforms. IEICE Electronics Express, 18\u201320210108","DOI":"10.1587\/elex.18.20210108"},{"key":"4442_CR25","volume-title":"Guide to Elliptic Curve Cryptography","author":"D Hankerson","year":"2006","unstructured":"Hankerson D, Menezes AJ, Vanstone S (2006) Guide to Elliptic Curve Cryptography. Springer, New York"},{"key":"4442_CR26","unstructured":"Rebeiro C (2009) Architecture explorations for elliptic curve cryptography on fpgas. Indian institute of technology madras"},{"key":"4442_CR27","unstructured":"Rodriguez-Henriquez F, Saqib NA, Perez AD, Koc CK (2007) Cryptographic algorithms on reconfigurable hardware. Springer Science & Business Media"},{"key":"4442_CR28","doi-asserted-by":"crossref","unstructured":"L\u00f3pez J, Dahab R (1999) Fast multiplication on elliptic curves over $$GF (2^{ m})$$ without precomputation. In: International Workshop on Cryptographic Hardware and Embedded Systems. Springer, pp 316\u2013327","DOI":"10.1007\/3-540-48059-5_27"},{"issue":"11","key":"4442_CR29","doi-asserted-by":"publisher","first-page":"1443","DOI":"10.1109\/TC.2008.133","volume":"57","author":"B Ansari","year":"2008","unstructured":"Ansari B, Hasan MA (2008) High-performance architecture of elliptic curve scalar multiplication. IEEE Transactions on Computers 57(11):1443\u20131453","journal-title":"IEEE Transactions on Computers"},{"issue":"5","key":"4442_CR30","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1049\/iet-cdt.2018.5056","volume":"13","author":"M Imran","year":"2019","unstructured":"Imran M, Rashid M, Jafri AR, Kashif M (2019) Throughput\/area optimised pipelined architecture for elliptic curve crypto processor. IET Computers & Digital Techniques 13(5):361\u2013368","journal-title":"IET Computers & Digital Techniques"},{"issue":"12","key":"4442_CR31","doi-asserted-by":"publisher","first-page":"2330","DOI":"10.1109\/TVLSI.2012.2230410","volume":"21","author":"H Mahdizadeh","year":"2013","unstructured":"Mahdizadeh H, Masoumi M (2013) Novel architecture for efficient fpga implementation of elliptic curve cryptographic processor over $$GF(2^{163})$$. IEEE Trans Very Large Scale Integr (VLSI) Syst 21(12):2330\u20132333","journal-title":"IEEE Trans Very Large Scale Integr (VLSI) Syst"},{"issue":"4","key":"4442_CR32","doi-asserted-by":"publisher","first-page":"1223","DOI":"10.1109\/TVLSI.2015.2453360","volume":"24","author":"L Li","year":"2015","unstructured":"Li L, Li S (2015) High-performance pipelined architecture of elliptic curve scalar multiplication over $$GF(2^{m})$$. IEEE Trans Very Large Scale Integr (VLSI) Syst 24(4):1223\u20131232","journal-title":"IEEE Trans Very Large Scale Integr (VLSI) Syst"},{"key":"4442_CR33","doi-asserted-by":"crossref","unstructured":"Deng Q, Bai X, Guo L, Wang Y (2009) A fast hardware implementation of multiplicative inversion in $$GF(2^{m})$$. In: 2009 Asia Pacific Conference on Postgraduate Research in Microelectronics & Electronics (PrimeAsia). IEEE, pp 472\u2013475","DOI":"10.1109\/PRIMEASIA.2009.5397344"},{"key":"4442_CR34","doi-asserted-by":"crossref","unstructured":"Rodriguez-Henriquez F, Cruz-Cortes N, Saqib N (2005) A fast implementation of multiplicative inversion over $$GF(2^{m})$$. In: International Conference on Information Technology: Coding and Computing (ITCC\u201905)-Volume II, vol. 1. IEEE, pp 574\u2013557","DOI":"10.1109\/ITCC.2005.8"},{"issue":"3","key":"4442_CR35","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/s13389-015-0094-1","volume":"5","author":"M Bluhm","year":"2015","unstructured":"Bluhm M, Gueron S (2015) Fast software implementation of binary elliptic curve cryptography. Journal of Cryptographic Engineering 5(3):215\u2013226","journal-title":"Journal of Cryptographic Engineering"},{"issue":"3","key":"4442_CR36","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/s13389-011-0017-8","volume":"1","author":"J Taverne","year":"2011","unstructured":"Taverne J, Faz-Hernandez A, Aranha DF, Rodriguez-Henriquez F, Hankerson D, Lopez J (2011) Speeding scalar multiplication over binary elliptic curves using the new carry-less multiplication instruction. Journal of Cryptographic Engineering 1(3):187\u2013199","journal-title":"Journal of Cryptographic Engineering"},{"key":"4442_CR37","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1016\/j.jpdc.2014.09.001","volume":"75","author":"SC Seo","year":"2015","unstructured":"Seo SC, Kim T, Hong S (2015) Accelerating elliptic curve scalar multiplication over GF (2m) on graphic hardwares. J Parallel Distrib Comput 75:152\u2013167","journal-title":"J Parallel Distrib Comput"},{"key":"4442_CR38","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/j.micpro.2018.09.003","volume":"63","author":"KC Loi","year":"2018","unstructured":"Loi KC, Ko S-B (2018) Flexible elliptic curve cryptography coprocessor using scalable finite field arithmetic blocks on FPGAs. Microprocess Microsyst 63:182\u2013189","journal-title":"Microprocess Microsyst"},{"issue":"1","key":"4442_CR39","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1109\/TIE.2012.2186104","volume":"60","author":"GD Sutter","year":"2012","unstructured":"Sutter GD, Deschamps J-P, Ima\u00f1a JL (2012) Efficient elliptic curve point multiplication using digit-serial binary field operations. IEEE Transactions on Industrial Electronics 60(1):217\u2013225","journal-title":"IEEE Transactions on Industrial Electronics"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-022-04442-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-022-04442-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-022-04442-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,8]],"date-time":"2022-08-08T15:14:13Z","timestamp":1659971653000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-022-04442-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,19]]},"references-count":39,"journal-issue":{"issue":"13","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["4442"],"URL":"https:\/\/doi.org\/10.1007\/s11227-022-04442-2","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,4,19]]},"assertion":[{"value":"10 March 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 April 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}