{"title":"双序列背包PKC和单序列背包PKC抗低密度攻击的安全性","authors":"T. Nasako, Y. Murakami, M. Kasahara","doi":"10.1109/ICCIT.2009.283","DOIUrl":null,"url":null,"abstract":"The study of the knapsack PKC is important from both practical and theoretical standpoints. We proposed a double-sequence knapsack PKC on the basis of MH PKC. We also proposed a single-sequence knapsack PKC using the Chinese remainder theorem on the basis of this scheme. In this paper, we explain the double-sequence knapsack PKC and the single-sequence knapsack PKC. We describe examples of trapdoors based on the conventional trapdoors. We evaluate the breaking rate of the double-sequence knapsack PKC and the single-sequence knapsack PKC with the low-density attack by computer experiments.","PeriodicalId":112416,"journal":{"name":"2009 Fourth International Conference on Computer Sciences and Convergence Information Technology","volume":"139 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Security of Double-Sequence Knapsack PKC and Single-Sequence Knapsack PKC against Low-Density Attack\",\"authors\":\"T. Nasako, Y. Murakami, M. Kasahara\",\"doi\":\"10.1109/ICCIT.2009.283\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The study of the knapsack PKC is important from both practical and theoretical standpoints. We proposed a double-sequence knapsack PKC on the basis of MH PKC. We also proposed a single-sequence knapsack PKC using the Chinese remainder theorem on the basis of this scheme. In this paper, we explain the double-sequence knapsack PKC and the single-sequence knapsack PKC. We describe examples of trapdoors based on the conventional trapdoors. We evaluate the breaking rate of the double-sequence knapsack PKC and the single-sequence knapsack PKC with the low-density attack by computer experiments.\",\"PeriodicalId\":112416,\"journal\":{\"name\":\"2009 Fourth International Conference on Computer Sciences and Convergence Information Technology\",\"volume\":\"139 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-11-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 Fourth International Conference on Computer Sciences and Convergence Information Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCIT.2009.283\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Fourth International Conference on Computer Sciences and Convergence Information Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCIT.2009.283","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Security of Double-Sequence Knapsack PKC and Single-Sequence Knapsack PKC against Low-Density Attack
The study of the knapsack PKC is important from both practical and theoretical standpoints. We proposed a double-sequence knapsack PKC on the basis of MH PKC. We also proposed a single-sequence knapsack PKC using the Chinese remainder theorem on the basis of this scheme. In this paper, we explain the double-sequence knapsack PKC and the single-sequence knapsack PKC. We describe examples of trapdoors based on the conventional trapdoors. We evaluate the breaking rate of the double-sequence knapsack PKC and the single-sequence knapsack PKC with the low-density attack by computer experiments.