{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:58:09Z","timestamp":1725663489718},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540541950"},{"type":"electronic","value":"9783540474890"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54195-0_64","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:36:13Z","timestamp":1330209373000},"page":"354-366","source":"Crossref","is-referenced-by-count":0,"title":["Exponentiation in finite fields using dual basis multiplier"],"prefix":"10.1007","author":[{"given":"Masakatu","family":"Morii","sequence":"first","affiliation":[]},{"given":"Yuzo","family":"Takamatsu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"issue":"4","key":"31_CR1","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1109\/49.17708","volume":"7","author":"T. Beth","year":"1989","unstructured":"T. Beth and D. Gollmann: \u201cAlgorithm engineering for public key algorithms\u201d, IEEE Journal on Selected Areas in Commumn., 7, 4, pp.458\u2013466 (1989)","journal-title":"IEEE Journal on Selected Areas in Commumn."},{"issue":"6","key":"31_CR2","doi-asserted-by":"crossref","first-page":"869","DOI":"10.1109\/TIT.1982.1056591","volume":"IT-28","author":"E.R. Berlekamp","year":"1982","unstructured":"E.R. Berlekamp: \u201cBit-serial Reed-Solomon encoder\u201d, IEEE Trans., Inform. Theory, IT-28, 6, pp.869\u2013874 (1982)","journal-title":"IEEE Trans., Inform. Theory"},{"key":"31_CR3","doi-asserted-by":"crossref","unstructured":"R.J.McEliece: Finite fields for computer scientist and engineers, Kluwer Academic (1987)","DOI":"10.1007\/978-1-4613-1983-2"},{"issue":"6","key":"31_CR4","doi-asserted-by":"crossref","first-page":"1177","DOI":"10.1109\/18.45274","volume":"IT-35","author":"M. Morii","year":"1989","unstructured":"M. Morii, M. Kasahara and D.L. Whiting: \u201cEfficient bit-serial multiplication and the discrete-time Wiener-Hopf equation over finite fields\u201d, IEEE Trans., Inform. Theory, IT-35, 6, pp.1177\u20131183 (1989)","journal-title":"IEEE Trans., Inform. Theory"},{"key":"31_CR5","doi-asserted-by":"crossref","first-page":"654","DOI":"10.1137\/0109055","volume":"9","author":"H.F. Mattson","year":"1961","unstructured":"H.F. Mattson and G. Solomon: \u201cA new treatment of Bose-Chaudhuri codes\u201d, SIAM J. Appl. Math., 9 pp.654\u2013669 (1961)","journal-title":"SIAM J. Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Applied Algebra, Algebraic Algorithms and Error-Correcting Codes"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54195-0_64.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:20:17Z","timestamp":1619572817000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54195-0_64"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540541950","9783540474890"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/3-540-54195-0_64","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}