{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:50:13Z","timestamp":1725551413321},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642121647"},{"type":"electronic","value":"9783642121654"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12165-4_2","type":"book-chapter","created":{"date-parts":[[2010,3,31]],"date-time":"2010-03-31T17:04:35Z","timestamp":1270055075000},"page":"14-24","source":"Crossref","is-referenced-by-count":0,"title":["Fast Forth Power and Its Application in Inversion Computation for a Special Class of Trinomials"],"prefix":"10.1007","author":[{"given":"Yin","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gong-liang","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jian-hua","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781107360211","volume-title":"Elliptic Curves in Cryptography","author":"I. Blake","year":"1999","unstructured":"Blake, I., Seroussy, G., Smart, N.P.: Elliptic Curves in Cryptography. Cambridge University Press, Cambridge (1999)"},{"issue":"5","key":"2_CR2","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1109\/12.769434","volume":"48","author":"B. Sunar","year":"1999","unstructured":"Sunar, B., Ko\u00e7, \u00c7.K.: Mastrovito Multiplier for All Trinomials. IEEE Trans. Comput.\u00a048(5), 522\u2013527 (1999)","journal-title":"IEEE Trans. Comput."},{"issue":"5-6","key":"2_CR3","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/j.compeleceng.2007.05.001","volume":"33","author":"A.P. Fournaris","year":"2007","unstructured":"Fournaris, A.P., Koufopavlou, O.: Applying systolic multiplication-inversion architectures based on modified extended Euclidean algorithm for GF(2\n                    k\n                  ) in elliptic curve cryptography. Comput. Electr. Eng.\u00a033(5-6), 333\u2013348 (2007)","journal-title":"Comput. Electr. Eng."},{"issue":"2","key":"2_CR4","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1023\/A:1013860532636","volume":"25","author":"J. Guajardo","year":"2002","unstructured":"Guajardo, J., Paar, C.: Itoh-Tsujii Inversion in Standard Basis and Its Application in Cryptography. Codes. Des. Codes Cryptography\u00a025(2), 207\u2013216 (2002)","journal-title":"Codes. Des. Codes Cryptography"},{"issue":"10","key":"2_CR5","doi-asserted-by":"publisher","first-page":"1161","DOI":"10.1109\/12.729800","volume":"47","author":"J. Guo","year":"1998","unstructured":"Guo, J., Wang, C.: Systolic Array Implementation of Euclid\u2019s Algorithm for Inversion and Division in GF (2\n                    m\n                  ). IEEE Trans. Comput.\u00a047(10), 1161\u20131167 (1998)","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"2_CR6","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.: A fast algorithm for computing multiplicative inverses in GF(2\n                    m\n                  ) using normal bases. Inf. Comput.\u00a078(3), 171\u2013177 (1988)","journal-title":"Inf. Comput."},{"issue":"7","key":"2_CR7","doi-asserted-by":"publisher","first-page":"750","DOI":"10.1109\/TC.2002.1017695","volume":"51","author":"H. Wu","year":"2002","unstructured":"Wu, H.: Bit-Parallel Finite Field Multiplier and Squarer Using Polynomial Basis. IEEE Trans. Comput.\u00a051(7), 750\u2013758 (2002)","journal-title":"IEEE Trans. Comput."},{"issue":"11","key":"2_CR8","first-page":"1514","volume":"52","author":"Z. Yan","year":"2003","unstructured":"Yan, Z., Sarwate, D.V.: New Systolic Architectures for Inversion and Division in GF(2\n                    m\n                  ). IEEE Trans. Comput.\u00a052(11), 1514\u20131519 (2003)","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"2_CR9","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s10623-007-9073-6","volume":"45","author":"F. Rodr\u00edguez-Henr\u00edquez","year":"2007","unstructured":"Rodr\u00edguez-Henr\u00edquez, F., Morales-Luna, G., Saqib, N., Cruz-Cort\u00e9s, N.: Parallel Itoh-Tsujii multiplicative inversion algorithm for a special class of trinomials. Des. Codes Cryptography\u00a045(1), 19\u201337 (2007)","journal-title":"Des. Codes Cryptography"},{"issue":"8","key":"2_CR10","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1109\/TC.1985.1676616","volume":"34","author":"C.C. Wang","year":"1985","unstructured":"Wang, C.C., Truong, T.K., Shao, H.M., Deutsch, L.J., Omura, J.K., Reed, I.S.: VLSI Architectures for Computing Multiplications and Inverses in GF(2\n                    m\n                  ). IEEE Trans. Comput.\u00a034(8), 709\u2013717 (1985)","journal-title":"IEEE Trans. Comput."},{"issue":"5","key":"2_CR11","first-page":"485","volume":"54","author":"H. Fan","year":"2005","unstructured":"Fan, H., Dai, Y.: Fast Bit-Parallel GF(2\n                    n\n                  ) Multiplier for All Trinomials. IEEE Trans. Comput.\u00a054(5), 485\u2013490 (2005)","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"2_CR12","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1109\/12.902754","volume":"50","author":"B. Sunar","year":"2001","unstructured":"Sunar, B., Ko\u00e7, \u00c7.K.: An Efficient Optimal Normal Basis Type II Multiplier. IEEE Trans. Comput.\u00a050(1), 83\u201387 (2001)","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"2_CR13","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1109\/TC.2007.70822","volume":"57","author":"F. Rodr\u00edguez-Henr\u00edquez","year":"2008","unstructured":"Rodr\u00edguez-Henr\u00edquez, F., Morales-Luna, G., L\u00f3pez, J.: Low-Complexity Bit-Parallel Square Root Computation over GF(2\n                    m\n                  ) for All Trinomials. IEEE Trans. Comput.\u00a057(4), 472\u2013480 (2008)","journal-title":"IEEE Trans. Comput."},{"key":"2_CR14","unstructured":"FIPS 186-2. Digital Signature Standard (DSS). Federal Information Processing Standards Publication 186-2, National Institute of Standards and Technology (2000), \n                    \n                      http:\/\/csrc.nist.gov\/publications\/fips\/archive\/fips186-2\/fips186-2.pdf"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12165-4_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:04:13Z","timestamp":1619784253000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12165-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642121647","9783642121654"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12165-4_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}