{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:08:01Z","timestamp":1742911681914,"version":"3.40.3"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319232065"},{"type":"electronic","value":"9783319232072"}],"license":[{"start":{"date-parts":[[2015,9,4]],"date-time":"2015-09-04T00:00:00Z","timestamp":1441324800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,9,4]],"date-time":"2015-09-04T00:00:00Z","timestamp":1441324800000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-23207-2_20","type":"book-chapter","created":{"date-parts":[[2015,9,3]],"date-time":"2015-09-03T07:37:30Z","timestamp":1441265850000},"page":"201-207","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Problems on Gaussian Normal Basis Multiplication for Elliptic Curve Cryptosystem"],"prefix":"10.1007","author":[{"given":"C. W.","family":"Chiou","sequence":"first","affiliation":[]},{"given":"Y.-S.","family":"Sun","sequence":"additional","affiliation":[]},{"given":"C.-M.","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Y.-L.","family":"Chiu","sequence":"additional","affiliation":[]},{"given":"J.-M.","family":"Lin","sequence":"additional","affiliation":[]},{"given":"C.-Y.","family":"Lee","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,9,4]]},"reference":[{"key":"20_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":"VS Miller","year":"1986","unstructured":"Miller, V.S.: Use of elliptic curves in cryptography. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 417\u2013426. Springer, Heidelberg (1986)"},{"key":"20_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 48, 203\u2013209 (1987)","journal-title":"Mathematics of Computation"},{"issue":"3","key":"20_CR3","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1137\/S0097539701398521","volume":"32","author":"D Boneh","year":"2003","unstructured":"Boneh, D., Franklin, M.K.: Identity-based encryption from the weil pairing. SIAM Journal on Computing 32(3), 586\u2013615 (2003)","journal-title":"SIAM Journal on Computing"},{"key":"20_CR4","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"RL Rivest","year":"1978","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM 21, 120\u2013126 (1978)","journal-title":"Communications of the ACM"},{"key":"20_CR5","unstructured":"IEEE Standard 1363\u20132000: IEEE standard specifications for public-key cryptography (January 2000)"},{"key":"20_CR6","unstructured":"ANSI X9.62-2005: Public Key Cryptography for the Financial Services Industry: The Elliptic Curve Digital Signature Algorithm (ECDSA). American National Standards Institute (ANSI) (November 2005)"},{"key":"20_CR7","first-page":"79","volume":"6","author":"TC Bartee","year":"1963","unstructured":"Bartee, T.C., Schneider, D.J.: Computation with finite fields. Information and Computing 6, 79\u201398 (1963)","journal-title":"Information and Computing"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Mastrovito, E.D.: VLSI architectures for multiplication over finite field $$GF(2^{m})$$. Applied algebra, algebraic algorithms, and error-correcting codes. In: Mora, T. (ed.) Proc. Sixth Int\u2019l Conf., AAECC-6, Rome, pp. 297\u2013309, July 1988","DOI":"10.1007\/3-540-51083-4_67"},{"issue":"3","key":"20_CR9","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1109\/12.660172","volume":"47","author":"\u00c7K 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 47(3), 353\u2013356 (1998)","journal-title":"IEEE Trans. Computers"},{"key":"20_CR10","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(2^{m})$$. Information and Computation 83, 21\u201340 (1989)","journal-title":"Information and Computation"},{"issue":"11","key":"20_CR11","doi-asserted-by":"publisher","first-page":"3115","DOI":"10.1109\/TCSI.2014.2335031","volume":"61","author":"C-Y Lee","year":"2014","unstructured":"Lee, C.-Y., Yang, C.-S., Meher, B.K., Meher, P.K., Pan, J.-S.: Low-complexity digit-serial and scalable SPB\/GPB multipliers over large binary extension fields using $$(b,2)$$-way Karatsuba decomposition. IEEE Trans. Circuits and Systems-I: Regular Papers 61(11), 3115\u20133124 (2014)","journal-title":"IEEE Trans. Circuits and Systems-I: Regular Papers"},{"issue":"2","key":"20_CR12","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 bina-ry fields. IEEE Trans. Computers 56(2), 224\u2013233 (2007)","journal-title":"IEEE Trans. Computers"},{"issue":"3","key":"20_CR13","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^{m})$$. IET Information Security 5(3), 152\u2013162 (2011)","journal-title":"IET Information Security"},{"issue":"2","key":"20_CR14","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1109\/TVLSI.2012.2185257","volume":"21","author":"J Xie","year":"2013","unstructured":"Xie, J., He, J.J., Meher, P.K.: Low latency systolic Montgomery multiplier for finite field $$GF(2^{m})$$ based on pentanomials. IEEE Trans. VLSI Systems 21(2), 385\u2013389 (2013)","journal-title":"IEEE Trans. VLSI Systems"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"Lee, C.-Y., Meher, P.K., Lee, W.-Y.: Subquadratic space complexity digit-serial multiplier over binary extension fields using Toom-Cook algorithm. In: Proc. of 2014 International Symposium on Integrated Circuits (ISIC), Singapore, pp. 176\u2013179, December 10\u201312, 2014","DOI":"10.1109\/ISICIR.2014.7029517"},{"key":"20_CR16","doi-asserted-by":"publisher","first-page":"869","DOI":"10.1109\/TIT.1982.1056591","volume":"IT\u201328","author":"ER Berlekamp","year":"1982","unstructured":"Berlekamp, E.R.: Bit-serial reed-solomon encoder. IEEE Trans. Inf. Theory IT\u201328, 869\u2013874 (1982)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"11","key":"20_CR17","doi-asserted-by":"publisher","first-page":"1223","DOI":"10.1109\/12.736433","volume":"47","author":"H Wu","year":"1998","unstructured":"Wu, H., Hasan, M.A., Blake, I.F.: New low-complexity bit-parallel finite field multipliers using weakly dual bases. IEEE Trans. Computers 47(11), 1223\u20131234 (1998)","journal-title":"IEEE Trans. Computers"},{"issue":"1","key":"20_CR18","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. 3(1), 140\u2013148 (1990)","journal-title":"SIAM J. Disc. Math."},{"issue":"4","key":"20_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(2^{m})$$. IET Information Security 6(4), 324\u2013328 (2012)","journal-title":"IET Information Security"},{"issue":"2","key":"20_CR20","first-page":"80","volume":"23","author":"YY 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 Karatsuba multiplier over $$GF(2^{m})$$. Journal of Computers 23(2), 80\u201394 (2012)","journal-title":"Journal of Computers"},{"issue":"5","key":"20_CR21","doi-asserted-by":"publisher","first-page":"1169","DOI":"10.1109\/TC.2012.239","volume":"63","author":"J-S Pan","year":"2014","unstructured":"Pan, J.-S., Azarderakhsh, R., Kermani, M.M., Lee, C.-Y., Lee, W.-Y., Chiou, C.W., Lin, J.-M.: Low-latency digit-serial systolic double basis multiplier over $$GF(2^{m})$$ using subquadratic Toeplitz matrix-vector product approach. IEEE Trans. Computers 63(5), 1169\u20131181 (2014)","journal-title":"IEEE Trans. Computers"},{"key":"20_CR22","unstructured":"Massey, J.L., Omura, J.K.: Computational method and apparatus for finite field arithmetic. U.S. Patent Number 4,587,627 (May 1986)"},{"issue":"8","key":"20_CR23","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1109\/TC.1985.1676616","volume":"C\u201334","author":"CC Wang","year":"1985","unstructured":"Wang, C.C., Troung, T.K., Shao, H.M., Deutsch, L.J., Omura, J.K., Reed, I.S.: VLSI architectures for computing multiplications and inverses in $$GF(2^{m})$$. IEEE Trans. Computers C\u201334(8), 709\u2013717 (1985)","journal-title":"IEEE Trans. Computers"},{"issue":"1","key":"20_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 55(1), 34\u201347 (2006)","journal-title":"IEEE Trans. Computers"},{"key":"20_CR25","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.M., Vanstone, S.A.: An implementation for a fast public-key cryptosystem. Journal of Cryptology 3, 63\u201379 (1991)","journal-title":"Journal of Cryptology"},{"issue":"10","key":"20_CR26","doi-asserted-by":"publisher","first-page":"1278","DOI":"10.1109\/12.257715","volume":"42","author":"MA 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 42(10), 1278\u20131280 (1993)","journal-title":"IEEE Trans. Computers"},{"key":"20_CR27","unstructured":"Kwon, S.: A low complexity and a low latency bit parallel systolic multiplier over $$GF(2^{m})$$ 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, June 15\u201318, 2003"},{"issue":"10","key":"20_CR28","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 56(10), 1435\u20131437 (2007)","journal-title":"IEEE Trans. Computers"},{"issue":"2","key":"20_CR29","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(2^{m})$$ using Hankel matrix-vector representation. Journal of Signal Processing Systems for Signal Image and Video Technology 69(2), 197\u2013211 (2012)","journal-title":"Journal of Signal Processing Systems for Signal Image and Video Technology"},{"issue":"4","key":"20_CR30","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1049\/iet-ifs.2012.0200","volume":"6","author":"CW 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(2^{m})$$ with odd type-t. IET Information Security 6(4), 318\u2013323 (2012)","journal-title":"IET Information Security"},{"issue":"4","key":"20_CR31","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1049\/iet-ifs.2012.0110","volume":"6","author":"CW 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^{m})$$. IET Information Security 6(4), 310\u2013317 (2012)","journal-title":"IET Information Security"},{"issue":"4","key":"20_CR32","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 62(4), 744\u2013757 (2013)","journal-title":"IEEE Trans. Computers"},{"key":"20_CR33","doi-asserted-by":"crossref","unstructured":"Yang, C.-S., Pan, J.-S., Lee, C.-Y.: Digit-serial GNB multiplier based on TMVP approach over $$GF(2^{m})$$. In: Proc. of 2013 Second International Conference on Robot, Vision and Signal Processing, Kitakyushu, Japan, pp. 123\u2013128, December 10\u201312, 2013","DOI":"10.1109\/RVSP.2013.35"},{"issue":"6","key":"20_CR34","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1109\/TC.2008.226","volume":"58","author":"CW Chiou","year":"2009","unstructured":"Chiou, C.W., Chang, C.-C., Lee, C.-Y., Hou, T.-W., Lin, J.-M.: Concurrent Error detection and Correction in Gaussian Normal Basis Multiplier over $$GF(2^{m})$$. IEEE Trans. Computers 58(6), 851\u2013857 (2009)","journal-title":"IEEE Trans. Computers"},{"key":"20_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/3-540-44709-1_15","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2001","author":"M Leone","year":"2001","unstructured":"Leone, M.: A new low complexity parallel multiplier for a class of finite fields. In: Ko\u00e7, \u00c7.K., Naccache, D., Paar, C. (eds.) CHES 2001. LNCS, vol. 2162, pp. 160\u2013170. Springer, Heidelberg (2001)"},{"key":"20_CR36","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0166-218X(89)90001-2","volume":"25","author":"DW Ash","year":"1989","unstructured":"Ash, D.W., Blake, I.F., Vanstone, S.A.: Low complexity normal bases. Discrete Applied Math. 25, 191\u2013210 (1989)","journal-title":"Discrete Applied Math."},{"key":"20_CR37","unstructured":"FIPS 186\u20132: Digital Signature Standard (DSS). Federal Information Processing Standards Publication 186\u20132, Nat\u2019l Inst. of Standards and Technology (2000)"},{"key":"20_CR38","unstructured":"ISO\/IEC 11770\u20133:2008: Information technology - Security techniques - Key management - Part 3: Mechanisms using asymmetric techniques (2008)"}],"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-23207-2_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T15:20:15Z","timestamp":1676474415000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-23207-2_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,4]]},"ISBN":["9783319232065","9783319232072"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23207-2_20","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2015,9,4]]},"assertion":[{"value":"4 September 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}