For example,Бобцов

SYMMETRICAL CRYPTOGRAPHIC SYSTEM WITH A SHARED MEMORY BASED ON RECURRENT BASES IN THE TASK OF KNAPSACK PACKING

Annotation

In terms of the bases of return sequences and their corresponding signatures for the backpacking problem, a class of binary return bases characterized by a slower growth compared to the binary ones is distinguished. The inclusion of bases in this class provides a departure from attack of reduction of the basis of Koester—Lagarias—Odlyzko and gives a packing density outside the interval (0,1). The constructions of such bases are employed to develope a symmetric block encryption algorithm that uses shared memory of sender and recipient in Shannon model of secret communication. The algorithm also uses the chaining mode of the ciphertext blocks and generates the corresponding hash function. An additive protocol for creating a symmetric key is given.

Keywords

Articles in current issue