Design and Implementation of Key Distribution Algorithms of Public Key Cryptography for Group Communication in Grid Computing

  • M. Ragunathan
  • P. Vijayavel
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8891)


The group communication involves the association of various nodes to perform various tasks that depend on communication and resources sharing. In a group communication secured resource sharing should be ensured. In order to have a secured communication a simple and competent security methods are vital. The centralized authentication is required for preventing the hackers from intruding the group. To prevent the different attack in the network and to determine the effectiveness of the key management algorithms like access control polynomial are already in use. This paper proposes design and implementation of key distribution algorithm for secure communication in Grid Computing. This paper gives details of implementation of algorithms using Euclidian and prime number based key generation. The time and security analysis for group communication using the proposed algorithms have been carried out and reported.


Group communication Grid computing Projection profile Overlapping lines 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Dhanya, D., Ramakrishnan, A.G., Pati, P.B.: Script Identification in printed bilingual documents. Sadhana 27, 73–82 (2002)CrossRefGoogle Scholar
  2. 2.
    Foster, I., Kesselman, C.: The Grid: Blueprint for a new computing Infrastructure. Morgan Kaufmann, San Francisco (1999)Google Scholar
  3. 3.
    Zoua, X., Dai, Y.-S., Rana, X.: Dual-Level Key management for secure grid communication in dynamic and hierarchical groups. Future Generation Computer System 23(6), 776–786 (2007)CrossRefGoogle Scholar
  4. 4.
    Venkatesulu, M., Kartheeban, K.: Euclidian algorithm based key computation protocol for secure group communication in dynamic grid envirounment. International Journal of Grid and Distributed Computing 3(4) (December 2010)Google Scholar
  5. 5.
    Jabeenbegum, S., Purusothaman, T., Karthi, M., Balachandran, N., Arunkumar, N.: An Effective key computation protocol for secure group communication in Heterogeneous Network. International Journal of Computer Science and Network Security, 313–319 (February 2010)Google Scholar
  6. 6.
    Hwang, K., Fox, G.C., Dongarra, J.J.: Distributed and Cloud Computing. Morgan Kaufmann (2012)Google Scholar
  7. 7.
    Bellare, M., Yee, B.: Forward security in private-key cryptography. Topics in Cryptology (2003)Google Scholar
  8. 8.
    Irwin, D.E., Grit, L.E., Chase, J.S.: Balancing Risk and Reward in a Market-Based Task Service. In: Proc. 13th IEEE Int’l Symp. High Performance Distributed Computing, pp. 160–169 (2004)Google Scholar
  9. 9.
    Buyya, R., Abramson, D., Giddy, J., Stockinger, H.: Economic Models for Resource Management and Scheduling in Grid Computing. Concurrency and Computation: Practice and Experience 14, 1507–1542 (2007)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • M. Ragunathan
    • 1
  • P. Vijayavel
    • 1
  1. 1.Department of Information TechnologyV.H.N.S.N College (Autonomous)VirudhunagarIndia

Personalised recommendations