Efficient Mapping Scheme for Elliptic Curve Cryptosystem in a Multiprocessing Environment

preprint OA: closed CC-BY-4.0
📄 Open PDF View at publisher

Abstract

The security of Elliptic Curve Cryptosystem (ECC) hinges on on the hardness of Elliptic Curve Discrete Logic Problem. However, existing mapping schemes are inefficient, make ECC vulnerable to security attacks and cannot be efficiently implemented in a multiprocessing environment. In this paper, an efficient mapping scheme which employ the use of Columnar Transposition technique for bit manipulation before message mapping to point on the elliptic curve was developed. Comparative security, efficiency and performance analysis of the developed mapping scheme with the existing ones were investigated. The outcomes show that the developed mapping scheme is resilient to different attacks that the existing scheme are vulnerable to. ECC schemes that use the developed mapping scheme efficiently use resources in multiprocessing environment, requires lower bandwidth for transmission of encrypted point, without negatively affecting the encryption/decryption time, throughputs and energy consumption, than the ECC schemes with existing mapping schemes.

My notes (saved in your browser only)

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. The paper's references may be in our DB but unresolved to ``paper_id`` (resolution happens at ingest when the cited DOI matches a row we already have). Run the cross-source citation reconcile pass to retry.

Source provenance

europepmc
last seen: 2026-05-19T01:45:01.086888+00:00
unpaywall
last seen: 2026-05-22T02:00:06.705733+00:00
License: CC-BY-4.0