Outer-Convex Dominating Set in the Corona of Graphs as Encryption Key Generator
暂无分享,去创建一个
[1] Jonecis Dayap,et al. Inverse Clique Domination in Graphs , 2017 .
[2] Jonecis Dayap,et al. Perfect Outer-connected Domination in the Join and Corona of Graphs , 2017 .
[3] Christof Paar,et al. Introduction to Public-Key Cryptography , 2010 .
[4] Claude E. Shannon,et al. Communication theory of secrecy systems , 1949, Bell Syst. Tech. J..
[5] Wael Etaiwi. Encryption Algorithm Using Graph Theory , 2014 .
[6] Jonecis Dayap,et al. Outer-weakly convex domination number of graphs , 2020 .
[7] Jonecis Dayap,et al. Disjoint Secure Domination in the Join of Graphs , 2017 .
[8] Ni Ni Hla,et al. A Complex Transformation of Monoalphabetic Cipher to Polyalphabetic Cipher: (Vigenère-Affine Cipher) , 2019, International Journal of Machine Learning and Computing.
[9] Seyed Mahmoud Sheikholeslami,et al. The convex domination subdivision number of a graph , 2016 .
[10] Jonecis Dayap,et al. Outer-convex domination in graphs , 2020, Discret. Math. Algorithms Appl..