Cited by 112Chaos-based Image/Signal EncryptionComputer Science and EngineeringCryptographic Implementations and Security

A new image encryption technique combining Elliptic Curve Cryptosystem with Hill Cipher

Open access
Dawahdeh, Ziad E., Yaakob, Shahrul N., Razif bin Othman, Rozmie·2018·Journal of King Saud University - Computer and Information Sciences

Abstract

Image encryption is rapidly increased recently by the increasing use of the internet and communication media. Sharing important images over unsecured channels is liable for attacking and stealing. Encryption techniques are the suitable methods to protect images from attacks. Hill cipher algorithm is one of the symmetric techniques, it has a simple structure and fast computations, but weak security because sender and receiver need to use and share the same private key within a non-secure channels. A new image encryption technique that combines Elliptic Curve Cryptosystem with Hill Cipher (ECCHC) has been proposed in this paper to convert Hill cipher from symmetric technique to asymmetric one and increase its security and efficiency and resist the hackers. Self-invertible key matrix is used to generate encryption and decryption secret key. So, no need to find the inverse key matrix in the decryption process. A secret key matrix with dimensions 4 × 4 will be used as an example in this study. Entropy, Peak Signal to Noise Ratio (PSNR), and Unified Average Changing Intensity (UACI) will be used to assess the grayscale image encryption efficiency and compare the encrypted image with the original image to evaluate the performance of the proposed encryption technique.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1016/j.jksuci.2017.06.004

Cites

28 of 28 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Classical hybrid cryptosystems combine a symmetric image cipher with asymmetric key transport such as ElGamal, ECC, Hill cipher variants or RSA, all of which are broken in polynomial time by Shor's algorithm.

    “Second, classical hybrid cryptosystems [32][33][34][35][36][37][38] consist of a combination of a symmetric image cypher and asymmetric key transport, which is either ElGamal, ECC, Hill cypher variants or RSA; all of which are the weakest links broken in polynomial time by Shor's algorithm.”

    From A hybrid encryption algorithm based on AES and Kyber for secure image protection in the post-quantum era (2026) · cites this paper as [36]

    The Introduction and Conclusions describe an image-encryption scheme combining the symmetric Hill cipher with ECC-based key generation. They say the parties produce a secret key without transmitting it, rather than describing asymmetric key transport. The paper does not address Shor’s algorithm or claim polynomial-time attacks on the listed cryptosystems. (LLM, conf=0.88)

    Experimental — accuracy not yet measured

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

5 of the 33 references couldn’t be matched to a known paper.

Research works printed but not linked: 3

  1. Alese, B.K., Philemon, E.D., Falaki, S.O., 2012. Comparative analysis of public-key encryption schemes. Int. J. Eng. Technol. 2 (9), 1552-1568.
  2. Gutub, A.A.A., 2003. HIGH speed low power GF (2 k) elliptic curve cryptograpy processor architecture. In: IEEE 10th Annual Technical Exchange Meeting, KFUPM. Dhahran, Saudi Arabi.
  3. Gutub, A.A.A., 2010. Preference of efficient architectures for GF (p) elliptic curve crypto operations using multiple parallel multipliers. Int. J. Secur. (IJS) 4 (4), 46.

Cited by

Sorted by citations

Authors
Dawahdeh, Z. E., Yaakob, S. N., & Razif bin Othman, R.
Affiliations
Universiti Malaysia Perlis (MY)
Corresponding author
Dawahdeh, Ziad E.
Venue
Journal of King Saud University - Computer and Information Sciences
Published
2018-07
Volume
30
Issue
3
Pages
349-355
ISSN
1319-1578 (ISSN-L)
OpenAlex
W2730914431
Cited by
112
References
33
Citations by year
2026: 9 · 2025: 15 · 2024: 12 · 2023: 11 · 2022: 18 · 2021: 13 · 2020: 16 · 2019: 10 · 2018: 8
FWCI
3.86
Type
journal article
Language
en
Open access
Locations
  • Journal of King Saud University - Computer and Information Sciences (publishedVersion, cc-by-nc-nd)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
Topics
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Chaos-based Image/Signal Encryption
  • Physical Sciences › Computer Science › Artificial Intelligence › Computer Science and Engineering
  • Physical Sciences › Computer Science › Artificial Intelligence › Cryptographic Implementations and Security
Keywords
image encryption, elliptic curve cryptography, Hill cipher, hybrid encryption, public-key cryptography, grayscale images, cryptographic key generation, entropy (information theory), PSNR, UACI

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review