{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T22:26:17Z","timestamp":1773872777071,"version":"3.50.1"},"reference-count":0,"publisher":"MDPI AG","issue":"2","license":[{"start":{"date-parts":[[2024,6,2]],"date-time":"2024-06-02T00:00:00Z","timestamp":1717286400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Cryptography"],"abstract":"<jats:p>To ensure the security of sensitive data, elliptic curve cryptography (ECC) is adopted as an asymmetric method that balances security and efficiency. Nevertheless, embedding messages into elliptic curve (EC) points poses a significant challenge. The intricacies of this process can greatly affect the overall security and efficiency of the cryptosystem, reflecting security vulnerabilities observed in many existing schemes that utilize ElGamal ECC-based encryption. In this paper, we introduce an innovative hash-based technique for securely embedding messages into EC points before encryption. A random parameter and a shared secret point generated through the EC Diffie\u2013Hellman protocol are used to bolster the scheme\u2019s security. The security of the proposed method is evaluated against various attack models; moreover, the complexity, and sensitivity of the encryption scheme, as well as its inputs, are analyzed. The randomness assessment of the ciphertext was performed using the NIST statistical test suite. Additionally, we propose a mechanism to ensure the integrity of the message by securely appending a tag to the ciphertext. As a consequence, a comprehensive analysis of our scheme demonstrates its effectiveness in maintaining data security and integrity against various attack models. The algorithm also meets more criteria such as the strict avalanche criterion, linear complexity, and operability.<\/jats:p>","DOI":"10.3390\/cryptography8020023","type":"journal-article","created":{"date-parts":[[2024,6,3]],"date-time":"2024-06-03T03:51:45Z","timestamp":1717386705000},"page":"23","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Securing Data Exchange with Elliptic Curve Cryptography: A Novel Hash-Based Method for Message Mapping and Integrity Assurance"],"prefix":"10.3390","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4897-7035","authenticated-orcid":false,"given":"Younes","family":"Lahraoui","sequence":"first","affiliation":[{"name":"Mathematics, Computer Science and Applications TEAM, Abdelmalek Essa\u00e2di University, ENSA, Tangier 90000, Morocco"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3426-4050","authenticated-orcid":false,"given":"Saiida","family":"Lazaar","sequence":"additional","affiliation":[{"name":"Mathematics, Computer Science and Applications TEAM, Abdelmalek Essa\u00e2di University, ENSA, Tangier 90000, Morocco"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5311-5915","authenticated-orcid":false,"given":"Youssef","family":"Amal","sequence":"additional","affiliation":[{"name":"Mathematics, Computer Science and Applications TEAM, Abdelmalek Essa\u00e2di University, ENSA, Tangier 90000, Morocco"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0372-1757","authenticated-orcid":false,"given":"Abderrahmane","family":"Nitaj","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Normandie University, UNICAEN, CNRS, LMNO, 14000 Caen, France"}]}],"member":"1968","published-online":{"date-parts":[[2024,6,2]]},"container-title":["Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2410-387X\/8\/2\/23\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T14:52:34Z","timestamp":1760107954000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2410-387X\/8\/2\/23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,2]]},"references-count":0,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2024,6]]}},"alternative-id":["cryptography8020023"],"URL":"https:\/\/doi.org\/10.3390\/cryptography8020023","relation":{},"ISSN":["2410-387X"],"issn-type":[{"value":"2410-387X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,6,2]]}}}