Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
143 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Analytical Observations on Knapsack Cipher 0/255 (1312.3740v3)

Published 13 Dec 2013 in cs.CR

Abstract: We observed few important facts that concerns with the new proposal of knapsack cipher 0/255, recently published by Pham [1]. The author claimed that the time complexity for solving new improved trapdoor knapsack is O(256N). In this paper, we show that the knapsack cipher 0/255 can be solved in the same time that is required for solving the basic knapsack-cipher proposed by Merkle and HeLLMan [2]. In other words we claim that the improved version proposed by Pham [1] is technically same as the basic Merkle and HeLLMan Knapsack-based cryptosystem.

Summary

We haven't generated a summary for this paper yet.