{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T11:54:39Z","timestamp":1759146879176},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540414551"},{"type":"electronic","value":"9783540444992"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44499-8_21","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T10:14:13Z","timestamp":1188296053000},"page":"264-276","source":"Crossref","is-referenced-by-count":6,"title":["Montgomery Multiplier and Squarer in GF(2m)"],"prefix":"10.1007","author":[{"given":"Huapeng","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,1,29]]},"reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1023\/A:1008208521515","volume":"14","author":"C. K. Koc","year":"1998","unstructured":"C. K. Koc and T. Acar. Montgomery multiplication in GF(2k). Designs, Codes and Cryptography, 14:57\u201369, 1998.","journal-title":"Designs, Codes and Cryptography"},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"519","DOI":"10.2307\/2007970","volume":"44","author":"P. L. Montgomery","year":"1985","unstructured":"P. L. Montgomery. Modular multiplication without trial division. Mathematics of Computation, 44:519\u2013521, 1985.","journal-title":"Mathematics of Computation"},{"issue":"5","key":"21_CR3","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1109\/12.769434","volume":"48","author":"B. Sunar","year":"1999","unstructured":"B. Sunar and C. K. Koc. Mastrovito multiplier for all trinomials. IEEE Trans. Comput., 48(5):522\u2013527, 1999.","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"21_CR4","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1137\/0403012","volume":"3","author":"M. Wang","year":"1990","unstructured":"M. Wang and I. F. Blake. Bit serial multiplication in finite fields. SIAM Discrete Mathematics, 3(1):140\u2013148, 1990.","journal-title":"SIAM Discrete Mathematics"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"H. Wu. Low-complexity arithmetic in finite field using polynomial basis. In CHES\u201999, pages 357\u2013371. Springer-Verlag, 1999.","DOI":"10.1007\/3-540-48059-5_24"},{"issue":"11","key":"21_CR6","doi-asserted-by":"publisher","first-page":"1223","DOI":"10.1109\/12.736433","volume":"47","author":"H. Wu","year":"1998","unstructured":"H. Wu, M. A. Hasan, and I. F. Blake. Low complexity weakly dual basis bit-parallel multiplier over finite fields. IEEE Trans. Comput., 47(11):1223\u20131234, November 1998.","journal-title":"IEEE Trans. Comput"}],"container-title":["Lecture Notes in Computer Science","Cryptographic Hardware and Embedded Systems \u2014 CHES 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44499-8_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,13]],"date-time":"2023-05-13T19:01:33Z","timestamp":1684004493000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44499-8_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540414551","9783540444992"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-44499-8_21","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}