{"title":"攻击背包公钥加密方案","authors":"S. Aboud","doi":"10.1109/I-SOCIETY18435.2011.5978513","DOIUrl":null,"url":null,"abstract":"This paper focuses on the knapsack scheme suggested by Hwang, which is relied on a new method entitled permutation combination method. The findings show that this permutation method is not efficient to the security of the scheme since, we can break this scheme employ the algorithm provided by Shamir scheme. Finally, we provide an enhanced version of Hwang scheme to avoid this attack.","PeriodicalId":158246,"journal":{"name":"International Conference on Information Society (i-Society 2011)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Attack knapsack public key encryption scheme\",\"authors\":\"S. Aboud\",\"doi\":\"10.1109/I-SOCIETY18435.2011.5978513\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper focuses on the knapsack scheme suggested by Hwang, which is relied on a new method entitled permutation combination method. The findings show that this permutation method is not efficient to the security of the scheme since, we can break this scheme employ the algorithm provided by Shamir scheme. Finally, we provide an enhanced version of Hwang scheme to avoid this attack.\",\"PeriodicalId\":158246,\"journal\":{\"name\":\"International Conference on Information Society (i-Society 2011)\",\"volume\":\"30 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-06-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Information Society (i-Society 2011)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/I-SOCIETY18435.2011.5978513\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Information Society (i-Society 2011)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/I-SOCIETY18435.2011.5978513","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
This paper focuses on the knapsack scheme suggested by Hwang, which is relied on a new method entitled permutation combination method. The findings show that this permutation method is not efficient to the security of the scheme since, we can break this scheme employ the algorithm provided by Shamir scheme. Finally, we provide an enhanced version of Hwang scheme to avoid this attack.