Information protection systems based on universal knapsack problem

Authors:
V. O. Osipyan
Affiliations:
Kuban State University, Russia, Krasnodar
Venue:
Proceedings of the 6th International Conference on Security of Information and Networks
Year:
2013

Citing 6
Cited 0

A course in number theory and cryptography

A course in number theory and cryptography
Applied cryptography (2nd ed.): protocols, algorithms, and source code in C

Applied cryptography (2nd ed.): protocols, algorithms, and source code in C
On the security of multiple encryption

Communications of the ACM
Hiding information and signatures in trapdoor knapsacks

IEEE Transactions on Information Theory
A knapsack-type public key cryptosystem based on arithmetic in finite fields

IEEE Transactions on Information Theory - Part 1
Building of alphabetic data protection cryptosystems on the base of equal power knapsacks with Diophantine problems

Proceedings of the Fifth International Conference on Security of Information and Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

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. The examined approach to setting up knapsack-type public-key cryptosystem allows to control in a more secure and flexible way the key space and key inputs. The basic knapsack is normal injective universal knapsack, and the used scheme is the generalized Merkle-Hellman scheme suggested by the author.