DOI 10.17586/0021-3454-2019-62-4-320-330
UDC 003.26
SYMMETRICAL CRYPTOGRAPHIC SYSTEM WITH A SHARED MEMORY BASED ON RECURRENT BASES IN THE TASK OF KNAPSACK PACKING
Vladimir State University, Department of Informatics and Information Security;
I. I. Sorokin
Vladimir State University, Department of Informatics and Information Security;
Read the full article
Abstract. 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: shared memory, knapsack packing problem, sparse knapsacks, Koester—Lagarias—Odlyzko packing density, block cipher with block engagement mode, hash function, cryptographic protocol
References:
References:
- Aleksandrov А.V., Metlinov А.D. Journal of Instrument Engineering, 2015, no. 5(58), pp. 344–350. (in Russ.)
- Hamlin N., Krishnamoorthy B., and Webb W. Fibonacci Quarterly, 2015, no. 1(53), pp. 24–33.
- Markushevich A.I. Vozvratnyye posledovatel'nosti (Return Sequences), Moscow, 1983, 48 р. (in Russ.)
- Merkle D.R., Hellman M. Information Theory, IEEE Transactions, 1978, рp. 525–530.
- Hamlin N. Open Journal of Discrete Mathematics, 2017, no. 7, pp. 13–31.
- Aleksandrov А.V., Metlinov А.D. Journal of Instrument Engineering, 2017, no. 1(60), pp. 5-9.
- Aleksandrov А.V. Dynamics of Complex Systems – XXI century, 2016, no. 4(10), pp. 71–77. (in Russ.)
- Coster M.J., Joux A., LaMacchia B.A. et al. Computational Complexity, 1992, no. 2, pp. 111–128.
- Murin D.M. Prikladnaya Diskretnaya Matematika, 2013, no. 2(20), pp. 91–100. (in Russ.)
- Marden M. Geometry of Polynomials. Providence, RI: American Mathematical Society, 1966, 243 p.
- Cheremushkin A.V. Kriptograficheskiye protokoly. Osnovnyye svoystva i uyazvimosti (Cryptographic Protocols. Key Features and Vulnerabilities), Moscow, 2009, 272 р. (in Russ.)
- Dolev D., Yao A. IEEE Transact on Information Theory, 1983, no. 2(29), pp. 198–208.
- Metlinov A.D. Journal of Instrument Engineering, 2018, no. 1(61), pp. 60–64. (in Russ.)
