TY  - JOUR
A1  - Ritter, Harald
T1  - Breaking Knapsack cryptosystems by max-norm enumeration
N2  - At EUROCRYPT '94 G. Orton proposed a public key cryptosystem based on dense compact knapsacks. We present an efficient depth first search enumeration of l-infinite-norm short lattice vectors based on Hoelder's inequality and apply this algorithm to break Orton's cryptosystem.
KW  - NP-hardness
KW  - Knapsack problem
KW  - Subset sum problem
KW  - Breaking knapsack cryptosystems
KW  - Shortest lattice vector problem
KW  - Lattice basis reduction
Y1  - 2005
UR  - http://publikationen.ub.uni-frankfurt.de/frontdoor/index/index/docId/4242
UR  - https://nbn-resolving.org/urn:nbn:de:hebis:30-12511
UR  - http://www.mi.informatik.uni-frankfurt.de/research/papers.html
N1  - Postprint, auch in: 1st International Conference of the Theory and Appications of Cryptology - Pragocrypt '96, pp. 480-492, 1996
ER  -