{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:22:36Z","timestamp":1750306956582,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":13,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,5,2]],"date-time":"2013-05-02T00:00:00Z","timestamp":1367452800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,5,2]]},"DOI":"10.1145\/2483028.2483106","type":"proceedings-article","created":{"date-parts":[[2013,5,7]],"date-time":"2013-05-07T20:51:54Z","timestamp":1367959914000},"page":"263-268","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient modulo 2\n            <sup>n<\/sup>\n            +1 multiplication for the idea block cipher"],"prefix":"10.1145","author":[{"given":"Kiamal","family":"Pekmestzi","sequence":"first","affiliation":[{"name":"National Technical University of Athens, Athens, Greece"}]},{"given":"Constantinos","family":"Efstathiou","sequence":"additional","affiliation":[{"name":"Technological Institute of Athens, Athens, Greece"}]},{"given":"Nikos","family":"Moschopoulos","sequence":"additional","affiliation":[{"name":"National Technical University of Athens, Athens, Greece"}]},{"given":"Kostas","family":"Tsoumanis","sequence":"additional","affiliation":[{"name":"National Technical University of Athens, Athens, Greece"}]}],"member":"320","published-online":{"date-parts":[[2013,5,2]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Hartung-Gorre Verlang Konstantz","author":"Lai X.","year":"1992","unstructured":"X. Lai , \"On the design and security of block ciphers\", ETH Series in Information Processing , Hartung-Gorre Verlang Konstantz , 1992 . X. Lai, \"On the design and security of block ciphers\", ETH Series in Information Processing, Hartung-Gorre Verlang Konstantz, 1992."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/4.92018"},{"key":"e_1_3_2_1_3_1","first-page":"653","volume-title":"Proc. of IEEE International Symposiums on Circuits and Systems (ISCAS)","author":"Bahrami M.","year":"2000","unstructured":"M. Bahrami and B. Sadeghiyan , \" Efficient modulo 2n+1 multiplication schemes for IDEA \", in Proc. of IEEE International Symposiums on Circuits and Systems (ISCAS) , pp. 653 -- 656 , 2000 . M. Bahrami and B. Sadeghiyan, \"Efficient modulo 2n+1 multiplication schemes for IDEA\", in Proc. of IEEE International Symposiums on Circuits and Systems (ISCAS), pp. 653--656, 2000."},{"key":"e_1_3_2_1_4_1","volume-title":"Proc. of the 2nd IEEE Int. Conference on Signals Circuits and Systems (SCS)","author":"Efstathiou C.","year":"2008","unstructured":"C. Efstathiou , I. Voyiatzis , N. Sklavos , \"On the modulo 2n+1 multiplication for diminished-1 operands \", in Proc. of the 2nd IEEE Int. Conference on Signals Circuits and Systems (SCS) , 2008 . C. Efstathiou, I. Voyiatzis, N. Sklavos, \"On the modulo 2n+1 multiplication for diminished-1 operands\", in Proc. of the 2nd IEEE Int. Conference on Signals Circuits and Systems (SCS), 2008."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1049\/iet-cds.2009.0284"},{"issue":"11","key":"e_1_3_2_1_6_1","article-title":"A novel modulo (2n+1) multiplication approach for IDEA cipher","volume":"2","author":"Mukherjee S.","year":"2010","unstructured":"S. Mukherjee , B. Sahoo , \" A novel modulo (2n+1) multiplication approach for IDEA cipher \", International Journal of Programmable Devices, Circuits and Systems , vol. 2 , no. 11 , Nov. 2010 . S. Mukherjee, B. Sahoo, \"A novel modulo (2n+1) multiplication approach for IDEA cipher\", International Journal of Programmable Devices, Circuits and Systems, vol. 2, no. 11, Nov. 2010.","journal-title":"International Journal of Programmable Devices, Circuits and Systems"},{"key":"e_1_3_2_1_7_1","first-page":"158","volume-title":"Proc. of IEEE Symp. on Computer Arithmetic","author":"Zimmermann R.","year":"1999","unstructured":"R. Zimmermann , \"Efficient VLSI implementation of modulo (2n+1) addition and multiplication \", Proc. of IEEE Symp. on Computer Arithmetic , pp. 158 -- 167 , April 1999 . R. Zimmermann, \"Efficient VLSI implementation of modulo (2n+1) addition and multiplication\", Proc. of IEEE Symp. on Computer Arithmetic, pp. 158--167, April 1999."},{"issue":"3","key":"e_1_3_2_1_8_1","first-page":"907","article-title":"Improved modulo (2n+1) Multiplier for IDEA","volume":"23","author":"Chen Y.-J.","year":"2007","unstructured":"Y.-J. Chen , D.-R. Duh , Y. S. Han , \" Improved modulo (2n+1) Multiplier for IDEA \", Journal of Information Science and Engineering , vol. 23 , no. 3 , pp. 907 -- 919 , 2007 . Y.-J. Chen, D.-R. Duh, Y. S. Han, \"Improved modulo (2n+1) Multiplier for IDEA\", Journal of Information Science and Engineering, vol. 23, no. 3, pp. 907--919, 2007.","journal-title":"Journal of Information Science and Engineering"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1049\/iet-cdt:20060026"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSD.2011.64"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEC.1960.5219822"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2010.49"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.vlsi.2008.04.004"}],"event":{"name":"GLSVLSI'13: Great Lakes Symposium on VLSI 2013","sponsor":["SIGDA ACM Special Interest Group on Design Automation","IEEE CEDA","IEEE CASS"],"location":"Paris France","acronym":"GLSVLSI'13"},"container-title":["Proceedings of the 23rd ACM international conference on Great lakes symposium on VLSI"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2483028.2483106","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2483028.2483106","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:39:06Z","timestamp":1750235946000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2483028.2483106"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5,2]]},"references-count":13,"alternative-id":["10.1145\/2483028.2483106","10.1145\/2483028"],"URL":"https:\/\/doi.org\/10.1145\/2483028.2483106","relation":{},"subject":[],"published":{"date-parts":[[2013,5,2]]},"assertion":[{"value":"2013-05-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}