The Order in the Growth of the Injective and Super-Increasing Vectors Knapsacks Quantity
https://doi.org/10.18255/1818-1015-2012-3-124-135
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.
About the Author
D. M. MurinRussian Federation
аспирант, nirum87@mail.ru
References
1. Merkle R.C., Hellman M.E. Hiding information and signatures in trap-door knapsacks // IEEE Trans. Inform. Theory. 1978. V. IT-24. P. 525–530.
2. Саломаа А. Криптография с открытым ключом. М.: Мир, 1995.
Review
For citations:
Murin D.M. The Order in the Growth of the Injective and Super-Increasing Vectors Knapsacks Quantity. Modeling and Analysis of Information Systems. 2012;19(3):124-135. (In Russ.) https://doi.org/10.18255/1818-1015-2012-3-124-135