Research Article Open Access

Group Re-keying Protocol Based on Modular Polynomial Arithmetic Over Galois Field GF(2n)

Sundaram Sudha1, Azman Samsudin1 and Mohammad Ahmad Alia2
  • 1 ,
  • 2 , Afganistan
American Journal of Applied Sciences
Volume 6 No. 9, 2009, 1714-1717

DOI: https://doi.org/10.3844/ajassp.2009.1714.1717

Submitted On: 12 August 2009 Published On: 30 September 2009

How to Cite: Sudha, S., Samsudin, A. & Alia, M. A. (2009). Group Re-keying Protocol Based on Modular Polynomial Arithmetic Over Galois Field GF(2n) . American Journal of Applied Sciences, 6(9), 1714-1717. https://doi.org/10.3844/ajassp.2009.1714.1717

Abstract

Problem statement: In this study we propose a group re-keying protocol based on modular polynomial arithmetic over Galois Field GF(2n). Common secure group communications requires encryption/decryption for group re-keying process, especially when a group member is leaving the group. Approach: This study proposes secret keys multiplication protocol based on modular polynomial arithmetic (SKMP), which eliminates the need for the encryption/decryption during the group re-keying. Results: The implementation based on modular polynomial arithmetic over Galois Field GF(2n) offers fast re-keying process (about 50% faster than Secret Keys Multiplication Protocol (SKM) for 128 bit key) and compact key size representation against other secret keys multiplication protocols. With SKMP group re-keying is handled more efficiently through modular polynomial arithmetic manipulation rather than the expensive encryption/encryption which need to be done on every membership change.

  • 1,255 Views
  • 1,546 Downloads
  • 2 Citations

Download

Keywords

  • Multicast
  • group re-keying
  • public-key
  • Polynomial arithmetic
  • Galois Field GF(2n)