Concept for Using Permutation-Based Three-Pass Cryptographic Protocol in Noisy Channels

Abstract

The study develops a concept for providing secure information interaction that will apply the permutation-based three-pass cryptographic protocol under the conditions of strong noise in the communication channel. The research substantiates the procedure based on majority and correlation processing of fragments received from the communication channel having a length equal to the permutation length to synchronize frames (permutations) under the conditions of strong noise. The findings suggest that reliable permutation transmission under the conditions of strong noise in the data communication channel can be ensured by the method that uses circular bit shifts of another permutation with the maximum value of the minimum Hamming distance to all its circular shifts as symbols for the permutation to be transmitted. Constructing an ensemble of messages (permutations) has been achieved by using affine and projective general linear groups. An algorithm for building and storing ensembles of messages has been developed. This approach enabled generating network and session keys during data exchange in addition to providing the required code distance for permutation codelists (arrays). Further analysis has proved that the proposed codewords generation scheme can also be effectively applied for non-separable factorial data coding, for instance, when providing informational interaction of objects with a dynamically changing structure.