Name
Abstract | ||
|---|---|---|
In SAC'98, Cai and Cusick proposed an efficient lattice-based public-key cryptosystem mixed with a knapsack. However, a ciphertext-only attack given by Pan and Deng shows that it is not secure. In this paper, we present a new efficient lattice-based public-key cryptosystem mixed with a knapsack, which can resist Pan and Deng's attack well. What's more, it has reasonable key size, quick encryption and decryption. However, we have to point out that the new cryptosystem has no security proof. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1007/978-3-642-25513-7_10 | CANS |
Keywords | Field | DocType |
ciphertext-only attack,efficient lattice-based public-key cryptosystem,new cryptosystem,quick encryption,security proof,reasonable key size,new efficient lattice-based public-key,new lattice-based public-key cryptosystem,knapsack,lattice | Hybrid cryptosystem,Merkle–Hellman knapsack cryptosystem,Cramer–Shoup cryptosystem,Goldwasser–Micali cryptosystem,Computer security,Computer science,Benaloh cryptosystem,Plaintext-aware encryption,Theoretical computer science,Cryptosystem,Knapsack problem | Conference |
Volume | ISSN | Citations |
7092 | 0302-9743 | 2 |
PageRank | References | Authors |
0.40 | 24 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yanbin Pan | 1 | 35 | 13.29 |
| Yingpu Deng | 2 | 38 | 8.06 |
| Yupeng Jiang | 3 | 19 | 10.15 |
| Ziran Tu | 4 | 93 | 12.46 |