Knapsack cryptosystems

Known as: Knapsack cryptosystem 
Knapsack Cryptosystems are cryptosystems which security is based on the hardness of solving the knapsack problem.While such systems have been… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1982-2016
02419822016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
With the possible advent of quantum computers, the most famous public key cryptosystem for network applications - RSA, is facing… (More)
  • table I
  • table II
  • figure 1
  • figure 2
  • figure 4
Is this relevant?
2009
2009
In this paper, we cryptanalyze two knapsack cryptosystems. The first one is proposed by Hwang et al [4], which is based on a new… (More)
Is this relevant?
2008
2008
Subset sum problem is NP-hard. So, the knapsack scheme seem to be difficult to break. But... A n d log = They proved that if d <0… (More)
Is this relevant?
2008
2008
We construct three public key knapsack cryptosystems. Standard knapsack cryptosystems hide easy instances of the knapsack problem… (More)
Is this relevant?
2008
2008
We construct three public key knapsack cryptosystems. Standard knapsack cryptosystems hide easy instances of the knapsack problem… (More)
Is this relevant?
2003
2003
Knapsack cryptosystems are based on the subset-sum problem, that is, given a set of integers a1, . . . , an and a specified sum s… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2001
2001
Two public-key 0–1 knapsack cryptosystems are proposed, that have so high a density and use so weak a modular multiplication as a… (More)
Is this relevant?
Highly Cited
1990
1989
1989
In this paper, we propose two algorithms to improve the Merkle-Hellman knapsack public-key cryptosystem. First, we propose an… (More)
  • figure 1
Is this relevant?
1983
1983
This paper presents and analyzes cryptanalytic attacks on knapsack public key cryptosystems that are based on ideas from… (More)
Is this relevant?