Year: 2005
Type: article
Abstract: 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.
Author: H. Ritter
Language: English
Subfield: Information Systems
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W1560680010