{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,14]],"date-time":"2024-09-14T14:21:51Z","timestamp":1726323711332},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030340285"},{"type":"electronic","value":"9783030340292"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-34029-2_22","type":"book-chapter","created":{"date-parts":[[2019,11,13]],"date-time":"2019-11-13T22:02:40Z","timestamp":1573682560000},"page":"332-342","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Searching for Best Karatsuba Recurrences"],"prefix":"10.1007","author":[{"given":"\u00c7a\u011fda\u015f","family":"\u00c7al\u0131k","sequence":"first","affiliation":[]},{"given":"Morris","family":"Dworkin","sequence":"additional","affiliation":[]},{"given":"Nathan","family":"Dykas","sequence":"additional","affiliation":[]},{"given":"Rene","family":"Peralta","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,14]]},"reference":[{"key":"22_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/978-3-642-31662-3_12","volume-title":"Arithmetic of Finite Fields","author":"R Barbulescu","year":"2012","unstructured":"Barbulescu, R., Detrey, J., Estibals, N., Zimmermann, P.: Finding optimal formulae for bilinear maps. In: \u00d6zbudak, F., Rodr\u00edguez-Henr\u00edquez, F. (eds.) WAIFI 2012. LNCS, vol. 7369, pp. 168\u2013186. Springer, Heidelberg (2012). \nhttps:\/\/doi.org\/10.1007\/978-3-642-31662-3_12"},{"key":"22_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/978-3-642-03356-8_19","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"DJ Bernstein","year":"2009","unstructured":"Bernstein, D.J.: Batch binary Edwards. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 317\u2013336. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-03356-8_19"},{"issue":"1","key":"22_CR3","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s12095-018-0296-3","volume":"11","author":"J Boyar","year":"2018","unstructured":"Boyar, J., Find, M.G., Peralta, R.: Small low-depth circuits for cryptographic applications. Crypt. Commun. 11(1), 109\u2013127 (2018). \nhttps:\/\/doi.org\/10.1007\/s12095-018-0296-3","journal-title":"Crypt. Commun."},{"issue":"2","key":"22_CR4","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/s00145-012-9124-7","volume":"26","author":"J Boyar","year":"2013","unstructured":"Boyar, J., Matthews, P., Peralta, R.: Logic minimization techniques with applications to cryptology. J. Cryptol. 26(2), 280\u2013312 (2013)","journal-title":"J. Cryptol."},{"key":"22_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-540-79456-1_10","volume-title":"Algorithmic Number Theory","author":"RP Brent","year":"2008","unstructured":"Brent, R.P., Gaudry, P., Thom\u00e9, E., Zimmermann, P.: Faster multiplication in GF(2)[x]. In: van der Poorten, A.J., Stein, A. (eds.) ANTS 2008. LNCS, vol. 5011, pp. 153\u2013166. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-79456-1_10"},{"key":"22_CR6","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/s13389-015-0101-6","volume":"5","author":"M Cenk","year":"2015","unstructured":"Cenk, M., Hasan, M.A.: Some new results on binary polynomial multiplication. J. Cryptogr. Eng. 5, 289\u2013303 (2015)","journal-title":"J. Cryptogr. Eng."},{"key":"22_CR7","doi-asserted-by":"publisher","unstructured":"De Piccoli, A., Visconti, A., Rizzo, O.G.: Polynomial multiplication over binary finite fields: new upper bounds. J. Cryptogr. Eng. 1\u201314, April 2019. \nhttps:\/\/doi.org\/10.1007\/s13389-019-00210-w","DOI":"10.1007\/s13389-019-00210-w"},{"issue":"5","key":"22_CR8","doi-asserted-by":"publisher","first-page":"716","DOI":"10.1109\/TC.2007.1024","volume":"56","author":"H Fan","year":"2007","unstructured":"Fan, H., Hasan, M.A.: Comments on five, six, and seven-term Karatsuba-like formulae. IEEE Trans. Comput. 56(5), 716\u2013717 (2007)","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"22_CR9","doi-asserted-by":"publisher","first-page":"624","DOI":"10.1109\/TC.2018.2874662","volume":"68","author":"MG Find","year":"2018","unstructured":"Find, M.G., Peralta, R.: Better circuits for binary polynomial multiplication. IEEE Trans. Comput. 68(4), 624\u2013630 (2018). \nhttps:\/\/doi.org\/10.1109\/TC.2018.2874662","journal-title":"IEEE Trans. Comput."},{"key":"22_CR10","unstructured":"Fuhs, C., Schneider-Kamp, P.: Optimizing the AES S-box using SAT. In: Proceedings International Workshop on Implementation of Logics (IWIL), pp. 64\u201370 (2010)"},{"key":"22_CR11","first-page":"595","volume":"7","author":"AA Karatsuba","year":"1963","unstructured":"Karatsuba, A.A., Ofman, Y.: Multiplication of multidigit numbers on automata. Sov. Phys. Doklady 7, 595\u2013596 (1963)","journal-title":"Sov. Phys. Doklady"},{"issue":"3","key":"22_CR12","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1109\/TC.2005.49","volume":"54","author":"PL Montgomery","year":"2005","unstructured":"Montgomery, P.L.: Five, six, and seven-term Karatsuba-like formulae. IEEE Trans. Comput. 54(3), 362\u2013369 (2005). \nhttps:\/\/doi.org\/10.1109\/TC.2005.49\n\n. \nhttp:\/\/doi.ieeecomputersociety.org\/10.1109\/TC.2005.49","journal-title":"IEEE Trans. Comput."}],"container-title":["Lecture Notes in Computer Science","Analysis of Experimental Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-34029-2_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,13]],"date-time":"2019-11-13T22:10:30Z","timestamp":1573683030000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-34029-2_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030340285","9783030340292"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-34029-2_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"14 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SEA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Experimental Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kalamata","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wea2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.caopt.com\/SEA2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"45","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"78% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}