Date Added: May 2011
Most well known group key management protocols are classified in to centralized group and distributed group. The secret shared key with the registration at key distribution center, authentication and confidentiality of the group key is achieved through processes share generation algorithm and secret reconstruction algorithm. Here, key for a group is designed using information redundancy on the data, enabling for the creation of a secured protocol. Evaluation of the Vandermonde's determinant leads to prime factorization of a composite number. These prime numbers are employed as radix numbers for cyclic code of individual keys. Parity check and checksum are combined with the cyclic code for additional security.