A public-key cryptosystem based on a generalization of the knapsack problem

A cryptographic algorithm, based on a generalization of the knapsack problem, which allows encryption of multilevel digit sequences and provides attractive performances from the point of view of secrecy is proposed. A modified algorithm which is much harder to break is presented. The modified algorithm increases security owing to the necessity of factoring large numbers. Both algorithms require generation of large numbers to get a good level of security.