Quantum Hash function and its application to privacy amplification in quantum key distribution, pseudo-random number generation and image encryption
Open accessThe DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Abstract
Quantum information and quantum computation have achieved a huge success during the last years. In this paper, we investigate the capability of quantum Hash function, which can be constructed by subtly modifying quantum walks, a famous quantum computation model. It is found that quantum Hash function can act as a hash function for the privacy amplification process of quantum key distribution systems with higher security. As a byproduct, quantum Hash function can also be used for pseudo-random number generation due to its inherent chaotic dynamics. Further we discuss the application of quantum Hash function to image encryption and propose a novel image encryption algorithm. Numerical simulations and performance comparisons show that quantum Hash function is eligible for privacy amplification in quantum key distribution, pseudo-random number generation and image encryption in terms of various hash tests and randomness tests. It extends the scope of application of quantum computation and quantum information.
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
Quantum cryptography based on Bell’s theorem
Ekert, A. K. (1991) · Physical Review Letters · doi:10.1103/physrevlett.67.661 · Cited by 10,777 · cited 3×
“QKD generally contains three steps: (1) raw key sifting, (2) error reconciliation, and (3) privacy amplification.”
BackgroundQuantum 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 · cited 6×
“(2) Run the one-dimensional two-particle discrete-time QW on a circle under the control of the message and generate the output hash value, i.”
BackgroundInfluentialQuantum cryptography: Public key distribution and coin tossing
Bennett, C. H., & Brassard, G. (2020) · arXiv · doi:10.48550/arxiv.2003.06557 · Cited by 8,299
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 · cited 1×
“That is, the n th bit of the message controls the n th step of the walk, i.e., applying the Grover operator C 0 16 or the coin operator C 1 17 on the coin state.”
MethodTestU01: A C library for empirical testing of random number generators
L'Ecuyer, P., & Simard, R. (2007) · ACM Transactions on Mathematical Software · doi:10.1145/1268776.1268777 · Cited by 1,014
A Statistical Measure of Complexity
López-Ruiz, R., Mancini, H. L., & Calbet, X. (1995) · Physics Letters A · doi:10.1016/0375-9601(95)00867-5 · Cited by 920
Cited by
Distributed secure quantum machine learning
Sheng, Y.-B., & Zhou, L. (2017) · Science Bulletin · doi:10.1016/j.scib.2017.06.007 · Cited by 245
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
Abd 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
Providing 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.”
Method
Metadata
- Authors
- Yang, Y.-G., Xu, P., Yang, R., Zhou, Y.-H., & Shi, W.-M.
- Venue
- Scientific Reports
- Published
- 2016-01-29
- Volume
- 6
- Issue
- 1
- Pages
- 19788-19788
- ISSN
- 2045-2322 (ISSN-L)
- OpenAlex
- W2410239325
- Cited by
- 105
- References
- 6
- FWCI
- 8.85
- Type
- journal article
- Language
- en
- Open access
- gold
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.