The DOI matches its Crossref record.
Image encryption using the Sudoku matrix
Abstract
This paper introduces a new effective and lossless image encryption algorithm using a Sudoku Matrix to scramble and encrypt the image. The new algorithm encrypts an image through a three stage process. In the first stage, a reference Sudoku matrix is generated as the foundation for the encryption and scrambling processes. The image pixels' intensities are then changed by using the reference Sudoku matrix values, and then the pixels' positions are shuffled using the Sudoku matrix as a mapping process. The advantages of this method is useful for efficiently encrypting a variety of digital images, such as binary images, gray images, and RGB images without any quality loss. The security keys of the presented algorithm are the combination of the parameters in a 1D chaotic logistic map, a parameter to control the size of Sudoku Matrix and the number of iteration times desired for scrambling. The possible security key space is extremely large. The principles of the presented scheme could be applied to provide security for a variety of systems including image, audio and video systems.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cited by
Sorted by citations
Local Shannon entropy measure with statistical tests for image randomness
Wu, Y., Zhou, Y., Saveriades, G., Agaian, S., Noonan, J. P., & Natarajan, P. (2013) · Information Sciences · doi:10.1016/j.ins.2012.07.049 · Cited by 722
“chaotic system based image ciphers [6, 12, 15, 16, 22, 28, 29, 37, 40, 42, 54, 55, 63, 64], SCAN language based algorithms [13, 14], transform based algorithms [35, 38, 49, 60, 65].”
MethodInfluentialSelf-citation
Metadata
- Authors
- Wu, Y., Zhou, Y., Noonan, J. P., Panetta, K., & Agaian, S.
- Affiliations
- Tufts University (US)
- The University of Texas at San Antonio (US)
- Venue
- SPIE Proceedings
- Publisher
- SPIE
- Published
- 2010-04-23
- Volume
- 7708
- Pages
- 77080P
- ISSN
- 0277-786X (ISSN-L)
- OpenAlex
- W2041437267
- Cited by
- 43
- References
- 0
- Citations by year
- 2024: 2 · 2023: 2 · 2022: 3 · 2021: 6 · 2019: 3 · 2018: 3 · 2017: 1 · 2016: 3 · 2015: 4 · 2014: 5 · 2013: 6 · 2012: 3
- FWCI
- 3.02
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE (publishedVersion)
- 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 › Computer Vision and Pattern Recognition › Advanced Steganography and Watermarking Techniques
- Keywords
- image encryption, pixel scrambling, chaotic logistic map, key space, binary images, RGB images, grayscale images
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