The Simplified Two Generals Problem for Communication Immutability and Security Over Multiple Heterogeneous Channels

This paper is concerned with the problem of secured communication over unreliable channels without encryption. First, the authors propose the problem of two generals with relaxed condition on the number of messengers and the size of the defending army. Unlike insolvable classic counterpart, the relaxed problem has solution, and is more useful in practice. Developing ideas of the proposed problem and its solution, we consider the novel technique for secured unencrypted communications over unreliable channels. The security is achieved via various means to complicate of interception, making it more demanding for the deployed man-in-the-middle resources. The authors also discuss the program implementation of this technique via existing messenger services using Reed-Solomon codes. Additionally, the setup for model problem is considered and the experimental results are presented for the specified input message string transmitted across specified number of channels.