並列摘要
The knapsack cipher 0/255 is cryptanalyzed. It is shown that given the public key of the knapsack cipher 0/255, one can recover the corresponding modular multiplier by using the continued fraction algorithm. Hence, the secret key is reconstructed from the recovered multiplier and the public key. So the knapsack cipher 0/255 is totally breakable.
延伸閱讀
- Hu, Y. H. (2008). Design Issues of Multivariate Quadratic Public Key Cryptosystems [doctoral dissertation, National Taiwan University]. Airiti Library. https://doi.org/10.6342/NTU.2008.02535
- Zhao, X. (2015). The Optimization Research of the Multimedia Packets Processing Method in NIDS with 0/1 Knapsack Problem. International Journal of Network Security, 17(3), 351-356. https://doi.org/10.6633/IJNS.201505.17(3).14
- Hu, X. M., Wang, J., Xu, H. J., & Yang, Y. C. (2014). Constant Size Ciphertext and Private Key HIBE without Random Oracles. Journal of Information Science and Engineering, 30(2), 333-345. https://doi.org/10.6688/JISE.2014.30.2.4
- Lee, P. H., Pei, S. C., & Chen, Y. Y. (2003). Generating Chaotic Stream Ciphers Using Chaotic Systems. Chinese Journal of Physics, 41(6), 559-581. https://www.airitilibrary.com/Article/Detail?DocID=05779073-200312-201210090006-201210090006-559-581
- Keliher, L. (2007). Toward Provable Security against Differential and Linear Cryptanalysis for Camellia and Related Ciphers. International Journal of Network Security, 5(2), 167-175. https://doi.org/10.6633/IJNS.200709.5(2).08