Secure, Fast, and Loss-Tolerant Communication with Hill Cipher and Network Coding
Hiroshi Nishida · 2023
This paper presents a novel approach that combines a modified Hill Cipher (HC) with Random Network Coding (RNC) to achieve secure and loss-tolerant one-to-one communication. Both algorithms operate by encrypting/encoding data through a system of linear equations and decrypting/decoding it by solving these equations. However, they differ in the following features: modified HC ensures high security and RNC prevents data loss. Our approach unifies and harnesses these techniques, leveraging a high-speed Galois Field arithmetic library to expedite encryption and decryption processes. Our results show that our approach outperforms hardware-accelerated AES-256 encryption and decryption in terms of speed. Implementation of our algorithms within the QUIC protocol demonstrates significant throughput improvements in both lossy and non-lossy communication scenarios, promising higher reliability and increased speed for critical wireless communication.