Criticism of Knapsack Encryption Scheme

نویسنده

  • Sattar J. Aboud
چکیده

In this paper, we analyze a knapsack schemes. The one is suggested by Su, which is relied on a new method entitled permutation combination method. We demonstrate that this permutation method is useless to the security of the scheme. Since the special super increasing construction, we can break this scheme employ the algorithm provided by Shamir scheme. Finally, we provide an enhanced version of Su scheme to avoid these attacks.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parameter security characterization of knapsack public-key crypto under quantum computing

Knapsack public-key encryption schemes are based on the knapsack problem, which is NP-complete. Merkle-Hellman knapsack encryption scheme was the first concrete realization of a public-key encryption scheme. As its secure basis is superincreasing knapsack problem, it has been demonstrated to be insecure. Many variations have subsequently been proposed, whose knapsack vector density are less tha...

متن کامل

Security on a Knapsack-Type Encryption Scheme Based Upon Hybrid-Model Assumption

Provable security is a reduction that breaking the scheme is usually reduced to solving some basic hard problems, thus the foundation of the scheme’s security is the assumption that it is hard to solve the based problems. Due to most existing schemes are founded on single assumption, some encryption schemes, whose security are based on multiple assumptions, have been proposed. Recently, Su and ...

متن کامل

Improved cryptanalysis of a knapsack-based probabilistic encryption scheme

Wang et al. [B. Wang, Q. Wu, Y. Hu, A knapsack-based probabilistic encryption scheme, Information Sciences 177(19) (2007) 3981–3994] proposed a high density knapsack-based probabilistic encryption scheme with non-binary coefficients. In this paper, we present a heuristic attack that can be used to recover the private key parameters from the known public key parameters. In particular, we show th...

متن کامل

SESOS: A Verifiable Searchable Outsourcing Scheme for Ordered Structured Data in Cloud Computing

While cloud computing is growing at a remarkable speed, privacy issues are far from being solved. One way to diminish privacy concerns is to store data on the cloud in encrypted form. However, encryption often hinders useful computation cloud services. A theoretical approach is to employ the so-called fully homomorphic encryption, yet the overhead is so high that it is not considered a viable s...

متن کامل

Artemia: a family of provably secure authenticated encryption schemes

Authenticated encryption schemes establish both privacy and authenticity. This paper specifies a family of the dedicated authenticated encryption schemes, Artemia. It is an online nonce-based authenticated encryption scheme which supports the associated data. Artemia uses the permutation based mode, JHAE, that is provably secure in the ideal permutation model. The scheme does not require the in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1005.4012  شماره 

صفحات  -

تاریخ انتشار 2010