An interesting cryptography study based on knapsack problem

Research output: Chapter in Book/Report/Conference proceedingConference PaperOther

Abstract

Cryptography is an art that has been practised through the centuries. Interest in the applications of the knapsack problem to cryptography has arisen with the advent of public key cryptography. The knapsack problem is well documented problem and all research into its properties have lead to the conjecture that it is difficult to solve. In this paper the canonical duality theory is presented for solving general knapsack problem. By using the canonical dual transformation, the integer programming problem can be converted into a continuous canonical dual problem with zero duality gap. The optimality criterion are also discussed. Numerical examples show the efficiency of the method.

Original languageEnglish
Title of host publicationProceedings - UKSim 15th International Conference on Computer Modelling and Simulation, UKSim 2013
Pages330-334
Number of pages5
DOIs
Publication statusPublished - 2013
Externally publishedYes
EventUKSim International Conference on Computer Modelling and Simulation (EUROSIM/UKSim) 2013 - Cambridge, United Kingdom
Duration: 10 Apr 201312 Apr 2013
Conference number: 15th

Publication series

NameProceedings - UKSim 15th International Conference on Computer Modelling and Simulation, UKSim 2013

Conference

ConferenceUKSim International Conference on Computer Modelling and Simulation (EUROSIM/UKSim) 2013
Abbreviated titleUKSim 2013
CountryUnited Kingdom
CityCambridge
Period10/04/1312/04/13

Keywords

  • Canonical dual transformation
  • Cryptography
  • Global optimization
  • Integer programming
  • Knapsack problems

Cite this