{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T16:26:53Z","timestamp":1761582413010,"version":"3.40.3"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319017952"},{"type":"electronic","value":"9783319017969"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-01796-9_40","type":"book-chapter","created":{"date-parts":[[2013,8,1]],"date-time":"2013-08-01T11:32:19Z","timestamp":1375356739000},"page":"369-377","source":"Crossref","is-referenced-by-count":0,"title":["Pipeline Design of Bit-Parallel Gaussian Normal Basis Multiplier over GF(2m)"],"prefix":"10.1007","author":[{"given":"Che Wun","family":"Chiou","sequence":"first","affiliation":[]},{"given":"Jim-Min","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Yu-Ku","family":"Li","sequence":"additional","affiliation":[]},{"given":"Chiou-Yng","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Tai-Pao","family":"Chuang","sequence":"additional","affiliation":[]},{"given":"Yun-Chi","family":"Yeh","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"40_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/3-540-39799-X_31","volume-title":"Advances in Cryptology","author":"V.S. Miller","year":"1986","unstructured":"Miller, V.S.: Use of Elliptic Curves in Cryptography. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol.\u00a0218, pp. 417\u2013426. Springer, Heidelberg (1986)"},{"key":"40_CR2","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.: Elliptic curve cryptosystems. Mathematics of Computation\u00a048, 203\u2013209 (1987)","journal-title":"Mathematics of Computation"},{"issue":"2","key":"40_CR3","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1109\/MCAS.2010.936785","volume":"10","author":"E. Sava\u015f","year":"2010","unstructured":"Sava\u015f, E., Ko\u00e7, \u00c7.K.: Finite field arithmetic for cryptography. IEEE Circuits and Systems Magazine\u00a010(2), 40\u201356 (2010)","journal-title":"IEEE Circuits and Systems Magazine"},{"key":"40_CR4","first-page":"79","volume":"6","author":"T.C. Bartee","year":"1963","unstructured":"Bartee, T.C., Schneider, D.J.: Computation with finite fields. Information and Computing\u00a06, 79\u201398 (1963)","journal-title":"Information and Computing"},{"doi-asserted-by":"crossref","unstructured":"Mastrovito, E.D.: VLSI architectures for multiplication over finite field GF(2m), Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes. In: Mora, T. (ed.) Proc. Sixth Int\u2019l Conf., AAECC-6, Rome, pp. 297\u2013309 (1988)","key":"40_CR5","DOI":"10.1007\/3-540-51083-4_67"},{"issue":"3","key":"40_CR6","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1109\/12.660172","volume":"47","author":"\u00c7.K. Ko\u00e7","year":"1998","unstructured":"Ko\u00e7, \u00c7.K., Sunar, B.: Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields. IEEE Trans. Computers\u00a047(3), 353\u2013356 (1998)","journal-title":"IEEE Trans. Computers"},{"key":"40_CR7","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 fields GF(2m). Information and Computation\u00a083, 21\u201340 (1989)","journal-title":"Information and Computation"},{"issue":"5","key":"40_CR8","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1109\/12.926154","volume":"50","author":"C.Y. Lee","year":"2001","unstructured":"Lee, C.Y., Lu, E.H., Lee, J.Y.: Bit-parallel systolic multipliers for GF(2m) fields defined by all-one and equally-spaced polynomials. IEEE Trans. Computers\u00a050(5), 385\u2013393 (2001)","journal-title":"IEEE Trans. Computers"},{"issue":"2","key":"40_CR9","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1109\/12.663762","volume":"47","author":"C. Paar","year":"1998","unstructured":"Paar, C., Fleischmann, P., Roelse, P.: Efficient multiplier architectures for Galois Fields GF(24n). IEEE Trans. Computers\u00a047(2), 162\u2013170 (1998)","journal-title":"IEEE Trans. Computers"},{"issue":"7","key":"40_CR10","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. Computers\u00a051(7), 750\u2013758 (2002)","journal-title":"IEEE Trans. Computers"},{"issue":"2","key":"40_CR11","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1109\/TC.2007.19","volume":"56","author":"H. Fan","year":"2007","unstructured":"Fan, H., Hasan, M.A.: A new approach to subquadratic space complexity parallel multipliers for extended binary fields. IEEE Trans. Computers\u00a056(2), 224\u2013233 (2007)","journal-title":"IEEE Trans. Computers"},{"issue":"3","key":"40_CR12","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1049\/iet-ifs.2010.0139","volume":"5","author":"W.-T. Huang","year":"2011","unstructured":"Huang, W.-T., Chang, C.H., Chiou, C.W., Tan, S.-Y.: Non-XOR Approach for Low-Cost Bit-Parallel Polynomial Basis Multiplier over GF(2\n                  m\n                ). IET Information Security\u00a05(3), 152\u2013162 (2011)","journal-title":"IET Information Security"},{"issue":"4","key":"40_CR13","first-page":"534","volume":"65","author":"C.W. Chiou","year":"2011","unstructured":"Chiou, C.W., Lin, J.M., Lee, C.-Y., Ma, C.-T.: Low complexity systolic Mastrovito multiplier over GF(2m). European Journal of Scientific Research\u00a065(4), 534\u2013545 (2011)","journal-title":"European Journal of Scientific Research"},{"issue":"3.1","key":"40_CR14","doi-asserted-by":"publisher","first-page":"1044","DOI":"10.1016\/j.ipl.2011.08.004","volume":"111","author":"C.W. Chiou","year":"2011","unstructured":"Chiou, C.W., Lee, C.-Y., Yeh, Y.-C.: Multiplexer implementation of low-complexity polynomial basis multiplier in GF(2m) using all one polynomial. Information Processing Letters\u00a0111(3.1), 1044\u20131047 (2011)","journal-title":"Information Processing Letters"},{"issue":"11","key":"40_CR15","doi-asserted-by":"publisher","first-page":"1223","DOI":"10.1109\/12.736433","volume":"47","author":"H. Wu","year":"1998","unstructured":"Wu, H., Hasan, M., Blake, A., New, I.F.: low-complexity bit-parallel finite field multipliers using weakly dual bases. IEEE Trans. Computers\u00a047(11), 1223\u20131234 (1998)","journal-title":"IEEE Trans. Computers"},{"issue":"3","key":"40_CR16","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1109\/12.485570","volume":"45","author":"S.T.J. Fenn","year":"1996","unstructured":"Fenn, S.T.J., Benaissa, M., Taylor, D.: GF(2m) multiplication and division over the dual basis. IEEE Trans. Computers\u00a045(3), 319\u2013327 (1996)","journal-title":"IEEE Trans. Computers"},{"issue":"1","key":"40_CR17","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1137\/0403012","volume":"3","author":"M. Wang","year":"1990","unstructured":"Wang, M., Blake, I.F.: Bit serial multiplication in finite fields. SIAM J. Disc. Math.\u00a03(1), 140\u2013148 (1990)","journal-title":"SIAM J. Disc. Math."},{"key":"40_CR18","doi-asserted-by":"publisher","first-page":"869","DOI":"10.1109\/TIT.1982.1056591","volume":"28","author":"E.R. Berlekamp","year":"1982","unstructured":"Berlekamp, E.R.: Bit-serial Reed-Solomon encoder. IEEE Trans. Inform. Theory\u00a0IT-28, 869\u2013874 (1982)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"4","key":"40_CR19","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1049\/iet-ifs.2012.0210","volume":"6","author":"J.-H. Wang","year":"2012","unstructured":"Wang, J.-H., Chang, H.W., Chiou, C.W., Liang, W.-Y.: Low-complexity design of bit-parallel dual basis multiplier over GF(2m). IET Information Security\u00a06(4), 324\u2013328 (2012)","journal-title":"IET Information Security"},{"issue":"2","key":"40_CR20","first-page":"80","volume":"23","author":"Y.Y. Hua","year":"2012","unstructured":"Hua, Y.Y., Lin, J.-M., Chiou, C.W., Lee, C.-Y., Liu, Y.H.: A novel digit-serial dual basis systolic Karatsuba Multiplier over GF(2m). Journal of Computers\u00a023(2), 80\u201394 (2012)","journal-title":"Journal of Computers"},{"issue":"11","key":"40_CR21","doi-asserted-by":"publisher","first-page":"3169","DOI":"10.1093\/ietfec\/e88-a.11.3169","volume":"E88-A","author":"C.Y. Lee","year":"2005","unstructured":"Lee, C.Y., Chiou, C.W.: Efficient design of low-complexity bit-parallel systolic Hankel multipliers to implement multiplication in normal and dual bases of GF(2m). IEICE Transactions on Fundamentals of Electronics, Communications and Computer Science\u00a0E88-A(11), 3169\u20133179 (2005)","journal-title":"IEICE Transactions on Fundamentals of Electronics, Communications and Computer Science"},{"unstructured":"Massey, J.L., Omura, J.K.: Computational method and apparatus for finite field arithmetic, U.S. Patent Number 4587627 (1986)","key":"40_CR22"},{"issue":"8","key":"40_CR23","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1109\/TC.1985.1676616","volume":"C-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(2m). IEEE Trans. Computers\u00a0C-34(8), 709\u2013717 (1985)","journal-title":"IEEE Trans. Computers"},{"issue":"1","key":"40_CR24","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1109\/TC.2006.10","volume":"55","author":"A. Reyhani-Masoleh","year":"2006","unstructured":"Reyhani-Masoleh, A.: Efficient algorithms and architectures for field multiplication using Gaussian normal bases. IEEE Trans. Computers\u00a055(1), 34\u201347 (2006)","journal-title":"IEEE Trans. Computers"},{"issue":"1","key":"40_CR25","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.cose.2004.09.012","volume":"24","author":"C.W. Chiou","year":"2005","unstructured":"Chiou, C.W., Lee, C.Y.: Multiplexer-based double-exponentiation for normal basis of GF (2m). Computers & Security\u00a024(1), 83\u201386 (2005)","journal-title":"Computers & Security"},{"key":"40_CR26","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/BF00196789","volume":"3","author":"G.B. Agnew","year":"1991","unstructured":"Agnew, G.B., Mullin, R.C., Onyszchuk, I.M., Vanstone, S.A.: An implementation for a fast public-key cryptosystem. Journal of Cryptology\u00a03, 63\u201379 (1991)","journal-title":"Journal of Cryptology"},{"issue":"10","key":"40_CR27","doi-asserted-by":"publisher","first-page":"1278","DOI":"10.1109\/12.257715","volume":"42","author":"M.A. Hasan","year":"1993","unstructured":"Hasan, M.A., Wang, M.Z., Bhargava, V.K.: A modified Massey-Omura parallel multiplier for a class of finite fields. IEEE Trans. Computers\u00a042(10), 1278\u20131280 (1993)","journal-title":"IEEE Trans. Computers"},{"unstructured":"Kwon, S.: A low complexity and a low latency bit parallel systolic multiplier over GF(2m) using an optimal normal basis of type II. In: Proc. of the 16th IEEE Symposium on Computer Arithmetic, Santiago de Compostela, Spain, pp. 196\u2013202 (2003)","key":"40_CR28"},{"issue":"10","key":"40_CR29","doi-asserted-by":"publisher","first-page":"1435","DOI":"10.1109\/TC.2007.1076","volume":"56","author":"H. Fan","year":"2007","unstructured":"Fan, H., Hasan, M.A.: Subquadratic computational complexity schemes for extended binary field multiplication using optimal normal bases. IEEE Trans. Computers\u00a056(10), 1435\u20131437 (2007)","journal-title":"IEEE Trans. Computers"},{"key":"40_CR30","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139172769","volume-title":"Introduction to Finite Fields and Their Applications","author":"R. Lidl","year":"1994","unstructured":"Lidl, R., Niederreiter, H.: Introduction to Finite Fields and Their Applications. Cambridge Univ. Press, New York (1994)"},{"key":"40_CR31","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0166-218X(89)90001-2","volume":"25","author":"D.W. Ash","year":"1989","unstructured":"Ash, D.W., Blake, I.F., Vanstone, S.A.: Low complexity normal bases. Discrete Applied Math.\u00a025, 191\u2013210 (1989)","journal-title":"Discrete Applied Math."},{"issue":"4","key":"40_CR32","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1049\/iet-ifs.2012.0200","volume":"6","author":"C.W. Chiou","year":"2012","unstructured":"Chiou, C.W., Chuang, T.-P., Lin, S.-S., Lee, C.-Y., Lin, J.-M., Yeh, Y.-C.: Palindromic-like representation for Gaussian normal basis multiplier over GF(2m) with odd type-t. IET Information Security\u00a06(4), 318\u2013323 (2012)","journal-title":"IET Information Security"},{"issue":"4","key":"40_CR33","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1049\/iet-ifs.2012.0110","volume":"6","author":"C.W. Chiou","year":"2012","unstructured":"Chiou, C.W., Chang, H.W., Liang, W.-Y., Lee, C.-Y., Lin, J.-M., Yeh, Y.-C.: Low-complexity Gaussian normal basis multiplier over GF(2\n                        \n                  m\n                \n                        ). IET Information Security\u00a06(4), 310\u2013317 (2012)","journal-title":"IET Information Security"},{"issue":"2","key":"40_CR34","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/s11265-011-0654-2","volume":"69","author":"C.-Y. Lee","year":"2012","unstructured":"Lee, C.-Y., Chiou, C.W.: Scalable Gaussian normal basis multipliers over GF(2m) using Hankel matrix-vector representation. Journal of Signal Processing Systems for Signal Image and Video Technology\u00a069(2), 197\u2013211 (2012)","journal-title":"Journal of Signal Processing Systems for Signal Image and Video Technology"},{"issue":"3","key":"40_CR35","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1049\/iet-ifs.2011.0190","volume":"6","author":"T.-P. Chuang","year":"2012","unstructured":"Chuang, T.-P., Chiou, C.W., Lin, S.-S., Lee, C.-Y.: Fault-tolerant Gaussian normal basis multiplier over GF(2m). IET Information Security\u00a06(3), 157\u2013170 (2012)","journal-title":"IET Information Security"},{"issue":"4","key":"40_CR36","doi-asserted-by":"publisher","first-page":"744","DOI":"10.1109\/TC.2012.22","volume":"62","author":"R. Azarderakhsh","year":"2013","unstructured":"Azarderakhsh, R., Reyhani-Masoleh, A.: Low-complexity multiplier architectures for single and hybrid-double multiplications in Gaussian normal bases. IEEE Trans. Computers\u00a062(4), 744\u2013757 (2013)","journal-title":"IEEE Trans. Computers"},{"unstructured":"ANSI X.962: Public key cryptography for the financial services industry: The Elliptic Curve Digital Signature Algorithm (ECDSA), Am. Nat\u2019l Standards Inst. (1999)","key":"40_CR37"},{"unstructured":"FIPS 186-2: Digital Signature Standard (DSS), Federal Information Processing Standards Publication 186-2, Nat\u2019l Inst. Of Standards and Technology (2000)","key":"40_CR38"},{"unstructured":"IEEE Standard 1363-2000: IEEE standard specifications for public-key cryptography (2000)","key":"40_CR39"},{"issue":"5","key":"40_CR40","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1016\/S0167-4048(03)00507-8","volume":"22","author":"S.A. Vanstone","year":"2003","unstructured":"Vanstone, S.A.: Next generation security for wireless: Elliptic curve cryptography. Computers and Security\u00a022(5), 412\u2013415 (2003)","journal-title":"Computers and Security"}],"container-title":["Advances in Intelligent Systems and Computing","Genetic and Evolutionary Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-01796-9_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T15:07:42Z","timestamp":1676819262000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-01796-9_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319017952","9783319017969"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-01796-9_40","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2014]]}}}