{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:47:35Z","timestamp":1725536855997},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642041587"},{"type":"electronic","value":"9783642041594"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04159-4_23","type":"book-chapter","created":{"date-parts":[[2009,8,22]],"date-time":"2009-08-22T01:19:34Z","timestamp":1250903974000},"page":"361-372","source":"Crossref","is-referenced-by-count":0,"title":["Subquadratic Polynomial Multiplication over GF(2 m ) Using Trinomial Bases and Chinese Remaindering"],"prefix":"10.1007","author":[{"given":"\u00c9ric","family":"Schost","sequence":"first","affiliation":[]},{"given":"Arash","family":"Hariri","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1090\/S0025-5718-1985-0777282-X","volume":"44","author":"P.L. Montgomery","year":"1985","unstructured":"Montgomery, P.L.: Modular multiplication without trial division. Mathematics of Computation\u00a044, 519\u2013521 (1985)","journal-title":"Mathematics of Computation"},{"key":"23_CR2","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1023\/A:1008208521515","volume":"14","author":"C.K. Ko\u00e7","year":"1998","unstructured":"Ko\u00e7, C.K., Acar, T.: Montgomery multiplication in GF(2\n                    k\n                  ). Designs, Codes and Cryptography\u00a014, 57\u201369 (1998)","journal-title":"Designs, Codes and Cryptography"},{"key":"23_CR3","volume-title":"Modern computer algebra","author":"J. zur Gathen von","year":"1999","unstructured":"von zur Gathen, J., Gerhard, J.: Modern computer algebra. Cambridge University Press, Cambridge (1999)"},{"doi-asserted-by":"crossref","unstructured":"Sch\u00f6nhage, A.: Schnelle Multiplikation von Polynomen \u00fcber K\u00f6rpern der Charakteristik 2. Acta Informatica 7, 395\u2013398 (1977)","key":"23_CR4","DOI":"10.1007\/BF00289470"},{"key":"23_CR5","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/0097-3165(89)90020-4","volume":"50","author":"D.G. Cantor","year":"1989","unstructured":"Cantor, D.G.: On arithmetical algorithms over finite fields. J. Combin. Theory Ser. A\u00a050, 285\u2013300 (1989)","journal-title":"J. Combin. Theory Ser. A"},{"key":"23_CR6","doi-asserted-by":"publisher","first-page":"766","DOI":"10.1109\/12.709376","volume":"47","author":"J.C. Bajard","year":"1998","unstructured":"Bajard, J.C., Didier, L.S., Kornerup, P.: An RNS Montgomery modular multiplication algorithm. IEEE Transactions on Computers\u00a047, 766\u2013776 (1998)","journal-title":"IEEE Transactions on Computers"},{"key":"23_CR7","doi-asserted-by":"publisher","first-page":"899","DOI":"10.1090\/S0025-5718-03-01543-6","volume":"73","author":"P. McLaughlin Jr.","year":"2004","unstructured":"McLaughlin Jr., P.: New frameworks for Montgomery\u2019s modular multiplication method. Mathematics of Computation\u00a073, 899\u2013906 (2004)","journal-title":"Mathematics of Computation"},{"key":"23_CR8","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1109\/ARITH.2005.34","volume-title":"17th IEEE Symposium on Computer Arithmetic","author":"J.C. Bajard","year":"2005","unstructured":"Bajard, J.C., Imbert, L., Jullien, G.A.: Parallel Montgomery multiplication in GF(2\n                    k\n                  ) using trinomial residue arithmetic. In: 17th IEEE Symposium on Computer Arithmetic, pp. 164\u2013171. IEEE, Los Alamitos (2005)"},{"key":"23_CR9","doi-asserted-by":"publisher","first-page":"1199","DOI":"10.1090\/S0025-5718-07-01956-4","volume":"77","author":"P. Mihailescu","year":"2008","unstructured":"Mihailescu, P.: Fast convolutions meet Montgomery. Mathematics of Computation\u00a077, 1199\u20131221 (2008)","journal-title":"Mathematics of Computation"},{"key":"23_CR10","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1109\/TC.2004.52","volume":"53","author":"B. Sunar","year":"2004","unstructured":"Sunar, B.: A generalized method for constructing subquadratic complexity GF(2\n                    k\n                  ) multipliers. IEEE Transactions on Computers\u00a053, 1097\u20131105 (2004)","journal-title":"IEEE Transactions on Computers"},{"key":"23_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 new approach to subquadratic space complexity parallel multipliers for extended binary fields. IEEE Transactions on Computers\u00a056, 224\u2013233 (2007)","journal-title":"IEEE Transactions on Computers"},{"unstructured":"Giorgi, P., N\u00e8gre, C., Plantard, T.: Subquadratic binary field multiplier in double polynomial system. In: SECRYPT 2007 (2007)","key":"23_CR12"},{"key":"23_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/3-540-48059-5_24","volume-title":"Cryptographic Hardware and Embedded Systems","author":"H. Wu","year":"1999","unstructured":"Wu, H.: Low complexity bit-parallel finite field arithmetic using polynomial basis. In: Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 1999. LNCS, vol.\u00a01717, pp. 280\u2013291. Springer, Heidelberg (1999)"},{"key":"23_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/3-540-36400-5_28","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2002","author":"M. Ernst","year":"2003","unstructured":"Ernst, M., Jung, M., Madlener, F., Huss, S., Bl\u00fcmel, R.: A reconfigurable system on chip implementation for elliptic curve cryptography over GF(2\n                    n\n                  ). In: Kaliski Jr., B.S., Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 2002. LNCS, vol.\u00a02523, pp. 381\u2013399. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Selected Areas in Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04159-4_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T08:45:53Z","timestamp":1552121153000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04159-4_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642041587","9783642041594"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04159-4_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}