Keyed Hash Function Using Hyper Chaotic System with Time-Varying Parameters Perturbation
Open accessAbstract
Secure hash function plays an important role in cryptography. This paper constructs a hash algorithm using the hyperchaotic Lorenz system, which serves as a sponge function to absorb input message via multiple parameters time-varying perturbation. First, the input message is divided into four 1D arrays, to generate four perturbation sequences via parameter updating rule, the perturbed parameters are still within their significant intervals, to make the system remain a hyperchaotic state. Each iteration of the discrete hyperchaotic system uses updated parameters, and the last state variable values are extracted to generate a len-bit hash value by transformation algorithm. The algorithm is so flexible that it can generate 256, 512, 1024 or longer hash value through parameter switcher. The experimental evaluation and comparison demonstrated the hash function's resistance to differential attack and second pre-image attack. The proposed hash function can be applied in the identification, information integrity, and figure signature.
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?
This key space is high enough to resist brute force attacks and is comparable to state-of-the-art text hashing schemes, for example, [30,31].
“This key space is high enough to resist brute force attacks and is comparable to state-of-the-art text hashing schemes, for example, [30,31].”
From A Secure and Robust Image Hashing Scheme Using Gaussian Pyramids (2019) · cites this paper as [30]
The Key Space Analysis section (page not available) reports a key space of 10^75 for the cited keyed hash function and says it resists brute-force attacks. The paper is an example of a text-hashing scheme, but our copy does not establish that the citing paper’s key space is comparable to its key space. (LLM, conf=0.83)
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
Finding Collisions in the Full SHA-1
Wang, X., Yin, Y. L., & Yu, H. (2005) · Lecture notes in computer science · doi:10.1007/11535218_2 · Cited by 1,420 · see citing works
Report on Post-Quantum Cryptography
Chen, L., Jordan, S., Liu, Y.-K., Moody, D., Peralta, R., Perlner, R., & Smith-Tone, D. (2016) · doi:10.6028/nist.ir.8105 · Cited by 1,034 · see citing works
SHA-3 standard: permutation-based hash and extendable-output functions
National Institute of Standards and Technology (US) (2015) · doi:10.6028/nist.fips.202 · Cited by 783 · see citing works
A symmetric image encryption algorithm based on mixed linear–nonlinear coupled map lattice
Zhang, Y.-Q., & Wang, X.-Y. (2014) · Information Sciences · doi:10.1016/j.ins.2014.02.156 · Cited by 566 · see citing works
A new image encryption algorithm based on non-adjacent coupled map lattices
Zhang, Y.-Q., & Wang, X.-Y. (2015) · Applied Soft Computing · doi:10.1016/j.asoc.2014.09.039 · Cited by 360 · see citing works
A hyperchaos generated from Lorenz system
Wang, X., & Wang, M. (2008) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2008.02.020 · Cited by 285 · see citing works
Hyperchaos generated from the Lorenz chaotic system and its control
Jia, Q. (2007) · Physics Letters A · doi:10.1016/j.physleta.2007.02.024 · Cited by 238 · see citing works
A novel lossless color image encryption scheme using 2D DWT and 6D hyperchaotic system
Wu, X., Wang, D., Kurths, J., & Kan, H. (2016) · Information Sciences · doi:10.1016/j.ins.2016.02.041 · Cited by 222 · see citing works
Chaos in the fractional-order complex Lorenz system and its synchronization
Luo, C., & Wang, X. (2012) · Nonlinear Dynamics · doi:10.1007/s11071-012-0656-z · Cited by 153 · see citing works
Cryptographic Hash Functions: A Review
Sobti, R. (2012) · Cited by 145 · see citing works
An image encryption algorithm based on compound homogeneous hyper-chaotic system
Zhu, H., Zhang, X., Yu, H., Zhao, C., & Zhu, Z. (2017) · Nonlinear Dynamics · doi:10.1007/s11071-017-3436-y · Cited by 93 · see citing works
Keyed hash function based on a chaotic map
Kanso, A. A., Yahyaoui, H., & Almulla, M. (2011) · Information Sciences · doi:10.1016/j.ins.2011.09.008 · Cited by 79 · see citing works
MD5 considered harmful today, creating a rogue CA certificate
Sotirov, A., Stevens, M., Appelbaum, J., et al. (2008) · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · Cited by 75 · see citing works
A fast and efficient chaos-based keyed hash function
Kanso, A. A., & Ghebleh, M. (2012) · Communications in Nonlinear Science and Numerical Simulation · doi:10.1016/j.cnsns.2012.06.019 · Cited by 68 · see citing works
Color image encryption scheme using coupled hyper chaotic system with multiple impulse injections
Kadir, A., Aili, M., & Sattar, M. (2016) · Optik · doi:10.1016/j.ijleo.2016.10.036 · Cited by 68 · see citing works
Self-citationA novel keyed parallel hashing scheme based on a new chaotic system
Chenaghlu, M., Jamali, S., & Nikzad-Khasmakhi, N. (2016) · Chaos Solitons & Fractals · doi:10.1016/j.chaos.2016.04.007 · Cited by 62 · see citing works
A Simple Secure Hash Function Scheme Using Multiple Chaotic Maps
Ahmad, M., Khurana, S., Singh, S., & Al-Sharari, H. D. (2017) · 3D Research · doi:10.1007/s13319-017-0123-1 · Cited by 60 · see citing works
A chaos-based keyed hash function based on fixed point representation
Teh, J. S., Tan, K., & Alawida, M. (2019) · Cluster Computing · doi:10.1007/s10586-018-2870-z · Cited by 58 · see citing works
Bursting phenomenon in a piecewise mechanical system with parameter perturbation in stiffness
Li, X., & Hou, J. (2016) · International Journal of Non-Linear Mechanics · doi:10.1016/j.ijnonlinmec.2016.01.014 · Cited by 49 · see citing works
Chaotic hash function based on the dynamic S-Box with variable parameters
Li, Y., Ge, G., & Xia, D. (2016) · Nonlinear Dynamics · doi:10.1007/s11071-016-2652-1 · Cited by 45 · see citing works
A fast and efficient hash function based on generalized chaotic mapping with variable parameters
Li, Y., Li, X., & Liu, X. (2016) · Neural Computing and Applications · doi:10.1007/s00521-015-2158-7 · Cited by 39 · see citing works
Analyzing Devaney Chaos of a Sine–Cosine Compound Function System
Zhu, H., Qi, W., Ge, J., et al. (2018) · International Journal of Bifurcation and Chaos · doi:10.1142/s0218127418501766 · Cited by 34 · see citing works
Kumar, A., Fatima, A., & Nishchal, N. K. (2018) · Optics Communications · doi:10.1016/j.optcom.2018.07.027 · Cited by 23 · see citing works
Cryptographic one-way hash function generation using twelve-terms 4D nonlinear system
Ahmad, M., Singh, S., & Khurana, S. (2018) · International Journal of Information Technology · doi:10.1007/s41870-018-0199-8 · Cited by 16 · see citing works
Modified function projective lag synchronization in fractional-order chaotic (hyperchaotic) systems
Luo, C., & Xingyuan, W. (2013) · Journal of Vibration and Control · doi:10.1177/1077546312472921 · Cited by 15 · see citing works
Luo, C. (2015) · Journal of Computational and Nonlinear Dynamics · doi:10.1115/1.4031956 · Cited by 11 · see citing works
Design of secure Cryptographic hash function using soft computing techniques
Santhanalakshmi, S., Sangeeta, K., & Patra, G. K. (2017) · Cited by 7 · see citing works
Building a 256-bit hash function on a stronger MD variant
Tiwari, H., & Asawa, K. (2014) · Open Computer Science · doi:10.2478/s13537-014-0204-7 · Cited by 5 · see citing works
Flagged first, then by citations
Cited by
Sorted by citations
A Secure and Robust Image Hashing Scheme Using Gaussian Pyramids
Bashir, I., Ahmed, F., Ahmad, J., Boulila, W., & Alharbi, N. (2019) · Entropy · doi:10.3390/e21111132 · Cited by 20 · see citing works
“This key space is high enough to resist brute force attacks and is comparable to state-of-the-art text hashing schemes, for example, [30,31] .”
Background
- Authors
- Liu, H., Kadir, A., & Liu, J.
- Affiliations
- University of Jinan (CN)
- Xinjiang University of Finance and Economics (CN)
- Venue
- IEEE Access
- Published
- 2019
- Volume
- 7
- Pages
- 37211-37219
- ISSN
- 2169-3536 (ISSN-L)
- OpenAlex
- W2913241791
- Cited by
- 47
- References
- 28
- Citations by year
- 2026: 1 · 2025: 8 · 2024: 3 · 2023: 7 · 2022: 7 · 2021: 7 · 2020: 10 · 2019: 4
- FWCI
- 3.13
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Locations
- IEEE Access (publishedVersion)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
- Funders
- National Natural Science Foundation of China (61662073, 61773010)
- Topics
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Chaos-based Image/Signal Encryption
- Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Chaos control and synchronization
- Physical Sciences › Computer Science › Artificial Intelligence › Cryptographic Implementations and Security
- Keywords
- keyed hash functions, hyperchaotic Lorenz system, sponge functions, discrete-time chaotic systems, hash function design, differential attack resistance, information integrity, chaos-based cryptography
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
