### Securing Chemical Formula Using Polyalphabetic Affine Cipher

#### Abstract

New inventions have become very common in this modern and developed society. Most of the products are based on some chemical formulas. This chemical formula helps to determine the composition of the product and every concerned individuals want this secured. With the rapid growth of information technology, and with the emergence of innovative technologies, communicating these information directly or indirectly becomes unavoidable. So secured communication of these chemical formulas is an important problem. In this paper, we construct a new algorithm in securing chemical formula by using the properties of the outer-connected dominating sets in the corona of two graphs. The proposed algorithm represents new symmetric cryptography to encrypt and decrypt chemical formula securely by converting the monoalphabetic affine cipher into a polyaphabetic cipher.

#### Full Text:

PDF#### References

Jagadeesh, K. A., Wu, D. J., Birgmeier, J. A., Boneh, D., & Bejerano, G. (2017). Deriving genomic diagnoses without revealing patient genomes. Science, 357(6352), 692-695.

Li, F., Lai, A., & Ddl, D. (2011, October). Evidence of advanced persistent threat: A case study of malware for political espionage. In 2011 6th International Conference on Malicious and Unwanted Software (pp. 102-109). IEEE.

Burton, D. M. (2006). Elementary number theory. Tata McGraw-Hill Education.

Yamuna, M., & Karthika, K. (2013). Chemical formula: encryption using graph domination and molecular biology. ChemTech, 5(6), 2747-2756.

Karbasi, A. H., & Atani, R. E. (2013). Application of dominating sets in wireless sensor networks. Int. J. Sec. Appl, 7(4).9

Ringeisen, R. D., & Roberts, F. S. (Eds.). (1988). Applications of discrete mathematics (Vol. 33).Siam.

Al Etaiwi, W. M. (2014). Encryption algorithm using graph theory. Journal of Scientific Research & Reports, 3(19), 2519-2527.

E.J. Cockayne, and S.T. Hedetniemi Towards a theory of domination in graphs, Networks, (1977)247-261.

G. Chartrand and P. Zhang. A First Course in Graph Theory, Dover Publication, Inc., New York,2012.

O. Ore. Theory of Graphs. American Mathematical Society, Provedence, R.I., 1962.

Cyman, J. (2007). The outer1 connected domination number of a graph. Australasian journal of Combinatorics, 38, 35-46.

Hashemipour, M., Hooshmandasl, M. R., & Shakiba, A. (2017). On outer-connected domination for graph products. arXiv preprint arXiv:1708.00188.

Enriquez, E., Fernandez, V., Punzalan, T., & Dayap, J. (2016). Perfect outer-connected domination in the join and corona of graphs. Recoletos Multidisciplinary Research Journal, 4(2).

Favaron, O., Karami, H., & Sheikholeslami, S. M. (2014). On the total outer-connected domination in graphs. Journal of Combinatorial Optimization, 27(3), 451-461.

Hinampas Jr, R. G., Lomarda-Hinampas, J., & Dahunan, A. R. (2017). 1-movable Independent Outer-connected Domination in Graphs. Global Journal of Pure and Applied Mathematics, 13(1),

-49.

Dayap, J. A., & Enriquez, E. L. (2019). Outer-convex Domination in the Composition and Cartesian Product of Graphs. Journal of Global Research in Mathematical Archives (JGRMA), 6(3), 34-

https://www.livescience.com/25300-periodic-table.html

### Refbacks

- There are currently no refbacks.

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

CC BY-SA