Abstract
A RSA-Hill hybrid encryption algorithm model based on random division of plaintext is proposed. Firstly, the key of Hill cipher is replaced by Pascal matrix. Secondly, session key of the model is replaced by random numbers of plaintext division, and it is encrypted by RSA cipher. Finally, the dummy problem in Hill cipher can be solved, and the model can achieve the one-Time pad. Security analysis and experimental results show that our method has better encryption efficiency and stronger anti-Attack capacity.
Author supplied keywords
Cite
CITATION STYLE
Yang, H., Ning, Y., & Wang, Y. (2019). Research on RSA and Hill hybrid encryption algorithm. International Journal of Computational Science and Engineering, 20(1), 1–6. https://doi.org/10.1504/ijcse.2019.10024803
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.