Efficiency of quite proof cryptosystems with megascopic distance of unicity

Abstract

For defence critically of important for the state information it is expedient to use to perfection proof cryptosystems with the ideal information the oretical firmness well-proven in theory. However existent to perfection proof cryptosystems have limit area of application, foremost, through hard limitation in relation to unexceeding during enciphering of the so-called distance of unicity after the key. The relatively small values of distance of unicity at enciphering of the reports made from the symbols of alphabet any of human languages stipulate the necessity of frequent change of key information that is a problem for many applied applications. It is shown that possibility of increase of distance of unicity is due to the synthesis of artificial language of reflection of application area with the alphabet of large dimension. Efficiency is examined to perfection proof cryptosystems of defence of text information that is placed in the set table form, on condition that this text information undertakes from to the thesaurus of beforehand certain application area. Mathematical expressions are got and corresponding graphic arts that determines dependences of distance of unicity and entropy of the code key on length of report are built. It is shown at quantitative level, that efficiency of method of construction to perfection proof cryptosystems with the large-sized alphabet of language of reflection of text information is substantially higher in comparing to efficiency of other methods of providing of the mode of perfect secrecy.