A New Efficient Secure Coding Scheme for Random Linear Network Coding

Random Linear Network Coding (RLNC) is a promising technology of Network coding (NC) {that is} verified to be both sufficient and efficient. In this paper, we propose an efficient implementation of coding process, ensuring the security against active and passive attacks, in order to deploy RLNC in real networks, especially on battery constrained mobile devices with low computation capabilities such as mobile phones or sensors. We first present our flexible secure solution that can achieve simultaneously the information confidentiality, the packet integrity and the source authentication. It contains a new scheme of generation of invertible key dependent binary Global Encoding Matrix (GEM) with a complexity, a memory consumption and a decoding delay lower than the traditional $RLNC$. The effectiveness of coding process is proved by modifying the Galois field of calculation from integer (int8, int16) to binary in order to ensure low computational requirements that lead to high throughput and low energy consumption. Furthermore, theoretical and numerical results reveal that the proposed methods give an effectiveness of coding and a higher level of security compared to many recent works in this field.