A Probabilistic Encryption Way in Knapsack PKC

摘要

With the proposed of quantum computers, the knapsack public-key cryptosystem (PKC) becomes very popular. At present the most significant challenge towards knapsack PKC is lattice attack, and density is one of the most important factors to measure the security of it. In this paper, we introduce a probabilistic way to encrypt and compared the knapsack quadratic knapsack and the probabilistic knapsack. We know that the probabilistic scheme enjoys a high density, information rate and it also secure against brute force attack, statistical analysis attack, lattice attack and so on, and it is efficient and practical.