{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T02:25:42Z","timestamp":1742955942746,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319162768"},{"type":"electronic","value":"9783319162775"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-16277-5_4","type":"book-chapter","created":{"date-parts":[[2015,2,21]],"date-time":"2015-02-21T06:36:06Z","timestamp":1424500566000},"page":"61-80","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Reducing the Complexity of Normal Basis Multiplication"],"prefix":"10.1007","author":[{"given":"\u00d6mer","family":"E\u01e7ecio\u01e7lu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u00c7etin Kaya","family":"Ko\u00e7","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,2,22]]},"reference":[{"issue":"1","key":"4_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF02620228","volume":"6","author":"GB Agnew","year":"1993","unstructured":"Agnew, G.B., Beth, T., Mullin, R.C., Vanstone, S.A.: Arithmetic operations in $${GF}(2^m)$$. J. Cryptol. 6(1), 3\u201313 (1993)","journal-title":"J. Cryptol."},{"issue":"2","key":"4_CR2","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/BF00196789","volume":"3","author":"GB Agnew","year":"1991","unstructured":"Agnew, G.B., Mullin, R.C., Onyszchuk, I., Vanstone, S.A.: An implementation for a fast public-key cryptosystem. J. Cryptol. 3(2), 63\u201379 (1991)","journal-title":"J. Cryptol."},{"issue":"5","key":"4_CR3","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1109\/49.223883","volume":"11","author":"GB Agnew","year":"1993","unstructured":"Agnew, G.B., Mullin, R.C., Vanstone, S.A.: An implementation of elliptic curve cryptosystems over $$F_{2^{155}}$$. IEEE J. Sel. Areas Commun. 11(5), 804\u2013813 (1993)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"4_CR4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107360211","volume-title":"Elliptic Curves in Cryptography","author":"I Blake","year":"1999","unstructured":"Blake, I., Seroussi, G., Smart, N.: Elliptic Curves in Cryptography. Cambridge University Press, Cambridge (1999)"},{"issue":"1\u20133","key":"4_CR5","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s10440-006-9047-0","volume":"93","author":"SS Erdem","year":"2006","unstructured":"Erdem, S.S., Yan\u0131k, T., Ko\u00e7, \u00c7.K.: Polynomial basis multiplication in GF$$(2^m)$$. Acta Applicandae Mathematicae 93(1\u20133), 33\u201355 (2006)","journal-title":"Acta Applicandae Mathematicae"},{"key":"4_CR6","unstructured":"Gao, S.: Normal bases over finite fields. Ph.D. thesis, University of Waterloo (1993)"},{"issue":"4","key":"4_CR7","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/BF00125200","volume":"2","author":"S Gao","year":"1992","unstructured":"Gao, S., Lenstra Jr., H.W.: Optimal normal bases. Des. Codes Cryptgr. 2(4), 315\u2013323 (1992)","journal-title":"Des. Codes Cryptgr."},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-540-73074-3_6","volume-title":"Arithmetic of Finite Fields","author":"J von zur Gathen","year":"2007","unstructured":"von zur Gathen, J., Shokrollahi, M.A., Shokrollahi, J.: Efficient multiplication using type 2 optimal normal bases. In: Carlet, C., Sunar, B. (eds.) WAIFI 2007. LNCS, vol. 4547, pp. 55\u201368. Springer, Heidelberg (2007)"},{"issue":"5","key":"4_CR9","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1109\/12.859542","volume":"49","author":"A Halbuto\u01e7ullar\u0131","year":"2000","unstructured":"Halbuto\u01e7ullar\u0131, A., Ko\u00e7, \u00c7.K.: Mastrovito multiplier for general irreducible polynomials. IEEE Trans. Comput. 49(5), 503\u2013518 (2000)","journal-title":"IEEE Trans. Comput."},{"issue":"8","key":"4_CR10","doi-asserted-by":"publisher","first-page":"962","DOI":"10.1109\/12.156539","volume":"41","author":"MA Hasan","year":"1992","unstructured":"Hasan, M.A., Wang, M.Z., Bhargava, V.K.: Modular construction of low complexity parallel multipliers for a class of finite fields $${GF}(2^m)$$. IEEE Trans. Comput. 41(8), 962\u2013971 (1992)","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"4_CR11","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^m)$$ using normal bases. Inf. Comput. 78(3), 171\u2013177 (1988)","journal-title":"Inf. Comput."},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0890-5401(89)90045-X","volume":"83","author":"T Itoh","year":"1989","unstructured":"Itoh, T., Tsujii, S.: Structure of parallel multipliers for a class of finite fields $${GF}(2^m)$$. Inf. Comput. 83, 21\u201340 (1989)","journal-title":"Inf. Comput."},{"issue":"1","key":"4_CR13","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1023\/A:1008208521515","volume":"14","author":"\u00c7K Ko\u00e7","year":"1998","unstructured":"Ko\u00e7, \u00c7.K., Acar, T.: Montgomery multiplication in GF$$(2^k)$$. Des. Codes Cryptgr. 14(1), 57\u201369 (1998)","journal-title":"Des. Codes Cryptgr."},{"issue":"3","key":"4_CR14","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1109\/40.502403","volume":"16","author":"\u00c7K Ko\u00e7","year":"1996","unstructured":"Ko\u00e7, \u00c7.K., Acar, T., Kaliski Jr., B.S.: Analyzing and comparing Montgomery multiplication algorithms. IEEE Micro 16(3), 26\u201333 (1996)","journal-title":"IEEE Micro"},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/3-540-51083-4_67","volume-title":"Applied Algebra, Algebraic Algorithms and Error-Correcting Codes","author":"ED Mastrovito","year":"1988","unstructured":"Mastrovito, E.D.: VLSI architectures for multiplication over finite field GF$$(2^m)$$. In: Mora, T. (ed.) AAECC-6. LNCS, vol. 357, pp. 297\u2013309. Springer, Heidelberg (1988)"},{"key":"4_CR16","unstructured":"Mastrovito, E.D.: VLSI architectures for computation in Galois fields. Ph.D. thesis, Link\u00f6ping University, Department of Electrical Engineering, Link\u00f6ping, Sweden (1991)"},{"issue":"170","key":"4_CR17","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(170), 519\u2013521 (1985)","journal-title":"Math. Comput."},{"key":"4_CR18","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0166-218X(88)90090-X","volume":"22","author":"R Mullin","year":"1988","unstructured":"Mullin, R., Onyszchuk, I., Vanstone, S., Wilson, R.: Optimal normal bases in $${GF}(p^n)$$. Discrete Appl. Math. 22, 149\u2013161 (1988)","journal-title":"Discrete Appl. Math."},{"key":"4_CR19","unstructured":"Omura, J., Massey, J.: Computational method and apparatus for finite field arithmetic (May 1986). U.S. Patent Number 4,587,627"},{"issue":"7","key":"4_CR20","doi-asserted-by":"publisher","first-page":"856","DOI":"10.1109\/12.508323","volume":"45","author":"C Paar","year":"1996","unstructured":"Paar, C.: A new architecture for a parallel finite field multiplier with low complexity based on composite fields. IEEE Trans. Comput. 45(7), 856\u2013861 (1996)","journal-title":"IEEE Trans. Comput."},{"issue":"5","key":"4_CR21","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1109\/TC.2002.1004590","volume":"51","author":"A Reyhani-Masoleh","year":"2001","unstructured":"Reyhani-Masoleh, A., Hasan, M.A.: A new construction of Massey-Omura parallel multiplier over GF$$(2^m)$$. IEEE Trans. Comput. 51(5), 511\u2013520 (2001)","journal-title":"IEEE Trans. Comput."},{"key":"4_CR22","unstructured":"Saldaml\u0131, G.: Spectral modular arithmetic. Ph.D. thesis, Oregon State University (2005)"},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"Saldaml\u0131, G., Baek, Y.J., Ko\u00e7, \u00c7.K.: Spectral modular arithmetic for binary extension fields. In: The 2011 International Conference on Information and Computer Networks (ICICN), pp. 323\u2013328 (2011)","DOI":"10.1109\/ICCSN.2011.6014061"},{"key":"4_CR24","unstructured":"Seroussi, G.: Table of low-weight binary irreducible polynomials (August 1998). Hewlett-Packard, HPL-98-135"},{"key":"4_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/3-540-48059-5_12","volume-title":"Cryptographic Hardware and Embedded Systems","author":"JH Silverman","year":"1999","unstructured":"Silverman, J.H.: Fast multiplication in finite fields GF$$(2^n)$$. In: Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 1999. LNCS, vol. 1717, pp. 122\u2013134. Springer, Heidelberg (1999)"},{"issue":"5","key":"4_CR26","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. 48(5), 522\u2013527 (1999)","journal-title":"IEEE Trans. Comput."},{"issue":"8","key":"4_CR27","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1109\/12.707588","volume":"47","author":"H Wu","year":"1998","unstructured":"Wu, H., Hasan, M.A.: Low complexity bit-parallel multipliers for a class of finite fields. IEEE Trans. Comput. 47(8), 883\u2013887 (1998)","journal-title":"IEEE Trans. Comput."},{"issue":"7","key":"4_CR28","doi-asserted-by":"publisher","first-page":"734","DOI":"10.1109\/12.936239","volume":"50","author":"T Zhang","year":"2001","unstructured":"Zhang, T., Parhi, K.K.: Systematic design of original and modified Mastrovito multipliers for general irreducible polynomials. IEEE Trans. Comput. 50(7), 734\u2013749 (2001)","journal-title":"IEEE Trans. Comput."}],"container-title":["Lecture Notes in Computer Science","Arithmetic of Finite Fields"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-16277-5_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T22:52:09Z","timestamp":1676933529000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-16277-5_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319162768","9783319162775"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-16277-5_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"22 February 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}