A Probabilistic Encryption Way in Knapsack PKC

DOI

10.2991/ccis-13.2013.33How to use a DOI?

Keywords

Probabilistic encryption; Statistical analysis attack; Lattice basis reduction

Abstract

with the proposed of quantum computers, the knapsack public-key cryptosystem (PKC) becomes very popular. At present the most significant challenge towards knapsack PKC is lattice attack, and density is one of the most important factors to measure the security of it. In this paper, we introduce a probabilistic way to encrypt and compared the knapsack quadratic knapsack and the probabilistic knapsack.. We know that the probabilistic scheme enjoys a high density, information rate and it also secure against brute force attack, statistical analysis attack, lattice attack and so on, and it is efficient and practical.

Copyright

© 2013, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Wang Zuxi
AU  - Yu Baimu
PY  - 2013/11
DA  - 2013/11
TI  - A Probabilistic Encryption Way in Knapsack PKC
BT  - Proceedings of the The 1st International Workshop on Cloud Computing and Information Security
PB  - Atlantis Press
SP  - 140
EP  - 143
SN  - 1951-6851
UR  - https://doi.org/10.2991/ccis-13.2013.33
DO  - 10.2991/ccis-13.2013.33
ID  - Zuxi2013/11
ER  -