Image Encryption Scheme Based on Knight's Tour Problem
Open accessAbstract
This work introduces a new approach in the field of visual cryptography by extending the Knight's Tour Problem. Designed methodology enhances image encryption but without the need of cover images. It accepts numerical values as key and there is no constraint on the length of key. Another important aspect of the designed methodology is that only a single image has to be transmitted and the actual image can be retrieved hence this approach eliminates the need of transmitting multiple shares.
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.
Integrity signals
Registry
Cites
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.
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?
Recent literature has shown the utilization of the Knight's Tour in image encryption applications.
“Recent literature has shown the utilization of the Knight’s Tour in image encryption applications29.”
From Hyperchaotic fractional-order image encryption with Knight’s tour scrambling for satellite imagery (2026) · cites this paper as [29]
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
No references could be resolved yet.
Research works printed but not linked: 4
- M.Naor and A.Shamir. Visual Cryptography, Advances in Cryptography. Eurpocrypt'94, Lecture Notes in Computer Science, 1994; pp. 1-12.
- Zhongmin Wang, Gonzalo R. Arce and Giovanni Di Crescenzo. Halftone Visual Cryptography Via Error Diffusion. IEEE Trans. on Information Forensics And Security, 2009; vol. 4, no. 3, pp. 383-396.
- Sian-Jheng Lin and Wei-Ho Chung. A Probabilistic Model of (t,n) Visual Cryptography Scheme With Dynamic Group. IEEE Trans. on Information Forensics And Security, 2012; vol. 7, no. 1, pp. 197-207.
- R. De Prisco & A. De Santis. On the Relation of Random Grid and Deterministic Visual Cryptography. IEEE Trans. on Information Forensics and Security, 2014; vol. 9, no. 4, pp. 653-665.
Cited by
Sorted by citations
Hyperchaotic fractional-order image encryption with Knight’s tour scrambling for satellite imagery
Mamdouh, E., Aboshousha, A., & Alexan, W. (2026) · Scientific Reports · doi:10.1038/s41598-026-58982-1 · Cited by 3 · see citing works
- Authors
- Singh, M., Kakkar, A., & Singh, M.
- Affiliations
- Thapar Institute of Engineering & Technology (IN)
- Corresponding author
- Singh, Manpreet
- Venue
- Procedia Computer Science
- Publisher
- Elsevier BV
- Published
- 2015
- Volume
- 70
- Pages
- 245-250
- ISSN
- 1877-0509 (ISSN-L)
- OpenAlex
- W2173529548
- Cited by
- 18
- References
- 0
- Citations by year
- 2026: 1 · 2025: 1 · 2023: 5 · 2022: 2 · 2021: 4 · 2020: 1 · 2019: 2 · 2018: 1 · 2016: 1
- FWCI
- 0.27
- Type
- conference paper
- Language
- en
- Open access
- diamond
- doi.org
- Licence
- Locations
- Procedia Computer Science (publishedVersion, cc-by-nc-nd)
- Topics
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Chaos-based Image/Signal Encryption
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Steganography and Watermarking Techniques
- Physical Sciences › Computer Science › Artificial Intelligence › Computer Science and Engineering
- Keywords
- image encryption, knight's tour problem, visual cryptography, key length, image retrieval
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
