|
Modelirovanie i Analiz Informatsionnykh Sistem, 2012, Volume 19, Number 3, Pages 124–135
(Mi mais235)
|
|
|
|
This article is cited in 2 scientific papers (total in 2 papers)
The Order in the Growth of the Injective and Super-Increasing Vectors Knapsacks Quantity
D. M. Murin P. G. Demidov Yaroslavl State University
Abstract:
In $1978$ R. Mercle and M. Hellman offered to use the subset sum problem for constructing cryptographic systems. The proposed cryptosystems were based on a class of the knapsacks with super-increasing vectors. This class is a subset of the set of knapsacks with injective (cryptographic) vectors that allow the single-valued decoding (decryption) result. In this paper we consider the problems related to the order in the growth of the injective vectors knapsacks quantity and to the order in the growth of knapsacks quantity with the super-increasing vectors through the knapsack maximal element increasing.
Keywords:
injective vectors, super-increasing vectors, computer algebra.
Received: 06.11.2011
Citation:
D. M. Murin, “The Order in the Growth of the Injective and Super-Increasing Vectors Knapsacks Quantity”, Model. Anal. Inform. Sist., 19:3 (2012), 124–135
Linking options:
https://www.mathnet.ru/eng/mais235 https://www.mathnet.ru/eng/mais/v19/i3/p124
|
Statistics & downloads: |
Abstract page: | 284 | Full-text PDF : | 155 | References: | 41 |
|