- 期刊
Accelerating RSA Encryption Using Random Precalculations
並列摘要
RSA encryption and digital signature algorithm is considered secure if keys are 1024-4096 bits long. Since it requires modular exponentiation on numbers of this length, embedded systems need either a cryptographic co-processor or a fast CPU to calculate ciphertexts and signatures. In many applications, the sender is resource-scare, so optimization is necessary. In our paper we show a method for precalculations that accelerates the real-time performance of the sender in the expense of additional calculations at the receiver. When completed, the receiver gets an RSA-equivalent ciphertext for the encryption algorithm.
延伸閱讀
- Teng, L., Li, H., Yin, S., & Sun, Y. (2020). A Modified Advanced Encryption Standard for Data Security. International Journal of Network Security, 22(1), 112-117. https://doi.org/10.6633/IJNS.202001_22(1).11
- Malek, B., & Miri, A. (2012). Adaptively Secure Broadcast Encryption with Short Ciphertexts. International Journal of Network Security, 14(2), 71-79. https://doi.org/10.6633/IJNS.201203.14(2).02
- Xu, C. (2019). Cryptanalysis of An Improved Predicate Encryption Scheme from LWE. International Journal of Network Security, 21(6), 1054-1061. https://doi.org/10.6633/IJNS.201911_21(6).19
- Santosh, K. R., Narasimham, C., & ShettyS, P. (2016). Cryptanalysis of Multi-prime RSA With Two Decryption Exponents. International Journal of Electronics and Information Engineering, 4(1), 40-44. https://doi.org/10.6636/IJEIE.201603.4(1).05
- Wu, M. E. (2009). On the Design and Cryptanalysis of Efficient RSA Variants [doctoral dissertation, National Tsing Hua University]. Airiti Library. https://doi.org/10.6843/NTHU.2009.00048