The Order in the Growth of the Injective and Super-Increasing Vectors Knapsacks Quantity

The Order in the Growth of the Injective and Super-Increasing Vectors Knapsacks Quantity

Show other versions (1)

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 a...

Full description

Bibliographic Details
Main Author: D. M. Murin
Format: Article
Language:English
Published: Yaroslavl State University 2015-02-01
Series:Modelirovanie i Analiz Informacionnyh Sistem
Subjects:
injective vectors
super-increasing vectors
computer algebra
Online Access:https://www.mais-journal.ru/jour/article/view/34
id doaj-de92adcaebf5480c97b732e3cc29988a
record_format Article
spelling doaj-de92adcaebf5480c97b732e3cc29988a2021-07-29T08:15:20ZengYaroslavl State UniversityModelirovanie i Analiz Informacionnyh Sistem1818-10152313-54172015-02-0119312413510.18255/1818-1015-2012-3-124-13528The Order in the Growth of the Injective and Super-Increasing Vectors Knapsacks QuantityD. M. Murin0Ярославский государственный университет им. П.Г. Демидова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.https://www.mais-journal.ru/jour/article/view/34injective vectorssuper-increasing vectorscomputer algebra
collection DOAJ
language English
format Article
sources DOAJ
author D. M. Murin
spellingShingle D. M. Murin
The Order in the Growth of the Injective and Super-Increasing Vectors Knapsacks Quantity
Modelirovanie i Analiz Informacionnyh Sistem
injective vectors
super-increasing vectors
computer algebra
author_facet D. M. Murin
author_sort D. M. Murin
title The Order in the Growth of the Injective and Super-Increasing Vectors Knapsacks Quantity
title_short The Order in the Growth of the Injective and Super-Increasing Vectors Knapsacks Quantity
title_full The Order in the Growth of the Injective and Super-Increasing Vectors Knapsacks Quantity
title_fullStr The Order in the Growth of the Injective and Super-Increasing Vectors Knapsacks Quantity
title_full_unstemmed The Order in the Growth of the Injective and Super-Increasing Vectors Knapsacks Quantity
title_sort order in the growth of the injective and super-increasing vectors knapsacks quantity
publisher Yaroslavl State University
series Modelirovanie i Analiz Informacionnyh Sistem
issn 1818-1015
2313-5417
publishDate 2015-02-01
description 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.
topic injective vectors
super-increasing vectors
computer algebra
url https://www.mais-journal.ru/jour/article/view/34
work_keys_str_mv AT dmmurin theorderinthegrowthoftheinjectiveandsuperincreasingvectorsknapsacksquantity
AT dmmurin orderinthegrowthoftheinjectiveandsuperincreasingvectorsknapsacksquantity
_version_ 1721256519778959360

Similar Items