Nonasymptotic estimates of information protection efficiency for the wire-tap channel concept

Abstract

In this paper we have been considered the construction of code noising for the general case of the noising main channel and for codes with finite block length. It can be proved that such a construction is equivalent to the combined use of ordinary error correction codes and codes noising for a noiseless main channel. Therefore the complexity of code noising in the general case is at most that for ordinary error correcting codes.

Simultaneously we have shown that real codes with a moderate block length give significant information protection and the losses in energy in the asymptotic case are not so very large. We emphasized that for information transmission protection for key exchanges it is a more suitable criterion to consider the real transmitted message assuming a value in the list of given size which was found during the optimal list decoding than theoretical information criteria. The examples, which are given in the paper confirm that code noising has good prospects for practical applications.