A novel image steganography technique based on quantum substitution boxes
The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Abstract
Abstract Substitution boxes play an essential role in designing secure cryptosystems. With the evolution of quantum technologies, current data security mechanisms may be broken due to their construction based on mathematical computation. Quantum walks, a universal quantum computational model, play an essential role in designing quantum algorithms. We utilize the benefits of quantum walks to present a novel technique for constructing substitution boxes (S-boxes) based on quantum walks (QWs). The performance of the presented QWs S-box technique is evaluated by S-box evaluation criteria, and our results prove that the constructed S-box has vital qualities for viable applications in security purposes. Furthermore, a new technique for image steganography is constructed. The proposed technique is an integrated mechanism between classical data hiding and quantum walks to achieve better security for the embedded data. The embedding and extraction procedures are controlled by QWs S-box. The inclusion of cryptographic QWs S-box ensures the security of both embedding and extraction phases. At the extraction phase, only the stego image and the secret values are needed for constructing the secret data. Experimental results demonstrate that the presented technique has a high-security, high embedding capacity and good visual quality.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Image quality assessment: from error visibility to structural similarity
Wang, Z., Bovik, A. C., Sheikh, H. R., & Simoncelli, E. P. (2004) · IEEE Transactions on Image Processing · doi:10.1109/tip.2003.819861 · Cited by 57,892
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539795293172 · Cited by 8,472
Quantum cryptography: Public key distribution and coin tossing
Bennett, C. H., & Brassard, G. (2014) · Theoretical Computer Science · doi:10.1016/j.tcs.2014.05.025 · Cited by 8,299
Quantum cryptography: Public key distribution and coin tossing
Bennett, C. H., & Brassard, G. (2020) · arXiv · doi:10.48550/arxiv.2003.06557 · Cited by 8,299
SOME BASIC CRYPTOGRAPHIC REQUIREMENTS FOR CHAOS-BASED CRYPTOSYSTEMS
ALVAREZ, G., & LI, S. (2006) · International Journal of Bifurcation and Chaos · doi:10.1142/s0218127406015970 · Cited by 2,119
Quantum random-walk search algorithm
Shenvi, N., Kempe, J., & Whaley, K. B. (2003) · Physical Review A · doi:10.1103/physreva.67.052307 · Cited by 1,150
Universal Computation by Quantum Walk
Childs, A. M. (2009) · Physical Review Letters · doi:10.1103/physrevlett.102.180501 · Cited by 1,002
Exponential algorithmic speedup by a quantum walk
Childs, A. M., Cleve, R., Deotto, E., Farhi, E., Gutmann, S., & Spielman, D. A. (2003) · Proceedings of the thirty-fifth annual ACM symposium on Theory of computing · doi:10.1145/780542.780552 · Cited by 825
Quantum algorithms for algebraic problems
Childs, A. M., & van Dam, W. (2010) · Reviews of Modern Physics · doi:10.1103/revmodphys.82.1 · Cited by 344
Kiktenko, E. O., Pozhar, N. O., Anufriev, M. N., Trushechkin, A. S., Yunusov, R. R., Kurochkin, Y. V., Lvovsky, A. I., & Fedorov, A. K. (2018) · Quantum Science and Technology · doi:10.1088/2058-9565/aabc6b · Cited by 264
Cited by
Teng, L., Wang, X., & Xian, Y. (2022) · Information Sciences · doi:10.1016/j.ins.2022.05.032 · Cited by 224
Secure Data Encryption Based on Quantum Walks for 5G Internet of Things Scenario
El-Latif, A. A. A., Abd-El-Atty, B., Mazurczyk, W., Fung, C., & Venegas-Andraca, S. E. (2020) · IEEE Transactions on Network and Service Management · doi:10.1109/tnsm.2020.2969863 · Cited by 217
Self-citationAbd El-Latif, A. A., Abd-El-Atty, B., Amin, M., & Iliyasu, A. M. (2020) · Scientific Reports · doi:10.1038/s41598-020-58636-w · Cited by 155
Self-citationProviding End-to-End Security Using Quantum Walks in IoT Networks
El-Latif, A. A. A., Abd-El-Atty, B., Venegas-Andraca, S. E., Elwahsh, H., Piran, M. J., Bashir, A. K., Song, O.-Y., & Mazurczyk, W. (2020) · IEEE Access · doi:10.1109/access.2020.2992820 · Cited by 89
“Then, Yang et al [34] presented a new scheme for constructing hash function using controlled two-walker QW and introduced its application to image encryption, Next, El-Latif et al [35] constructed a substitution-box mechanism based on two-walker QW and presented its application in image steganography.”
MethodSelf-citationAhmad, M., Al-Solami, E., Alghamdi, A. M., & Yousaf, M. A. (2020) · IEEE Access · doi:10.1109/access.2020.3001868 · Cited by 71
“…, 169 , 256 , 196 , 240 , 117 , 198 , 18 , 254 , 49 , 189 , 123 , 31 , , 224 , 69 , , 143 , 228 , 108 , 167 , , 152 , 182 , 208 , 130 , 129 , 171 , 19 , 141 , 84 , 99 , 54 , 165 , 14 , 142 , 199 , 6 , 8 , 124 , 212 , 173 , 119 , 250 , 48 , 91 , 207 , 33 , 197 , 177 , 154 , 2 , 87 , 50 , 55 , 57)…”
Method
Metadata
- Authors
- Abd EL-Latif, A. A., Abd-El-Atty, B., & Venegas-Andraca, S. E.
- Venue
- Optics & Laser Technology
- Publisher
- Elsevier BV
- Published
- 2019-08
- Volume
- 116
- Pages
- 92-102
- ISSN
- 0030-3992 (ISSN-L)
- OpenAlex
- W2923032343
- Cited by
- 176
- References
- 10
- FWCI
- 12.62
- Type
- journal article
- Language
- en
- Open access
- closed
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
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.