Skip to main navigation Skip to search Skip to main content

An extended knapsack public key cryptosystem

  • Xiao Ping Ji
  • , Hai Bin Zhang
  • , Bo Ying Wu
  • , Guang Yu Li
  • Harbin Institute of Technology
  • Research Institute

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We analyzed a typical cryptosystem and an easy extended knapsack subset sum problem is proposed. The solution is not chosen from {0,1} any longer but from{0,1,... p -1} . Based on the problem, we construct a public key cryptosystem in which the plaintext is divided into some groups and each group has h bits, so that the encryption and decryption can be very fast. The possible attacks are analyzed. Our cryptosystem not only can resist Shamir's attack but also can resist the low density attack, because of its high density. The number of the sequence is also much shorter than before with the same density.

Original languageEnglish
Title of host publicationMachinery Electronics and Control Engineering III
Pages678-681
Number of pages4
DOIs
StatePublished - 2014
Event2013 3rd International Conference on Machinery Electronics and Control Engineering, ICMECE 2013 - Jinan, Shandong, China
Duration: 29 Nov 201330 Nov 2013

Publication series

NameApplied Mechanics and Materials
Volume441
ISSN (Print)1660-9336
ISSN (Electronic)1662-7482

Conference

Conference2013 3rd International Conference on Machinery Electronics and Control Engineering, ICMECE 2013
Country/TerritoryChina
CityJinan, Shandong
Period29/11/1330/11/13

Keywords

  • Extended knapsack
  • Low density attack
  • Public key cryptosystem

Fingerprint

Dive into the research topics of 'An extended knapsack public key cryptosystem'. Together they form a unique fingerprint.

Cite this