TAILIEUCHUNG - Password encryption based on dynamic graph labeling priority generation (D.G.L.P.G.) technique

In this paper we propose a password encryption technique based on the “Dynamic Graph Labeling Priority Generation (.) Technique” and “Dynamic False Node Insertion () Technique” for dynamic password. The algorithm has achieved very low space complexity and time complexity which is O(log n). 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. | Journal of Computer Science and Cybernetics, , (2016), 303–318 DOI PASSWORD ENCRYPTION BASED ON DYNAMIC GRAPH LABELING PRIORITY GENERATION (.) TECHNIQUE 1 SANJAY KUMAR PAL, 2 NUPUR CHAKRABORTY 1 Dept. of Computer Sc. and Applications, NSHM College of Management and Technology, Kolkata – 700053; sarbojay@ 2 Dept. of Computer Sc. and Applications, NSHM College of Management and Technology, Kolkata – 700053; nupurc1995@ Abstract. The formalization 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. Current security requisition can never be truly fulfilled if security system of any real world system is dependent upon only static protection mechanism. A dynamic approach must have to be adopted to integrate dynamic protection mechanism along with static protection mechanism. Within in this scope both static and dynamic password encryption mechanisms face the danger of being attacked. Here we have expressed our concern for dynamic password security system which acts as shield against Man in the Middle attacks. In this paper we propose a password encryption technique based on the “Dynamic Graph Labeling Priority Generation (.) Technique” and “Dynamic False Node Insertion () Technique” for dynamic password. The algorithm has achieved very low space complexity and time complexity which is O(log n). 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. Keywords. Encryption, graph labeling, false node, dynamic insertion, priority generation technique, actual node, dynamic password. 1. INTRODUCTION Graph labeling is the process of assignation of labels to vertices, edges or both of a graph “G”, .

• Kỹ thuật lập trình
• Dynamic False Node Insertion
• Dynamic Graph Labeling Priority Generation
• Password encryption based on dynamic graph labeling priority generation
• Priority generation technique
• Dynamic False Node Insertion