Lattice Attack on the Knapsack Cipher 0/255

Author

Wang, Baocang ; Lei, Hao

fYear

2012

fDate

19-21 Sept. 2012

Firstpage

577

Lastpage

580

Abstract

A recently-proposed knapsack public key cryptosystem called knapsack cipher 0/255 is crypt analyzed. It is pointed out that a lattice can be derived from the public key of the knapsack cipher 0/255. The corresponding secret key can be recovered by finding the shortest nonzero vector with lattice basis reduction algorithms. Thus the knapsack cipher 0/255 is insecure.

Keywords

knapsack problems; public key cryptography; knapsack cipher 0-255; knapsack public key cryptosystem; lattice attack; lattice basis reduction algorithms; secret key; shortest nonzero vector; Approximation methods; Computers; Lattices; Public key cryptography; Vectors; Knapsack problem; Lattice reduction; Shortest vector problem; public key cryptography;

fLanguage

English

Publisher

ieee

Conference_Titel

Intelligent Networking and Collaborative Systems (INCoS), 2012 4th International Conference on

Conference_Location

Bucharest

Print_ISBN

978-1-4673-2279-9

Type

conf

DOI

10.1109/iNCoS.2012.90

Filename

6337985

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1929282