{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T03:52:10Z","timestamp":1773201130544,"version":"3.50.1"},"reference-count":21,"publisher":"Wiley","license":[{"start":{"date-parts":[[2020,10,25]],"date-time":"2020-10-25T00:00:00Z","timestamp":1603584000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Key R&D Program of China","award":["2019YFA0706402"],"award-info":[{"award-number":["2019YFA0706402"]}]},{"name":"National Key R&D Program of China","award":["2018A0303130115"],"award-info":[{"award-number":["2018A0303130115"]}]},{"DOI":"10.13039\/501100003453","name":"Natural Science Foundation of Guangdong Province","doi-asserted-by":"publisher","award":["2019YFA0706402"],"award-info":[{"award-number":["2019YFA0706402"]}],"id":[{"id":"10.13039\/501100003453","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003453","name":"Natural Science Foundation of Guangdong Province","doi-asserted-by":"publisher","award":["2018A0303130115"],"award-info":[{"award-number":["2018A0303130115"]}],"id":[{"id":"10.13039\/501100003453","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Complexity"],"published-print":{"date-parts":[[2020,10,25]]},"abstract":"<jats:p>In this paper, we present a new type of symmetric encryption by converting the classical monoalphabetic affine cipher into a polyalphabetic cipher. The proposed encryption utilizes the properties of outer-convex dominating set in the corona of graphs to generate random keys from the shared keyword to every character of the message. The new encryption eliminates the weaknesses of affine cipher, thus increasing the level of confidence for exchanging messages.<\/jats:p>","DOI":"10.1155\/2020\/8316454","type":"journal-article","created":{"date-parts":[[2020,10,26]],"date-time":"2020-10-26T19:29:50Z","timestamp":1603740590000},"page":"1-8","source":"Crossref","is-referenced-by-count":3,"title":["Outer-Convex Dominating Set in the Corona of Graphs as Encryption Key Generator"],"prefix":"10.1155","volume":"2020","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0764-4135","authenticated-orcid":true,"given":"Zehui","family":"Shao","sequence":"first","affiliation":[{"name":"Institute of Computing Science and Technology, Guangzhou University, Guangzhou 510006, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1427-5473","authenticated-orcid":true,"given":"S.","family":"Kosari","sequence":"additional","affiliation":[{"name":"Institute of Computing Science and Technology, Guangzhou University, Guangzhou 510006, China"}]},{"given":"R.","family":"Anoos","sequence":"additional","affiliation":[{"name":"Cebu Technological University, San Fernando Extension Campus,  San Fernando, Cebu, Philippines"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2298-4744","authenticated-orcid":true,"given":"S. M.","family":"Sheikholeslami","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Azarbaijan Shahid Madani University, Tabriz, Iran"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1047-1490","authenticated-orcid":true,"given":"J. A.","family":"Dayap","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Sciences, University of San Jose-Recoletos, Cebu, Philippines"}]}],"member":"311","reference":[{"key":"1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04101-3_6"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1949.tb00928.x"},{"key":"3","doi-asserted-by":"crossref","DOI":"10.1201\/b17668","volume-title":"Introduction to Modern Cryptography","author":"J. Katz","year":"2014"},{"key":"4","first-page":"16","article-title":"Unique \u03b3-set in text encryption","volume":"2","author":"M. Yamuna","year":"2015","journal-title":"Journal of Engineering and Interdisciplinary Research"},{"issue":"6","key":"5","first-page":"2747","article-title":"Chemical formula: encryption using graph domination and molecular biology","volume":"5","author":"M. Yamuna","year":"2013","journal-title":"International Journal of ChemTech Research"},{"key":"6","volume-title":"Connected Dominating Set: Theory and Applications","author":"D. Z. Du","year":"2012"},{"issue":"4","key":"7","first-page":"185","article-title":"Application of dominating sets in wireless sensor networks","volume":"7","author":"A. H. Karbasi","year":"2013","journal-title":"International Journal of Security and its Applications"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.32871\/rmrj1604.02.02"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.32871\/rmrj1604.02.03"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.22049\/CCO.2016.13544"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.32871\/rmrj1604.02.01"},{"key":"12","first-page":"6","article-title":"Securing chemical formula using polyalphabetic Affine cipher","volume":"6","author":"J. A. Dayap","year":"2019","journal-title":"Journal of Global Research in Mathematical Archives"},{"issue":"7","key":"13","first-page":"25","article-title":"Perfect outer-convex domination in graphs","volume":"3","author":"J. A. Dayap","year":"2018","journal-title":"International Journal of Latest Engineering Research and Applications"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.22049\/CCO.2020.26871.1154"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1142\/s1793830920500081"},{"key":"16","first-page":"34","article-title":"Outer-convex domination in the composition and Cartesian product of graphs","volume":"6","author":"J. A. Dayap","year":"2019","journal-title":"Journal of Global Research in Mathematical Archives"},{"key":"17","article-title":"Outer-convex domination in the corona of graphs","volume-title":"TWMS Journal of Applied and Engineering Mathematics","author":"J. A. Dayap"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.18178\/ijmlc.2019.9.3.801"},{"issue":"2","key":"19","first-page":"102","article-title":"Encryption using graph theory and linear algebra","volume":"5","author":"M. Yamuna","year":"2012","journal-title":"International Journal of Computer Applications"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.9734\/jsrr\/2014\/11804"},{"key":"21","volume-title":"A First Course in Graph Theory","author":"G. Chartrand","year":"2012"}],"container-title":["Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2020\/8316454.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2020\/8316454.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2020\/8316454.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,26]],"date-time":"2020-10-26T19:30:08Z","timestamp":1603740608000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/complexity\/2020\/8316454\/"}},"subtitle":[],"editor":[{"given":"Rosa M.","family":"Lopez Gutierrez","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2020,10,25]]},"references-count":21,"alternative-id":["8316454","8316454"],"URL":"https:\/\/doi.org\/10.1155\/2020\/8316454","relation":{},"ISSN":["1099-0526","1076-2787"],"issn-type":[{"value":"1099-0526","type":"electronic"},{"value":"1076-2787","type":"print"}],"subject":[],"published":{"date-parts":[[2020,10,25]]}}}