Decryption Method for Differential Knapsack PKC
العنوان: | Decryption Method for Differential Knapsack PKC |
---|---|
المؤلفون: | Masao Kasahara, Takumi Mine, Yasuyuki Murakami |
المصدر: | Journal of Communications and Information Sciences. 3:82-89 |
بيانات النشر: | AICIT, 2013. |
سنة النشر: | 2013 |
مصطلحات موضوعية: | Scheme (programming language), Mathematical optimization, Hardware_MEMORYSTRUCTURES, Knapsack problem, Continuous knapsack problem, Process (computing), Merkle–Hellman knapsack cryptosystem, Subset sum problem, Point (geometry), Differential (infinitesimal), computer, computer.programming_language, Mathematics |
الوصف: | Murakami and Kasahara proposed the differential knapsack scheme at SCIS2011 and ICCIT2011. The decryption of this scheme requires to solve the small subset sum problem. The space-time tradeoff method (STT) can be applied to solve the subset sum problem(SSP). We presented an implementation of STT for SSP at ICCIT2011. We presented the decryption method with STT for differential knapsack scheme at SCIS2012. In this paper, we present a method for implementing the decryption process with STT method for differential knapsack scheme. Moreover, we point out a problem of the multiple solutions when performing decryption in this scheme and deliberate upon such multiple solutions. |
تدمد: | 2233-9396 2093-9671 |
URL الوصول: | https://explore.openaire.eu/search/publication?articleId=doi_________::4de79542326d16849415ea378ae6e613 https://doi.org/10.4156/jcis.vol3.issue2.10 |
رقم الأكسشن: | edsair.doi...........4de79542326d16849415ea378ae6e613 |
قاعدة البيانات: | OpenAIRE |
تدمد: | 22339396 20939671 |
---|