Research on RSA and Hill hybrid encryption algorithm
by Hongyu Yang; Yuguang Ning; Yue Wang
International Journal of Computational Science and Engineering (IJCSE), Vol. 20, No. 1, 2019

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.

Online publication date: Wed, 23-Oct-2019

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Science and Engineering (IJCSE):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com