- 期刊
Modified RSA Algorithm Using Two Public Key and Chinese Remainder Theorem
摘要
Network security is an activity which is designed to protect the integrity and usability of the data and network. In network security [14], the branch of cryptography is which one can save and transmit data in format particular so that only the user intended can read and process it, the text encrypted is the cipher text which is then decoded on the receiver side. The algorithm of RSA is an asymmetric cryptography technique, this is working on two keys i.e. public key and private key. The proposed model takes four prime numbers in RSA. Instead of sending one public key directly, send two public keys to the receiver. But there is problem of the speed, so that in RSA decryption used Chinese remainder theorem to enhancement the speed of RSA decryption.
延伸閱讀
- 洪裕翔 (2010). Forward Error Correction Codes Based on Chinese Remainder Theorem [master's thesis, National Tsing Hua University]. Airiti Library. https://www.airitilibrary.com/Article/Detail?DocID=U0016-1901201111412802
- Liu, C., Chang, C. C., Wu, Z. P., & Ye, S. L. (2015). A Study of Relationship between RSA Public Key Cryptosystem and Goldbach's Conjecture Properties. International Journal of Network Security, 17(4), 445-453. https://doi.org/10.6633/IJNS.201507.17(4).09
- Liu, Y. J., Chang, C. C., & Chang, S. C. (2014). An Access Control Mechanism Based on the Generalized Aryabhata Remainder Theorem. International Journal of Network Security, 16(1), 58-64. https://doi.org/10.6633/IJNS.201401.16(1).08
- 許芝華（2010）。An Incremental Alternative Rule Extract Algorithm Based on the Rough Set Theory〔碩士論文，國立暨南國際大學〕。華藝線上圖書館。https://www.airitilibrary.com/Article/Detail?DocID=U0020-2107201016152800
- Hsieh, Y. L. (2011). A Decremental Alternative Rule Extract Algorithm Based on the Rough Set Theory [master's thesis, National Chi Nan University]. Airiti Library. https://www.airitilibrary.com/Article/Detail?DocID=U0020-2307201121045700