{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T16:35:35Z","timestamp":1726072535037},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030431198"},{"type":"electronic","value":"9783030431204"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-43120-4_19","type":"book-chapter","created":{"date-parts":[[2020,3,17]],"date-time":"2020-03-17T20:13:56Z","timestamp":1584476036000},"page":"249-269","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Exploiting Linearity of Modular Multiplication"],"prefix":"10.1007","author":[{"given":"Hamdi Murat","family":"Y\u0131ld\u0131r\u0131m","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,3,18]]},"reference":[{"issue":"5","key":"19_CR1","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1049\/iet-cdt:20060059","volume":"1","author":"R Chaves","year":"2007","unstructured":"Chaves, R., Sousa, L.: Improving residue number system multiplication with more balanced moduli sets and enhanced modular arithmetic structures. IET Comput. Digital Tech. 1(5), 472\u2013480 (2007)","journal-title":"IET Comput. Digital Tech."},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/3-540-48329-2_20","volume-title":"Advances in Cryptology \u2014 CRYPTO 1993","author":"J Daemen","year":"1994","unstructured":"Daemen, J., Govaerts, R., Vandewalle, J.: Weak keys for IDEA. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 224\u2013231. Springer, Heidelberg (1994). \nhttps:\/\/doi.org\/10.1007\/3-540-48329-2_20"},{"key":"19_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-642-03317-9_17","volume-title":"Fast Software Encryption","author":"P Junod","year":"2009","unstructured":"Junod, P., Macchetti, M.: Revisiting the IDEA philosophy. In: Dunkelman, O. (ed.) FSE 2009. LNCS, vol. 5665, pp. 277\u2013295. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-03317-9_17"},{"key":"19_CR4","series-title":"ETH Series in Information Processing","volume-title":"On the Design and Security of Block Cipher","author":"X Lai","year":"1992","unstructured":"Lai, X.: On the Design and Security of Block Cipher. ETH Series in Information Processing, vol. 1. Hartung-Gorre Verlag, Konstanz (1992)"},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/3-540-48285-7_32","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 1993","author":"W Meier","year":"1994","unstructured":"Meier, W.: On the security of the IDEA block cipher. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 371\u2013385. Springer, Heidelberg (1994). \nhttps:\/\/doi.org\/10.1007\/3-540-48285-7_32"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Modugu, R., Choi, M., Park, N.: A fast low-power modulo $$2^n+ 1$$ multiplier design. In: IEEE Instrumentation and Measurement Technology Conference, I2MTC 2009, pp. 951\u2013956. IEEE (2009)","DOI":"10.1109\/IMTC.2009.5168589"},{"key":"19_CR7","unstructured":"Nakahara Jr., J.: Personal communication, November 2004"},{"key":"19_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-68273-0","volume-title":"Lai-Massey Cipher Designs: History","author":"J Nakahara Jr","year":"2018","unstructured":"Nakahara Jr., J.: Lai-Massey Cipher Designs: History. Design Criteria and Cryptanalysis. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-68273-0"},{"key":"19_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1007\/978-3-540-24591-9_34","volume-title":"Information Security Applications","author":"J Nakahara Jr","year":"2004","unstructured":"Nakahara Jr., J., Rijmen, V., Preneel, B., Vandewalle, J.: The MESH block ciphers. In: Chae, K.-J., Yung, M. (eds.) WISA 2003. LNCS, vol. 2908, pp. 458\u2013473. Springer, Heidelberg (2004). \nhttps:\/\/doi.org\/10.1007\/978-3-540-24591-9_34"},{"key":"19_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/3-540-47555-9_8","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 1992","author":"K Nyberg","year":"1993","unstructured":"Nyberg, K.: On the construction of highly nonlinear permutations. In: Rueppel, R.A. (ed.) EUROCRYPT 1992. LNCS, vol. 658, pp. 92\u201398. Springer, Heidelberg (1993). \nhttps:\/\/doi.org\/10.1007\/3-540-47555-9_8"},{"key":"19_CR11","unstructured":"SageMath, the Sage Mathematics Software System (Version 6.7). The Sage Developers (2015). \nhttp:\/\/www.sagemath.org"},{"key":"19_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/978-3-540-24582-7_5","volume-title":"Progress in Cryptology - INDOCRYPT 2003","author":"HM Y\u0131ld\u0131r\u0131m","year":"2003","unstructured":"Y\u0131ld\u0131r\u0131m, H.M.: Nonlinearity properties of the mixing operations of the block cipher IDEA. In: Johansson, T., Maitra, S. (eds.) INDOCRYPT 2003. LNCS, vol. 2904, pp. 68\u201381. Springer, Heidelberg (2003). \nhttps:\/\/doi.org\/10.1007\/978-3-540-24582-7_5"},{"key":"19_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/BFb0028472","volume-title":"Information and Communications Security","author":"X-M Zhang","year":"1997","unstructured":"Zhang, X.-M., Zheng, Y., Imai, H.: Duality of Boolean functions and its cryptographic significance. In: Han, Y., Okamoto, T., Qing, S. (eds.) ICICS 1997. LNCS, vol. 1334, pp. 159\u2013169. Springer, Heidelberg (1997). \nhttps:\/\/doi.org\/10.1007\/BFb0028472"}],"container-title":["Lecture Notes in Computer Science","Mathematical Aspects of Computer and Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-43120-4_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,17]],"date-time":"2020-03-17T20:14:48Z","timestamp":1584476088000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-43120-4_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030431198","9783030431204"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-43120-4_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"18 March 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MACIS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Mathematical Aspects of Computer and Information Sciences","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Gebze","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Turkey","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":"13 November 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 November 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icmacis2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/macis2019.gtu.edu.tr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"66","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":"22","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":"14","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":"33% - 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,1","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":"5,8","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}