The 0-1 Knapsack polytope – a starting point for cryptanalysis of Knapsack ciphers?
Contribuinte(s) |
Batten, L Li, G Niu, W Warren, M |
---|---|
Data(s) |
01/01/2014
|
Resumo |
The Knapsack Cryptosystem of Merkle and Hellman, 1978, is one of the earliest public-key cryptography schemes. The security of the method relies on the difficulty in solving Subset Sum Problems (also known as Knapsack Problems). In this paper, we first provide a brief history of knapsack-based cryptosystems and their cryptanalysis attacks. Following that, we review the advances in integer programming approaches to 0 − 1 Knapsack Problems, with a focus on the polyhedral studies of the convex hull of the integer set. Last of all, we discuss potential future research directions in applying integer programming in the cryptanalysis of knapsack ciphers. |
Identificador | |
Idioma(s) |
eng |
Publicador |
Springer |
Relação |
http://dro.deakin.edu.au/eserv/DU:30068097/makhau-01knapsackpolytope-2014.pdf http://dro.deakin.edu.au/eserv/DU:30068097/makhau-01knapsackpolytope-evid-2014.pdf http://dro.deakin.edu.au/eserv/DU:30068097/makhau-01knapsackpolytope-evid2-2014.pdf http://dro.deakin.edu.au/eserv/DU:30068097/makhau-01knapsackpolytope-pre-2014.pdf http://www.dx.doi.org/10.1007/978-3-662-45670-5 |
Direitos |
2014, Springer-Verlag |
Tipo |
Book Chapter |