{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T08:46:55Z","timestamp":1743151615888,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031695827"},{"type":"electronic","value":"9783031695834"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-69583-4_5","type":"book-chapter","created":{"date-parts":[[2024,8,25]],"date-time":"2024-08-25T19:02:05Z","timestamp":1724612525000},"page":"59-73","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Minimizing I\/O in\u00a0Toom-Cook Algorithms"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-5762-9917","authenticated-orcid":false,"given":"Roy","family":"Nissim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1309-5566","authenticated-orcid":false,"given":"Oded","family":"Schwartz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-0879-2457","authenticated-orcid":false,"given":"Yuval","family":"Spiizer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,8,26]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Ahmed, M.S., Amuru, D., Abbas, Z.: ATM: approximate Toom-Cook multiplication for speech processing applications. In: 2020 IEEE International Symposium on Circuits and Systems (ISCAS). IEEE (2020)","DOI":"10.1109\/ISCAS45731.2020.9181069"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Beniamini, G., Schwartz, O.: Faster matrix multiplication via sparse decomposition. In: The 31st ACM Symposium on Parallelism in Algorithms and Architectures (2019)","DOI":"10.1145\/3323165.3323188"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Bilardi, G., De\u00a0Stefani, L.: The I\/O complexity of Toom-Cook integer multiplication. In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM (2019)","DOI":"10.1137\/1.9781611975482.123"},{"key":"5_CR4","unstructured":"Bodrato, M., Zanoni, A.: What about Toom-Cook matrices optimality. Centro \u201cVito Volterra\u201d Universit\u00e0 di Roma Tor Vergata (2006)"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Cook, S.A., Aanderaa, S.O.: On the minimum computation time of functions. Trans. Am. Math. Soc. 142, 291\u2013314 (1969)","DOI":"10.1090\/S0002-9947-1969-0249212-8"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"De\u00a0Stefani, L.: Brief announcement: on the I\/O complexity of sequential and parallel hybrid integer multiplication algorithms. In: Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures (2022)","DOI":"10.1145\/3490148.3538551"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Dutta, S., Bhattacharjee, D., Chattopadhyay, A.: Quantum circuits for Toom-Cook multiplication. Phys. Rev. A 98(1), 012311 (2018)","DOI":"10.1103\/PhysRevA.98.012311"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Enge, A.: The complexity of class polynomial computation via floating point approximations. Math. Comput. 78(266), 1089\u20131107 (2009)","DOI":"10.1090\/S0025-5718-08-02200-X"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"F\u00fcrer, M.: Faster integer multiplication. SIAM J. Comput. 39(3), 979\u20131005 (2009)","DOI":"10.1137\/070711761"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-642-15369-3_16","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"L-A Gottlieb","year":"2010","unstructured":"Gottlieb, L.-A., Neylon, T.: Matrix sparsification and the sparse null space problem. In: Serna, M., Shaltiel, R., Jansen, K., Rolim, J. (eds.) APPROX\/RANDOM -2010. LNCS, vol. 6302, pp. 205\u2013218. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15369-3_16"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Harvey, D., Van Der\u00a0Hoeven, J.: Integer multiplication in time O(n log n). Ann. Math. 193(2), 563\u2013617 (2021)","DOI":"10.4007\/annals.2021.193.2.4"},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BFb0054868","volume-title":"Algorithmic Number Theory","author":"J Hoffstein","year":"1998","unstructured":"Hoffstein, J., Pipher, J., Silverman, J.H.: NTRU: a ring-based public key cryptosystem. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol. 1423, pp. 267\u2013288. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054868"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/978-3-319-66787-4_12","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2017","author":"A H\u00fclsing","year":"2017","unstructured":"H\u00fclsing, A., Rijneveld, J., Schanck, J., Schwabe, P.: High-speed key encapsulation from NTRU. In: Fischer, W., Homma, N. (eds.) CHES 2017. LNCS, vol. 10529, pp. 232\u2013252. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66787-4_12"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Humpherys, J., Jarvis, T.J.: Foundations of Applied Mathematics: Algorithms, Approximation, Optimization. Society for Industrial and Applied Mathematics (2020)","DOI":"10.1137\/1.9781611976069"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Jahani, S., Samsudin, A., Subramanian, K.G.: Efficient big integer multiplication and squaring algorithms for cryptographic applications. J. Appl. Math. 2014, 1\u20139 (2014)","DOI":"10.1155\/2014\/107109"},{"key":"5_CR16","unstructured":"Karatsuba, A., Ofman, Y.: Multiplication of multidigit numbers on automata. Soviet Phys.-Doklady 7, 595 (1963)"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Karstadt, E., Schwartz, O.: Matrix multiplication, a little faster. J. ACM (JACM) 67(1), 1\u201331 (2020)","DOI":"10.1145\/3364504"},{"key":"5_CR18","unstructured":"Kasat, P.S., Bilaye, D.S.: Multiplication algorithms for VLSI-a review. Int. J. Comput. Sci. Eng. 4(11), 1761 (2012)"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Larasati, H.T., Awaludin, A.M., Ji, J., Kim, H.: Quantum circuit design of Toom 3-way multiplication. Appl. Sci. 11(9), 3752 (2021)","DOI":"10.3390\/app11093752"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Maji, P., Mullins, R.: On the reduction of computational complexity of deep convolutional neural networks. Entropy 20(4), 305 (2018)","DOI":"10.3390\/e20040305"},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"Mera, J.M., Karmakar, A., Verbauwhede, I.: Time-memory trade-off in Toom-Cook multiplication: an application to module-lattice based cryptography. IACR Trans. Cryptographic Hardware Embed. Syst. 2020(2), 222\u2013244 (2020)","DOI":"10.46586\/tches.v2020.i2.222-244"},{"key":"5_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/978-3-030-81293-5_13","volume-title":"Post-Quantum Cryptography","author":"DT Nguyen","year":"2021","unstructured":"Nguyen, D.T., Gaj, K.: Fast NEON-based multiplication for lattice-based NIST post-quantum cryptography finalists. In: Cheon, J.H., Tillich, J.-P. (eds.) PQCrypto 2021 2021. LNCS, vol. 12841, pp. 234\u2013254. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81293-5_13"},{"key":"5_CR23","unstructured":"Nissim, R., Schwartz, O., Spiizer, Y.: Faster Toom-Cook Algorithms via Sparse Decomposition (2024, submitted)"},{"key":"5_CR24","doi-asserted-by":"crossref","unstructured":"Rafferty, C., O\u2019Neill, M., Hanley, N.: Evaluation of large integer multiplication methods on hardware. IEEE Trans. Comput. 66(8), 1369\u20131382 (2017)","DOI":"10.1109\/TC.2017.2677426"},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"Sch\u00f6nhage, A., Strassen, V.: Schnelle multiplikation grosser zahlen. Computing 7(3), 281\u2013292 (1971)","DOI":"10.1007\/BF02242355"},{"key":"5_CR26","doi-asserted-by":"crossref","unstructured":"Schwartz, O., Vaknin, N.: Pebbling game and alternative basis for high performance matrix multiplication. SIAM J. Sci. Comput. 45(6), 281\u2013292 (2023)","DOI":"10.1137\/22M1502719"},{"key":"5_CR27","doi-asserted-by":"crossref","unstructured":"Tillmann, A.M.: On the computational intractability of exact and approximate dictionary learning. IEEE Signal Process. Lett. 22(1), 45\u201349 (2014)","DOI":"10.1109\/LSP.2014.2345761"},{"key":"5_CR28","unstructured":"Toom, A.L.: The complexity of a scheme of functional elements realizing the multiplication of integers. Soviet Math. Doklady 3, 714\u2013716 (1963)"},{"key":"5_CR29","doi-asserted-by":"crossref","unstructured":"Wang, Y., Parhi, K.: Explicit Toom-Cook algorithm for linear convolution. In: 2000 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No. 00CH37100), vol.\u00a06. IEEE (2000)","DOI":"10.1109\/ICASSP.2000.860100"},{"key":"5_CR30","doi-asserted-by":"crossref","unstructured":"Zanoni, A.: Toom-Cook 8-way for long integers multiplication. In: 2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing. IEEE (2009)","DOI":"10.1109\/SYNASC.2009.23"},{"key":"5_CR31","doi-asserted-by":"crossref","unstructured":"Zanoni, A.: Iterative Toom-Cook methods for very unbalanced long integer multiplication. In: Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation (2010)","DOI":"10.1145\/1837934.1837995"},{"key":"5_CR32","doi-asserted-by":"crossref","unstructured":"Zeydan, E., Baranda, J., Mangues-Bafalluy, J.: Post-quantum blockchain-based secure service orchestration in multi-cloud networks. IEEE Access 10, 129520\u2013129530 (2022)","DOI":"10.1109\/ACCESS.2022.3228823"},{"key":"5_CR33","doi-asserted-by":"crossref","unstructured":"Zeydan, E., Turk, Y., Aksoy, B., Ozturk, S.B.: Recent advances in post-quantum cryptography for networks: a survey. In: 2022 Seventh International Conference on Mobile and Secure Services (MobiSecServ). IEEE (2022)","DOI":"10.1109\/MobiSecServ50855.2022.9727214"},{"key":"5_CR34","unstructured":"Zuras, D.: On squaring and multiplying large integers. In: Proceedings of IEEE 11th Symposium on Computer Arithmetic. IEEE (1993)"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2024: Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-69583-4_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,25]],"date-time":"2024-08-25T19:02:43Z","timestamp":1724612563000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-69583-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031695827","9783031695834"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-69583-4_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"26 August 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Euro-Par","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"europar2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2024.euro-par.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}