Performance Analysis of Shamir's Attack on the Basic Merkle-Hellman Knapsack Cryptosystem
نویسنده
چکیده
In 1978 Merkle and Hellman [11] proposed public key cryptosystems based on the knapsack problem. The simplest of these cryptosystems, the basic knapsack cryptosystem, works as follows. The public information is a set of nonnegative integers { a i : 1 ≤ i ≤ n } which are called knapsack weights. Messages are encrypted by first being broken into blocks (x 1 , ... ,x n ) of n binary digits. A block is encrypted as the integer E given by
منابع مشابه
Cryptanalytic attacks on the multiplicative knapsack cryptosystem and on Shamir's fast signature scheme
The basic Merkle-Hellman additive trapdoor knapsack public-key cryptosystem was recently shown to be insecure, and attacks have also been developed on stronger variants of it, such as the Graham-Shamir system and the iterated knapsack cryptosystem. This paper shows that some simple variants of another Merkle-Hellman system, the multiplicative knapsack cryptosystem, are insecure. It is also show...
متن کاملLinearly shift knapsack public-key cryptosystem
In this paper, we propose two algorithms to improve the Merkle-Hellman knapsack public-key cryptosystem. First, we propose an approach to transform a superincreasing sequence to a " high den-sity'' knapsack sequence. The algorithm is easy to implement and eliminates the redundancy of many knapsack cryptosystems. Second, a linearly shift method is used to improve the security of the knapsack pub...
متن کاملCryptanalysis of a New Knapsack Type Public-Key Cryptosystem
— Recently, Hwang et al. introduced a knapsack type public-key cryptosystem. They proposed a new algorithm called permutation combination algorithm. By exploiting this algorithm, they attempt to increase the density of knapsack to avoid the low-density attack. We show that this cryptosystem is not secure, as it based on basic Merkel-Hellman knapsack cryptosystem and because of the superincreasi...
متن کاملKnapsack Public Key Cryptosystems And
This paper presents and analyzes cryptanalytic attacks on knapsack public key cryptosystems that are based on ideas from Diophantine approximation. Shamir’s attack on the basic Merkle-Hellman knapsack cryptosystem is shown to depend on the existence of ‘‘unusually good’’ simultaneous Diophantine approximations to a vector constructed from the public key. This aspect of Shamir’s attack carries o...
متن کاملA New Knapsack Public-Key Cryptosystem Based on Permutation Combination Algorithm
A new secure knapsack cryptosystem based on the Merkle-Hellman public key cryptosystem will be proposed in this paper. Although it is common sense that when the density is low, the knapsack cryptosystem turns vulnerable to the low-density attack. The density d of a secure knapsack cryptosystem must be larger than 0 9408 . to avoid low-density attack. In this paper, we investigate a new Permutat...
متن کامل