{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,8]],"date-time":"2025-01-08T05:40:37Z","timestamp":1736314837363,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540325291"},{"type":"electronic","value":"9783540325307"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11676935_53","type":"book-chapter","created":{"date-parts":[[2006,2,14]],"date-time":"2006-02-14T13:53:46Z","timestamp":1139925226000},"page":"427-436","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Linear Array for Multiplication over NIST Recommended Binary Fields"],"prefix":"10.1007","author":[{"given":"Soonhak","family":"Kwon","sequence":"first","affiliation":[]},{"given":"Taekyoung","family":"Kwon","sequence":"additional","affiliation":[]},{"given":"Young-Ho","family":"Park","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"53_CR1","unstructured":"Massy, J.L., Omura, J.K.: Computational method and apparatus for finite field arithmetic. US Patent No. 4587627 (1986)"},{"key":"53_CR2","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., Vanstone, S.A.: An implementation for a fast public key cryptosystem. J. Cryptology\u00a03, 63\u201379 (1991)","journal-title":"J. Cryptology"},{"key":"53_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/978-3-540-28632-5_6","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2004","author":"S. Kwon","year":"2004","unstructured":"Kwon, S., Gaj, K., Kim, C., Hong, C.: Efficient linear array for multiplication in GF(2 m ) using a normal basis for elliptic curve cryptography. In: Joye, M., Quisquater, J.-J. (eds.) CHES 2004. LNCS, vol.\u00a03156, pp. 76\u201391. Springer, Heidelberg (2004)"},{"key":"53_CR4","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 encoders. IEEE Trans. Inform. Theory\u00a028, 869\u2013874 (1982)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"53_CR5","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, 140\u2013148 (1990)","journal-title":"SIAM J. Disc. Math."},{"key":"53_CR6","doi-asserted-by":"publisher","first-page":"1177","DOI":"10.1109\/18.45274","volume":"35","author":"M. Morii","year":"1989","unstructured":"Morii, M., Kasahara, M., Whiting, D.L.: Efficient bit-serial multiplication and the discrete-time Wiener-Hopf equation over finite fields. IEEE Trans. Inform. Theory\u00a035, 1177\u20131183 (1989)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"53_CR7","doi-asserted-by":"crossref","unstructured":"Lee, C.Y., Lu, Y.C., Lu, E.H.: Low complexity systolic multiplier over GF(2 m ) using weakly dual basis. In: APCCAS 2002: Asia Pacific Conference on Circuits and Systems, vol.\u00a01, pp. 367\u2013372 (2002)","DOI":"10.1109\/APCCAS.2002.1114972"},{"key":"53_CR8","doi-asserted-by":"publisher","first-page":"1733","DOI":"10.1109\/18.104343","volume":"37","author":"D.R. Stinson","year":"1991","unstructured":"Stinson, D.R.: On bit-serial multiplication and dual bases in GF(2 m ). IEEE Trans. Inform. Theory\u00a037, 1733\u20131736 (1991)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"53_CR9","unstructured":"NIST, Digital Signature Standard, FIPS Publication, 186-2 (February 2000)"},{"key":"53_CR10","volume-title":"Guide to Elliptic Curve Cryptography","author":"D. Hankerson","year":"2004","unstructured":"Hankerson, D., Menezes, A.J., Vanstone, S.A.: Guide to Elliptic Curve Cryptography. Springer, Heidelberg (2004)"},{"key":"53_CR11","doi-asserted-by":"crossref","unstructured":"Song, L., Parhi, K.K.: Efficient finite field serial\/parallel multiplication. In: International Conference on Application Specific Systems, Architectures and Processors, pp. 19\u201321 (1996)","DOI":"10.1109\/ASAP.1996.542803"}],"container-title":["Lecture Notes in Computer Science","Fuzzy Logic and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11676935_53.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T18:52:00Z","timestamp":1736275920000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11676935_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540325291","9783540325307"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11676935_53","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}