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 language | English |
---|---|
Title of host publication | Proceedings - UKSim 15th International Conference on Computer Modelling and Simulation, UKSim 2013 |
Pages | 330-334 |
Number of pages | 5 |
DOIs | |
Publication status | Published - 2013 |
Externally published | Yes |
Event | UKSim International Conference on Computer Modelling and Simulation (EUROSIM/UKSim) 2013 - Cambridge, United Kingdom Duration: 10 Apr 2013 → 12 Apr 2013 Conference number: 15th |
Publication series
Name | Proceedings - UKSim 15th International Conference on Computer Modelling and Simulation, UKSim 2013 |
---|
Conference
Conference | UKSim International Conference on Computer Modelling and Simulation (EUROSIM/UKSim) 2013 |
---|---|
Abbreviated title | UKSim 2013 |
Country/Territory | United Kingdom |
City | Cambridge |
Period | 10/04/13 → 12/04/13 |
Keywords
- Canonical dual transformation
- Cryptography
- Global optimization
- Integer programming
- Knapsack problems