{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:37:11Z","timestamp":1725889031324},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319600796"},{"type":"electronic","value":"9783319600802"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-60080-2_8","type":"book-chapter","created":{"date-parts":[[2017,6,1]],"date-time":"2017-06-01T14:40:06Z","timestamp":1496328006000},"page":"99-114","source":"Crossref","is-referenced-by-count":0,"title":["The Combinatorics of Product Scanning Multiplication and Squaring"],"prefix":"10.1007","author":[{"given":"Adam L.","family":"Young","sequence":"first","affiliation":[]},{"given":"Moti","family":"Yung","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,6,2]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1147\/sj.294.0526","volume":"29","author":"P Comba","year":"1990","unstructured":"Comba, P.: Exponentiation cryptosystems on the IBM PC. IBM Syst. J. 29, 526\u2013538 (1990)","journal-title":"IBM Syst. J."},{"key":"8_CR2","unstructured":"Cook, S.A.: On the minimum computation time of functions. Ph.D. thesis, Harvard University (1966)"},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/11545262_6","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2005","author":"J Gro\u00dfsch\u00e4dl","year":"2005","unstructured":"Gro\u00dfsch\u00e4dl, J., Avanzi, R.M., Sava\u015f, E., Tillich, S.: Energy-efficient software implementation of long integer modular arithmetic. In: Rao, J.R., Sunar, B. (eds.) CHES 2005. LNCS, vol. 3659, pp. 75\u201390. Springer, Heidelberg (2005). doi:\n10.1007\/11545262_6"},{"key":"8_CR4","volume-title":"Guide to Elliptic Curve Cryptography","author":"D Hankerson","year":"2004","unstructured":"Hankerson, D., Menezes, A., Vanstone, S.: Guide to Elliptic Curve Cryptography. Springer, New York (2004)"},{"key":"8_CR5","unstructured":"Kaliski, Jr., B.S.: The Z80180 and big-number arithmetic. Dr. Dobb\u2019s J. 50\u201358, September 1993. \nhttps:\/\/www.linkedin.com\/in\/burtkaliskijr"},{"key":"8_CR6","first-page":"293","volume":"145","author":"A Karatsuba","year":"1962","unstructured":"Karatsuba, A., Ofman, Y.: Multiplication of multidigit numbers on automata. Dokl. Akad. Nauk SSSR 145, 293\u2013294 (1962)","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"8_CR7","volume-title":"Combinatorial Algorithms-Generation, Enumeration, and Search","author":"DL Kreher","year":"1999","unstructured":"Kreher, D.L., Stinson, D.R.: Combinatorial Algorithms-Generation, Enumeration, and Search. CRC Press, Boca Raton (1999)"},{"key":"8_CR8","volume-title":"Combinatorial Algorithms for Computers and Calculators","author":"A Nijenhuis","year":"1978","unstructured":"Nijenhuis, A., Wilf, H.S.: Combinatorial Algorithms for Computers and Calculators, 2nd edn. Academic Press, Inc., New York (1978)","edition":"2"},{"key":"8_CR9","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/BF02242355","volume":"7","author":"A Sch\u00f6nhage","year":"1971","unstructured":"Sch\u00f6nhage, A., Strassen, V.: Schnelle Multiplikation gro\u00dfer Zahlen. Computing 7, 281\u2013292 (1971)","journal-title":"Computing"},{"issue":"3","key":"8_CR10","first-page":"496","volume":"150","author":"AL Toom","year":"1963","unstructured":"Toom, A.L.: The complexity of a scheme of functional elements realizing the multiplication of integers. Dokl. Akad. Nauk SSSR 150(3), 496\u2013498 (1963)","journal-title":"Dokl. Akad. Nauk SSSR"},{"issue":"10","key":"8_CR11","doi-asserted-by":"crossref","first-page":"2319","DOI":"10.1073\/pnas.68.10.2319","volume":"68","author":"B Tuckerman","year":"1971","unstructured":"Tuckerman, B.: The 24th Mersenne prime. Proc. Nat. Acad. Sci. 68(10), 2319\u20132320 (1971)","journal-title":"Proc. Nat. Acad. Sci."}],"container-title":["Lecture Notes in Computer Science","Cyber Security Cryptography and Machine Learning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-60080-2_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,1]],"date-time":"2017-06-01T14:42:10Z","timestamp":1496328130000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-60080-2_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319600796","9783319600802"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-60080-2_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}