Secure Network Coding Based on the Integer Factorization Problem

Network coding enhances data transmission by allowing intermediary nodes to combine packets, improving efficiency and throughput. It reduces transmissions needed for reliable communication, making it effective in broadcast scenarios. This method optimizes bandwidth and boosts resilience against packet loss and network failures, ensuring data reassembly even if some packets are lost. This paper proposed secure network coding based on the integer factorization problem by combining RSA and Omura-Massey cryptosystems. The proposed model offered a highly safe and effective solution for network coding. Its strengths lay in fast encryption-decryption times, high throughput, robust security measures with dual layers of encryption to provide strong attack resistance, and balanced complexity, making it an optimal choice for enhancing network stability and performance.