{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:37:28Z","timestamp":1725514648863},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540681595"},{"type":"electronic","value":"9783540681649"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-68164-9_27","type":"book-chapter","created":{"date-parts":[[2008,5,30]],"date-time":"2008-05-30T10:48:34Z","timestamp":1212144514000},"page":"406-414","source":"Crossref","is-referenced-by-count":5,"title":["Efficient Multiplication in $\\mathbb{F}_{3^{\\ell m}}$ , m\u2009\u2265\u20091 and 5\u2009\u2264\u2009\u2113\u2009\u2264\u200918"],"prefix":"10.1007","author":[{"given":"Murat","family":"Cenk","sequence":"first","affiliation":[]},{"given":"Ferruh","family":"\u00d6zbudak","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-540-77360-3_12","volume-title":"Selected Areas in Cryptography (SAC 2007)","author":"E. Gorla","year":"2007","unstructured":"Gorla, E., Puttmann, C., Shokrollahi, J.: Explicit formulas for efficient multiplication in \n                    \n                      \n                    \n                  . In: Adams, C., Miri, A., Wiener, M. (eds.) Selected Areas in Cryptography (SAC 2007). LNCS, vol.\u00a04876, pp. 173\u2013183. Springer, Heidelberg (2007), \n                    \n                      http:\/\/www.arxiv.org\/PS_cache\/arxiv\/pdf\/0708\/0708.3014v1.pdf"},{"key":"27_CR2","unstructured":"Shokrollahi, J., Gorla, E., Puttmann, C.: Efficient FPGA-Based Multipliers for \n                    \n                      \n                    \n                   and \n                    \n                      \n                    \n                  . In: Field Programmable Logic and Applications (FPL 2007), \n                    \n                      http:\/\/www.arxiv.org\/PS_cache\/arxiv\/pdf\/0708\/0708.3022v1.pdf"},{"key":"27_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1007\/11545262_30","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2005","author":"T. Kerins","year":"2005","unstructured":"Kerins, T., Marnane, W.P., Popovici, E.M., Barreto, P.S.L.M.: Efficient hardware for the tate pairing calculation in characteristic three. In: Rao, J.R., Sunar, B. (eds.) CHES 2005. LNCS, vol.\u00a03659, pp. 412\u2013426. Springer, Heidelberg (2005)"},{"key":"27_CR4","first-page":"595","volume":"7","author":"A. Karatsuba","year":"1963","unstructured":"Karatsuba, A., Ofman, Y.: Multiplication of multidigit numbers by automata. Soviet Physics-Doklady\u00a07, 595\u2013596 (1963)","journal-title":"Soviet Physics-Doklady"},{"key":"27_CR5","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970364","volume-title":"Arithmetic Complexity of Computations","author":"S. Winograd","year":"1980","unstructured":"Winograd, S.: Arithmetic Complexity of Computations. SIAM, Philadelphia (1980)"},{"issue":"3","key":"27_CR6","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1109\/TC.2005.49","volume":"54","author":"P.L. Montgomery","year":"2005","unstructured":"Montgomery, P.L.: Five, six, and seven-term Karatsuba-like formulae. IEEE Transactions on Computers\u00a054(3), 362\u2013369 (2005)","journal-title":"IEEE Transactions on Computers"},{"issue":"5","key":"27_CR7","doi-asserted-by":"publisher","first-page":"716","DOI":"10.1109\/TC.2007.1024","volume":"56","author":"H. Fan","year":"2007","unstructured":"Fan, H., Anwar Hasan, M.: Comments on Five, Six, and Seven-Term Karatsuba-Like Formulae. IEEE Transactions on Computers\u00a056(5), 716\u2013717 (2007)","journal-title":"IEEE Transactions on Computers"},{"key":"27_CR8","unstructured":"Cenk, M., \u00d6zbudak, F.: Improved Polynomial Multiplication Formulae over \n                    \n                      \n                    \n                   Using Chinese Remainder Theorem. IEEE Transactions on Computers (submitted)"},{"key":"27_CR9","unstructured":"Weimerskirch, A., Paar, C.: Generalizations of the Karatsuba Algorithm for Polynomial Multiplication. Technical Report, Ruhr-Universit\u00e4t Bochum, Germany (2003), \n                    \n                      http:\/\/www.crypto.ruhr-uni-bochum.de\/imperia\/md\/content\/texte\/publications\/tecreports\/kaweb.pdf"},{"issue":"4","key":"27_CR10","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1109\/TIT.1983.1056705","volume":"29","author":"M.D. Wagh","year":"1983","unstructured":"Wagh, M.D., Morgera, S.D.: A new structured design method for convolutions over finite fields. Part I\u201d, IEEE Transactions on Information Theory\u00a029(4), 583\u2013594 (1983)","journal-title":"Part I\u201d, IEEE Transactions on Information Theory"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 AFRICACRYPT 2008"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68164-9_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:38:57Z","timestamp":1620016737000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68164-9_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540681595","9783540681649"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68164-9_27","relation":{},"subject":[]}}