 |
This research proposed a key distribution scheme based on (𝒑,𝒒)-Lucas polynomial and XOR to achieve lightweight, memory overhead efficiency and security.
Lucas polynomials can produce odd-degree or even-degree polynomials. This condition causes a decrease in computational complexity compared to using a normal polynomial. Applying the XOR operation does not change the length of the keying information until the group key is reached. Thus, the combination of (p,q)-Lucas polynomial and XOR operation make this scheme lightweight.
Our research proposed a single group key for each group communication to reduce the number of keys that SN must store. Thus, any number of SNs in a group does not change the number of keys the SN must keep.
Moreover, the motivation for using (p,q)-Lucas polynomial is that the polynomial can form any degree in any base number q [29], so that it can reduce the probability of an attacker guessing the used polynomial. In addition, we prove that our scheme supports forward and backward secrecy.
|
IEEE/ICACT20230044 Slide.04
[Big Slide]
[YouTube]