File(s) under permanent embargo
The 0-1 Knapsack polytope – a starting point for cryptanalysis of Knapsack ciphers?
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.
History
Title of book
Applications and techniques in information securityVolume
490Series
Communications in computer and information scienceChapter number
16Pagination
171 - 182Publisher
Springer VerlagPlace of publication
Berlin, GermanyPublisher DOI
ISSN
1865-0929ISBN-13
9783662456705Language
engNotes
5th International Conference, ATIS 2014, Melbourne, VIC, Australia, November 26-28, 2014. ProceedingsPublication classification
B Book chapter; B1 Book chapterCopyright notice
2014, Springer-VerlagExtent
24Editor/Contributor(s)
L Batten, G Li, W Niu, M WarrenUsage metrics
Categories
No categories selectedKeywords
Licence
Exports
RefWorks
BibTeX
Ref. manager
Endnote
DataCite
NLM
DC