For example,Бобцов

ALGORITHMIC AND STATISTICAL PROPERTIES OF SPARSE KNAPSACK CRYPTOSYSTEM WITH SHARED MEMORY

Annotation

Asymptotic and algorithmic properties of sparse backpack cryptosystems, providing the packing density outside the interval (0,1), are determined in terms of basis of finite-order recurrent sequences. Design of such cryptosystems is used to construct a block cipher in blocks engagement mode. Results of analysis of speed and statistical properties of the encryption algorithm as compared to the known standards of block cipher are presented.

Keywords

Articles in current issue