{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T20:51:04Z","timestamp":1777495864146,"version":"3.51.4"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,6,16]],"date-time":"2007-06-16T00:00:00Z","timestamp":1181952000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2007,9,5]]},"DOI":"10.1007\/s10623-007-9073-6","type":"journal-article","created":{"date-parts":[[2007,6,16]],"date-time":"2007-06-16T07:56:28Z","timestamp":1181980588000},"page":"19-37","source":"Crossref","is-referenced-by-count":40,"title":["Parallel Itoh\u2013Tsujii multiplicative inversion algorithm for a special class of trinomials"],"prefix":"10.1007","volume":"45","author":[{"given":"Francisco","family":"Rodr\u00edguez-Henr\u00edquez","sequence":"first","affiliation":[]},{"given":"Guillermo","family":"Morales-Luna","sequence":"additional","affiliation":[]},{"given":"Nazar A.","family":"Saqib","sequence":"additional","affiliation":[]},{"given":"Nareli","family":"Cruz-Cort\u00e9s","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,6,16]]},"reference":[{"key":"9073_CR1","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0890-5401(88)90024-7","volume":"78","author":"T Itoh","year":"1998","unstructured":"Itoh T and Tsujii S (1998). A fast algorithm for computing multiplicative inverses in GF(2 m ) using normal basis. Inf Comput 78: 171\u2013177","journal-title":"Inf Comput"},{"issue":"10","key":"9073_CR2","doi-asserted-by":"crossref","first-page":"1383","DOI":"10.1109\/12.35833","volume":"38","author":"GL Feng","year":"1989","unstructured":"Feng GL (1989). A VLSI architecture for fast inversion in GF(2 m ). IEEE Trans Comput 38(10): 1383\u20131386","journal-title":"IEEE Trans Comput"},{"issue":"5","key":"9073_CR3","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1109\/12.926155","volume":"50","author":"N Takagi","year":"2001","unstructured":"Takagi N, Yoshiki J and Tagaki K (2001). A fast algorithm for multiplicative inversion in GF(2 m ) using normal basis. IEEE Trans Comput 50(5): 394\u2013398","journal-title":"IEEE Trans Comput"},{"key":"9073_CR4","doi-asserted-by":"crossref","unstructured":"Hasan MA (2001) Efficient computation of multiplicative inverses for cryptographic applications. In: Proceedings of the 15th IEEE symposium on computer arithmetic, Vail, Colorado, USA","DOI":"10.1109\/ARITH.2001.930105"},{"issue":"3","key":"9073_CR5","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1049\/el:19970172","volume":"33","author":"S Yen","year":"1997","unstructured":"Yen S (1997). Improved normal basis inversion in GF(2 m ). IEE Electron Lett 33(3): 196\u2013197","journal-title":"IEE Electron Lett"},{"key":"9073_CR6","unstructured":"Gutub AA-A, Tenca AF, Savas E, Koc CK (2002) Scalable and unified hardware to compute montgomery inverse in GF(p) and GF(2 n ). In: Proceedings of the Cryptographic hardware and embedded systems\u2014CHES 2002, 4th international workshop, redwood shores, vol 2523, CA, USA, pp 484\u2013499"},{"key":"9073_CR7","doi-asserted-by":"crossref","unstructured":"Rodr\u00edguez-Henr\u00edquez F, Saqib NA, Cruz-Cort\u00e9s N (2005) A fast implementation of multiplicative inversion over GF(2 m ). In: Proceedings of the international symposium on information technology (ITCC 2005), vol 1, Las Vegas, Nevada, USA, pp 574\u2013579","DOI":"10.1109\/ITCC.2005.8"},{"key":"9073_CR8","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1023\/A:1013860532636","volume":"25","author":"J Guajardo","year":"2002","unstructured":"Guajardo J and Paar C (2002). Itoh\u2013tsujii inversion in standard basis and its application in cryptography and codes. Des Codes Cryptogr 25: 207\u2013216","journal-title":"Des Codes Cryptogr"},{"key":"9073_CR9","volume-title":"The art of computer programming","author":"DE Knuth","year":"1997","unstructured":"Knuth DE (1997). The art of computer programming. Addison-Wesley, Reading, MA","edition":"3"},{"key":"9073_CR10","unstructured":"Rodr\u00edguez-Henr\u00edquez F, Morales-Luna G, L\u00f3pez-Hern\u00e1ndez J (2006) Low complexity bit-parallel square root computation over GF(2 m ) for all trinomials. Cryptology ePrint Archive, Report 2006\/133, http:\/\/eprint.iacr.org\/."},{"key":"9073_CR11","first-page":"118","volume-title":"Workshop on selected areas in cryptography (SAC 2000), vol LNCS 2012","author":"H Wu","year":"2000","unstructured":"Wu H (2000). On complexity of squaring using polynomial basis in GF(2 m ). In: Stinson, STD (eds) Workshop on selected areas in cryptography (SAC 2000), vol LNCS 2012., pp 118\u2013129. Springer, Berlin"},{"key":"9073_CR12","doi-asserted-by":"crossref","unstructured":"Wu H (1999) Low complexity bit-parallel finite field arithmetic using polynomial basis. in: Proceedings of the cryptographic hardware and embedded systems\u2014CHES 1999, first international workshop. ser. Lecture notes in computer science, vol 1717. Springer, Berlin, pp 280\u2013291","DOI":"10.1007\/3-540-48059-5_24"},{"key":"9073_CR13","unstructured":"IEEE standards documents (2004) IEEE P1363: standard specifications for public key cryptography. Draft Version D18. IEEE, http:\/\/grouper.ieee.org\/groups\/1363\/"},{"issue":"8","key":"9073_CR14","doi-asserted-by":"crossref","first-page":"1047","DOI":"10.1109\/TC.2004.43","volume":"53","author":"K Fong","year":"2004","unstructured":"Fong K, Hankerson D, L\u00f3pez J and Menezes A (2004). Field inversion and point halving revisited. IEEE Trans Comput 53(8): 1047\u20131059","journal-title":"IEEE Trans Comput"},{"issue":"8","key":"9073_CR15","doi-asserted-by":"crossref","first-page":"1047","DOI":"10.1109\/TC.2004.43","volume":"53","author":"K Fong","year":"2004","unstructured":"Fong K, Hankerson D, L\u00f3pez J and Menezes A (2004). Field inversion and point halving revisited. IEEE Trans Comput 53(8): 1047\u20131059","journal-title":"IEEE Trans Comput"},{"key":"9073_CR16","doi-asserted-by":"crossref","DOI":"10.1201\/9781439821916","volume-title":"Handbook of applied cryptography","author":"AJ Menezes","year":"1996","unstructured":"Menezes AJ, Oorschot PC and Vanstone SA (1996). Handbook of applied cryptography. CRC Press, Boca Raton, FL"},{"key":"9073_CR17","doi-asserted-by":"crossref","unstructured":"Rodr\u00edguez-Henr\u00edquez F, Morales-Luna G, Saqib NA, Cruz-Cort\u00e9s N (2007) A parallel version of the Itoh-Tsujii multiplicative inversion algorithm. In: Proceedings of International Workshop on Applied Reconfigurable Computing (ARC2007), Lecture notes in computer science, Mangaratiba, Brazil, March 2007, Vol 4419. Springer, pp. 226\u2013237","DOI":"10.1007\/978-3-540-71431-6_21"},{"issue":"8","key":"9073_CR18","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/j.micpro.2004.03.003","volume":"28","author":"F Rodr\u00edguez-Henr\u00edquez","year":"2004","unstructured":"Rodr\u00edguez-Henr\u00edquez F, Saqib NA and D\u00edaz-P\u00e9rez A (2004). A fast parallel implementation of elliptic curve point multiplication over GF(2 m ). Elsevier J Microprocessors Microsyst 28(8): 329\u2013339","journal-title":"Elsevier J Microprocessors Microsyst"},{"issue":"11","key":"9073_CR19","doi-asserted-by":"crossref","first-page":"1808","DOI":"10.1109\/4.962304","volume":"36","author":"J Goodman","year":"2001","unstructured":"Goodman J and Chandrakasan AP (2001). An energy-efficient reconfigurable public-key cryptography processor. IEEE J Solid-State Circuits 36(11): 1808\u20131820","journal-title":"IEEE J Solid-State Circuits"},{"key":"9073_CR20","doi-asserted-by":"crossref","unstructured":"Bednara M, Daldrup M, Shokrollahi J, Teich J, von zur Gathen J (2002) Reconfigurable implementation of elliptic curve crypto algorithms. In: Proceedings of the 9th reconfigurable architectures workshop (RAW-02), Fort Lauderdale, FL, USA","DOI":"10.1109\/IPDPS.2002.1016557"},{"key":"9073_CR21","doi-asserted-by":"crossref","unstructured":"Lutz J (2003) High performance elliptic curve cryptographic co-processor. Master\u2019s thesis, University of Waterloo","DOI":"10.1109\/ITCC.2004.1286701"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-007-9073-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-007-9073-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-007-9073-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T15:50:08Z","timestamp":1559231408000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-007-9073-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6,16]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,9,5]]}},"alternative-id":["9073"],"URL":"https:\/\/doi.org\/10.1007\/s10623-007-9073-6","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,6,16]]}}}