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

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]  Whitfield Diffie,et al.  New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.

[2]  Dilip D. Kandlur,et al.  Key management for secure lnternet multicast using Boolean function minimization techniques , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[3]  Sandro Rafaeli,et al.  A Decentralised Architecture for Group Key Management , 2000 .

[4]  S. Lam,et al.  Reliable group rekeying: a performance analysis , 2001, SIGCOMM '01.

[5]  Atsushi Kara,et al.  Secret Keys Multiplication for Scalable Group Re-Keying , 2003, CITA.

[6]  Celia Li,et al.  Access control in a hierarchy using one-way hash functions , 2004, Comput. Secur..