Graph Theory for Computer Science

6Implementing Various Graph Labeling Techniques to Strengthen Cryptosystem Security

Shivapriya P.¹, K.N. Meera¹* and Said Broumi^2,3

¹Department of Mathematics, Amrita School of Engineering, Bengaluru, Amrita Vishwa Vidyapeetham, India

²Laboratory of Information Processing, Faculty of Science Ben M’Sik, University of Hassan II, Ain Chock, Casablanca, Morocco

³Regional Center for the Professions of Education and Training, Casablanca-Settat, Morocco

Abstract

The primary emphasis of the chapter is on utilizing graph labeling in cryptography to improve security and minimize the possibility of a third-party attack. Numerous researchers working in the field of graph labeling have attempted to work out this collaboration. This chapter discusses a variety of approaches engaging the graph labeling technique along with different cryptosystems. The even-odd harmonious labeling is the technique employed, in which each label assigned to vertices and edges is unique. This uniqueness in the labeling sequence improves the randomness or uncertainty of the keys. A greater degree of uncertainty in the key signifies an increased difficulty in cracking a cryptosystem. Given the importance of this factor, a brief discussion and a test on the randomness of the generated keys for a cryptosystem are conducted.

Keywords: Cryptography, EOHL, graph labeling, security

6.1 Introduction

Graph theory has increased in popularity in recent mathematical studies due to its resilience and a large range of applications ...