Name
Abstract | ||
|---|---|---|
In this paper, we propose a knapsack cryptosystem based on three knapsacks. Although one of the three secret knapsacks is superincreasing, the other two are non-superincreasing. On the encryption, a ciphertext is formed by multiplying the two non-superincreasing knapsacks together and then adding it to the superincreasing knapsack. Due to this structure of the cipher text, our knapsack cryptosystem is thought to be secure against all existing attacks, i.e., the low density attack and Shamir attack. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1109/ISITA.2010.5649307 | ISITA |
Keywords | Field | DocType |
nonsuperincreasing knapsacks,cryptography,multiple knapsacks,secret knapsacks,ciphertext,low density attack,encryption,shamir attack,knapsack cryptosystem,knapsack problems,superincreasing knapsack,manganese,public key cryptography | Discrete mathematics,Merkle–Hellman knapsack cryptosystem,Computer science,Cryptography,Encryption,Cryptosystem,Theoretical computer science,Ciphertext,Knapsack problem,Public-key cryptography,Low density | Conference |
ISBN | Citations | PageRank |
978-1-4244-6017-5 | 1 | 0.35 |
References | Authors | |
2 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kunikatsu Kobayashi | 1 | 2 | 1.39 |
| Kohtaro Tadaki | 2 | 118 | 17.04 |
| Masao Kasahara | 3 | 290 | 147.60 |
| Shigeo Tsujii | 4 | 598 | 131.15 |