背包密码0/255的点阵攻击

2012 Fourth International Conference on Intelligent Networking and Collaborative Systems Pub Date : 2012-09-19 DOI:10.1109/iNCoS.2012.90

Baocang Wang, H. Lei

{"title":"背包密码0/255的点阵攻击","authors":"Baocang Wang, H. Lei","doi":"10.1109/iNCoS.2012.90","DOIUrl":null,"url":null,"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.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"12 3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Lattice Attack on the Knapsack Cipher 0/255\",\"authors\":\"Baocang Wang, H. Lei\",\"doi\":\"10.1109/iNCoS.2012.90\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":287478,\"journal\":{\"name\":\"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems\",\"volume\":\"12 3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-09-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/iNCoS.2012.90\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/iNCoS.2012.90","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

本文分析了最近提出的背包公钥密码系统——背包密码0/255。指出从背包密码0/255的公钥可以导出一个格。利用格基约简算法，通过寻找最短的非零向量来恢复相应的密钥。因此背包密码0/255是不安全的。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Lattice Attack on the Knapsack Cipher 0/255

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2012 Fourth International Conference on Intelligent Networking and Collaborative Systems

自引率

0.00%

发文量