一种背包式公钥密码系统的密钥恢复攻击

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

Chunfei Ju, Hui Yuan

{"title":"一种背包式公钥密码系统的密钥恢复攻击","authors":"Chunfei Ju, Hui Yuan","doi":"10.1109/iNCoS.2012.89","DOIUrl":null,"url":null,"abstract":"A new knapsack public key cryptosystem is crypt analyzed. The cryptanalytic attack uses the Euclidean algorithm to obtain the greatest common divisor of some integers, and thus recovers the modulus. Then the attack reconstructs the multiplier by solving a linear congruence. Therefore, all the secret keys can be retrieved in polynomial time. Hence, the public key cryptosystem is insecure.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"44 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Key Recovery Attack on a Knapsack Public Key Cryptosystem\",\"authors\":\"Chunfei Ju, Hui Yuan\",\"doi\":\"10.1109/iNCoS.2012.89\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A new knapsack public key cryptosystem is crypt analyzed. The cryptanalytic attack uses the Euclidean algorithm to obtain the greatest common divisor of some integers, and thus recovers the modulus. Then the attack reconstructs the multiplier by solving a linear congruence. Therefore, all the secret keys can be retrieved in polynomial time. Hence, the public key cryptosystem is insecure.\",\"PeriodicalId\":287478,\"journal\":{\"name\":\"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems\",\"volume\":\"44 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.89\",\"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.89","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

分析了一种新的背负式公钥密码体制。密码分析攻击利用欧几里得算法求出某些整数的最大公因数，从而恢复其模量。然后通过求解线性同余重构乘数。因此，所有密钥都可以在多项式时间内检索到。因此，公钥密码系统是不安全的。

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

查看原文本刊更多论文

Key Recovery Attack on a Knapsack Public Key Cryptosystem

A new knapsack public key cryptosystem is crypt analyzed. The cryptanalytic attack uses the Euclidean algorithm to obtain the greatest common divisor of some integers, and thus recovers the modulus. Then the attack reconstructs the multiplier by solving a linear congruence. Therefore, all the secret keys can be retrieved in polynomial time. Hence, the public key cryptosystem is insecure.

求助全文

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

来源期刊

2012 Fourth International Conference on Intelligent Networking and Collaborative Systems

自引率

0.00%

发文量