A secure approach for embedding message text on an elliptic curve defined over prime fields, and building 'EC-RSA-ELGamal' Cryptographic System
Ahmad Steef, M. N. Shamma, A. Alkhatib

TL;DR
This paper introduces a novel probabilistic method for embedding message text on elliptic curves using RSA-based security, leading to the development of a new cryptographic system called 'EC-RSA-ELGamal' that combines elliptic curve and RSA concepts.
Contribution
It proposes a new probabilistic message embedding technique on elliptic curves and integrates it with EC-ELGamal to create a hybrid cryptographic system.
Findings
The approach enables message discovery based on RSA security principles.
The 'EC-RSA-ELGamal' system combines elliptic curve and RSA cryptography.
The method enhances message embedding security on elliptic curves.
Abstract
This paper presents a new probabilistic approach to embedding message text on an elliptic curve, by using the concept of the RSA Algorithm and its security, and such approach allows us discovering the message from the point, only according to the security of the RSA Algorithm. By mixing between the concept of this approach and the concept of EC-ELGamal Cryptographic System, we have built a cryptographic System and we named it 'EC-RSA-ELGamal'
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCryptography and Residue Arithmetic · Cryptography and Data Security · Chaos-based Image/Signal Encryption
