Information protection systems based on universal knapsack problem
V. O. Osipyan · 2013
The class of cryptosystems with the public-key in the basis of which there is universal NP-complete problem about a knapsack is considered. This study offers a new model for public-key information protection systems based on universal knapsack problem KU with a spectrum of factors ZCp = {m1, m2, ..., mn}, 1 ≤ mi ≤ p -- 1, p ≥ 2, p ∈ N. The problem of stacking such universal knapsack is offered. Then the algorithm of construction of the generalized universal knapsack cryptosystems with the public-key is given.