- 期刊
A Fast Semantically Secure Public Key Cryptosystem Based on Factoring
並列摘要
The cryptosystem proposed by Koyama is not semantically secure. Also, it is not secure against partial known plaintext attack, linearly related plaintext attack and low exponent attack. In this paper we propose a cryptosystem over singular cubic curve using the idea of Koyama and Kouichi et al. Our proposed cryptosystem is approximately two times faster than the cryptosystem given by Kouichi et al. with the same security label and more efficient than the Koyama scheme at higher security label. Further, the partially known plaintext attack and the linearly related plaintext attacks are analyzed and concluded that those are not possible in the proposed scheme.
延伸閱讀
- Li, Q. Y., & Zhang, F. L. (2015). A Fully Secure Attribute Based Broadcast Encryption Scheme. International Journal of Network Security, 17(3), 263-271. https://doi.org/10.6633/IJNS.201505.17(3).05
- YANG, Y., YANG, S. L., WANG, F. H., & SUN, J. (2017). Post-Quantum Secure Public Key Broadcast Encryption with Keyword Search. Journal of Information Science and Engineering, 33(2), 485-497. https://doi.org/10.6688/JISE.2017.33.2.12
- Lu, C. F., & Shieh, S. P. (2004). Secure Key-Evolving for Public Key Cryptosystems Based on the Discrete Logarithm Problem. Journal of Information Science and Engineering, 20(2), 391-400. https://doi.org/10.6688/JISE.2004.20.2.6
- Shi, Y. J., Li, J. H., & Shi, J. J. (2008). Constructing Efficient Certificateless Public Key Encryption with Pairing. International Journal of Network Security, 6(1), 26-32. https://doi.org/10.6633/IJNS.200801.6(1).04
- Kwok, H. M. (2011). A scalable and secure networking paradigm using identity-based cryptography [doctoral dissertation, The University of Hong Kong]. Airiti Library. https://www.airitilibrary.com/Article/Detail?DocID=U0029-1812201200019432