1Professor, Department of Computer Science and Applications, NSHM College of Management and Technology, MAKAUT, Kolkata-700053, West Bengal, India
2Student, Department of Computer Science and Applications, NSHM College of Management and Technology, MAKAUT, Kolkata-700053, West Bengal, India
(*Corresponding author) email id: *nupurc1995@gmail.com
The formalisation of speedy technical environment due to the progression in hardware technologies is consistently stimulating the terror of brute force attacks and challenging even the strongest encryption algorithms. Within this scope, the password encryption is severely impacted. In this paper, we propose a password encryption technique based on the ‘Dynamic Graph Labelling Priority Generation Technique’ and ‘Dynamic False Node Insertion Technique’. The emerged technique fits itself in the boundary of the present requisition and is flexible enough to expand its magnitude with the amplifying needs up to the boundary mark of the presented algorithm. The conception originated from the proffered algorithm can be applied to develop ultra-advance encryption algorithm.
Actual node, Dynamic insertion, Encryption, False node, Graph labelling, Priority generation technique, Shifting