The problem is considered of evaluating the probability of successful slipping furtively a false message by an outer observer (called also illegal user) who has access to input and output of the coder and knows several observations of the code i. e. pairs consisting of messages and corresponding cryptograms. It is proved that the probability of successful slipping furtively a false message is limited from below, and the lower boundary of this limitation has been found.
|Translated title of the contribution||Codes capable of detecting an illegal exchange of messages (analysis)|
|Number of pages||17|
|Publication status||Published - 1980|