Preprint Article Version 1 This version is not peer-reviewed

Anonymous Multi-Receiver Public Key Encryption Based on Lucas Sequences

Version 1 : Received: 30 October 2018 / Approved: 31 October 2018 / Online: 31 October 2018 (11:03:09 CET)

How to cite: El Fadil, L.H.; MOUMEN, A.; BOUYE, M. Anonymous Multi-Receiver Public Key Encryption Based on Lucas Sequences. Preprints 2018, 2018100751 (doi: 10.20944/preprints201810.0751.v1). El Fadil, L.H.; MOUMEN, A.; BOUYE, M. Anonymous Multi-Receiver Public Key Encryption Based on Lucas Sequences. Preprints 2018, 2018100751 (doi: 10.20944/preprints201810.0751.v1).

Abstract

Multi-receiver encryption enables a sender to encrypt a message and transmit the ciphertext to a set of authorized users, while no one out this group of authorized users can decrypt the message. Multi-receiver encryption is of great importance in many sectors such as broadcast communication, cloud computing, wireless communications, networking applications, e-voting, lottery, and medical applications. This paper proposes an efficient multi-receiver public key encryption scheme based on Lucas sequences. The results of the computational analysis show that, projected scheme is better against renown attacks and prevailing anonymous multireceiver algorithms

Subject Areas

Lucas sequences, public key cryptosystems, Multi-receiver encryption scheme, Chinese Remainder Theorem, Anonymity.

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our diversity statement.

Leave a public comment
Send a private comment to the author(s)
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.