Minimum Security for Network Coding Based on Discrete Logarithm Problem
Network coding was applied to transmit information between network nodes to enhance throughput and efficiency. Security for network encryption is an interesting topic. There are some cryptosystems built on the discrete logarithm problem that can be used for security in network coding. We have studied and evaluated the possibility of combining cryptosystems together. This paper proposed minimum security solution for network coding based on the discrete logarithm problem by combining Shift cipher and EIGamal cryptosystems to increase network stability.
Authors
- Hieu Nguyen Trung (ORCID: https://orcid.org/0000-0001-6809-3360)
- Phetphachan Thammasith
Institutions
- Vietnam Posts and Telecommunications Group (Vietnam) (VN)
- Posts and Telecommunications Institute of Technology
Publication Details
- Published
- 2024-10-17
- DOI
- https://doi.org/10.1109/atc63255.2024.10908275
- Primary Topic
- Cooperative Communication and Network Coding
- Type
- article
- Field-Weighted Citation Impact
- 0.00