Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,158,946 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
6 relations
Broader (1)
Cryptography
Cryptosystem
Knapsack problem
Merkle–Hellman knapsack cryptosystem
Post-quantum cryptography
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Improvement of key generation for a number field based knapsack cryptosystem
Yasunori Miyamoto
,
K. Nakamula
JSIAM Letters
2013
Corpus ID: 121464662
We improve our former implementation of key generation for a cryptosystem OTU2000 with resistance to quantum computers. First, we…
Expand
2012
2012
Empirical exploration of lattice attacks for building secure knapsack cryptosystems
S. Jen
,
Chia-Yu Lu
,
Tse-Lin Lai
,
J. Yang
Anti-counterfeiting, Security, and Identification
2012
Corpus ID: 21368665
Pending the possible realization of quantum computers, the RSA algorithm face critical challenges because of weaknesses under…
Expand
2010
2010
Merkle-Hellman Knapsack Cryptosystem in Undergraduate Computer Science Curriculum
Y. Kortsarts
,
Yulia Kempner
Frontiers in Education: Computer Science…
2010
Corpus ID: 14852152
We present our experience integrating MerkleHellman knapsack cryptosystem into undergraduate computer science curriculum. The…
Expand
2009
2009
Cryptanalysis of a Knapsack Public Key Cryptosystem
Baocang Wang
,
Hui Liu
,
Yu-pu Hu
Fifth International Conference on Information…
2009
Corpus ID: 12551060
Murakami and Nasako proposed a knapsack public key cryptosystem in2008. They claimed that their proposal is secure against some…
Expand
2009
2009
Practical Threshold Signatures with Linear Secret Sharing Schemes
I. N. Bozkurt
,
K. Kaya
,
A. Selçuk
International Conference on Cryptology in Africa
2009
Corpus ID: 265850
Function sharing deals with the problem of distribution of the computation of a function (such as decryption or signature) among…
Expand
2008
2008
New Definition of Density on Knapsack Cryptosystems
N. Kunihiro
International Conference on Cryptology in Africa
2008
Corpus ID: 38491051
Many knapsack cryptosystems have been proposed but almost all the schemes are vulnerable to lattice attack because of its low…
Expand
2008
2008
A note on performance of low-density attack for several knapsack PKCs
Yoshifumi Katakura
,
T. Nasako
,
Y. Murakami
,
M. Kasahara
International Symposium on Information Theory and…
2008
Corpus ID: 16743844
The order of the public-key components of knapsack cryptosystems are usually scrambled by a random permutation. It is well known…
Expand
2006
2006
Knapsack Public-Key Cryptosystem Using Chinese Remainder Theorem
Y. Murakami
,
T. Nasako
IACR Cryptology ePrint Archive
2006
Corpus ID: 15121353
The realization of the quantum computer will enable to break publickey cryptosystems based on factoring problem and discrete…
Expand
2005
2005
Breaking Knapsack cryptosystems by max-norm enumeration
2005
Corpus ID: 118014884
At EUROCRYPT '94 G. Orton proposed a public key cryptosystem based on dense compact knapsacks. We present an eecient depth rst…
Expand
1983
1983
Evaluation of the Adleman Attack on Multiply Iterated Knapsack Cryptosystems
E. F. Brickell
,
J. Lagarias
,
A. Odlyzko
Annual International Cryptology Conference
1983
Corpus ID: 41214389
Early in 1982, A. Shamir [12] announced a polynomial time attack on the basic Merkle-Hellman knapsack cryptosystem. Since that…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE