Cryptosystem by a community of devices with limited resources
by Rebiha Hadaoui; Karim Tamine; Mehammed Daoui; Mustapha Lalam
International Journal of Communication Networks and Distributed Systems (IJCNDS), Vol. 25, No. 1, 2020

Abstract: Rivest-Shamir-Adleman (RSA) is an encryption algorithm with public-key and is the most widely used for secure data transmission. It provides high safety and consists of modular exponential operation on large numbers. We propose an original approach which makes a distributed calculation of RSA encryption by a community of users endowed with low resources equipment. When a user u of the community wants to encrypte a data X, he exploits the resources of his community. For that, we replace the modular exponentiation operation by a set of calculations dependent of each other and which use fewer resources. These calculations are spread over the members of the user's community to help him perform the operation.

Online publication date: Fri, 03-Jul-2020

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 Communication Networks and Distributed Systems (IJCNDS):
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