SHAH: Hash Function Based on Irregularly Decimated Chaotic Map
Open accessAbstract
We present a new hash function based on irregularly decimated chaotic map, in this article. The hash algorithm called SHAH is based on two Tinkerbell maps filtered with irregular decimation rule. We evaluated the novel function using distribution analysis, sensitivity analysis, static analysis of diffusion, static analysis of confusion, and collision analysis. The experimental data show that SHAH satisfied valuable level of computer security.
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 [31]
The paper’s “Initial Key Size Calculation” section states that its proposed generator has an initial key size greater than 2^199 and is secure against brute-force key searches. The comparison tables in “Statistic Analysis of Diffusion and Statistic Analysis of Confusion” compare hash-output properties, not key-space sizes, so they do not support the claimed key-space comparability to other text hashing schemes. Page numbers were not available in our copy. (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
Communication Theory of Secrecy Systems
Shannon, C. E. (1949) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1949.tb00928.x · Cited by 9,440 · cited 2× · see citing works
“From a historical point of view, Shannon, with the publication in 1949 of his paper, Communication Theory of Secrecy Systems [23], introduced the idea of two methods for frustrating a statistical analysis of encryption algorithms: confusion and diffusion.”
BackgroundBassham, L. E., Rukhin, A. L., Soto, J., Nechvatal, J. R., Smid, M. E., Barker, E. B., Leigh, S. D., Levenson, M., Vangel, M., Banks, D. L., et al. (2010) · NIST Special Publication 800-22 Revision 1a · doi:10.6028/nist.sp.800-22r1a · Cited by 3,617 · see citing works
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 · see citing works
<i>Chaos: An Introduction to Dynamical Systems</i>
Alligood, K. T., Sauer, T. D., Yorke, J. A., & Crawford, J. D. (1997) · Physics Today · doi:10.1063/1.882006 · Cited by 1,469 · see citing works
DIEHARD : A battery of tests of randomness
Marsaglia, G. (1996) · Medical Entomology and Zoology · Cited by 341 · see citing works
Coppersmith, D., Krawczyk, H., & Mansour, Y. (2007) · Springer eBooks · doi:10.1007/3-540-48329-2_3 · Cited by 307 · see citing works
Pseudo-random number generator based on discrete-space chaotic map
Lambić, D., & Nikolić, M. (2017) · Nonlinear Dynamics · doi:10.1007/s11071-017-3656-1 · Cited by 96 · see citing works
Analysis and improvement of a chaos-based Hash function construction
Deng, S., Li, Y., & Xiao, D. (2009) · Communications in Nonlinear Science and Numerical Simulation · doi:10.1016/j.cnsns.2009.05.065 · Cited by 88 · 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
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
Novel secure pseudo-random number generation scheme based on two Tinkerbell maps
Stoyanov, B. P., & Kordov, K. (2015) · Advanced Studies in Theoretical Physics · doi:10.12988/astp.2015.5342 · Cited by 62 · see citing works
Self-citationA 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
Parallel hash function construction based on coupled map lattices
Wang, Y., Wong, K., & Xiao, D. (2010) · Communications in Nonlinear Science and Numerical Simulation · doi:10.1016/j.cnsns.2010.10.001 · Cited by 58 · see citing works
A novel method for one-way hash function construction based on spatiotemporal chaos
Ren, H., Wang, Y., Xie, Q., et al. (2009) · Chaos Solitons & Fractals · doi:10.1016/j.chaos.2009.03.168 · Cited by 43 · see citing works
A New Pseudo-Random Number Generator Based on Two Chaotic Maps
Francois, M., Grosges, T., Barchiesi, D., et al. (2013) · Informatica · doi:10.15388/informatica.2013.391 · Cited by 42 · see citing works
A CHAOS-BASED CRYPTOGRAPHIC HASH FUNCTION FOR MESSAGE AUTHENTICATION
Kwok, H. S., & Tang, K. S. (2005) · International Journal of Bifurcation and Chaos · doi:10.1142/s0218127405014489 · Cited by 42 · see citing works
A structure-based chaotic hashing scheme
Kanso, A. A., & Ghebleh, M. (2015) · Nonlinear Dynamics · doi:10.1007/s11071-015-1970-z · Cited by 40 · see citing works
Chaotic hash function based on circular shifts with variable parameters
Li, Y., & Li, X. (2016) · Chaos Solitons & Fractals · doi:10.1016/j.chaos.2016.08.014 · Cited by 36 · see citing works
IRREGULARLY DECIMATED CHAOTIC MAP(S) FOR BINARY DIGITS GENERATIONS
Kanso, A. A., & Smaoui, N. (2009) · International Journal of Bifurcation and Chaos · doi:10.1142/s0218127409023573 · Cited by 22 · see citing works
A Novel Pseudorandom Bit Generator Based on Chirikov Standard Map Filtered with Shrinking Rule
Stoyanov, B. P., & Kordov, K. (2014) · Mathematical Problems in Engineering · doi:10.1155/2014/986174 · Cited by 21 · see citing works
Self-citationLin, Z., Yu, S., & Lü, J. (2017) · International Journal of Bifurcation and Chaos · doi:10.1142/s0218127417501061 · Cited by 17 · see citing works
Pseudo-random bit generator based on Chebyshev map
Stoyanov, B. P. (2013) · AIP conference proceedings · doi:10.1063/1.4827248 · Cited by 16 · see citing works
Self-citationChaotic cryptographic scheme and its randomness evaluation
Stoyanov, B. P. (2012) · AIP conference proceedings · doi:10.1063/1.4758983 · Cited by 15 · see citing works
Self-citationPseudo-random bit generation algorithm based on Chebyshev polynomial and Tinkerbell map
Stoyanov, B. P. (2014) · Applied Mathematical Sciences · doi:10.12988/ams.2014.48676 · Cited by 12 · see citing works
Self-citationUsing Circle Map for Audio Encryption Algorithm
Kordov, K., & Bonchev, L. (2017) · Mathematical and Software Engineering (Shumen University) · Cited by 12 · see citing works
Self-citationYet Another Pseudorandom Number Generator
Stoyanov, B. P., Szczypiorski, K., & Kordov, K. (2017) · International Journal of Electronics and Telecommunications · doi:10.1515/eletel-2017-0026 · Cited by 12 · see citing works
Self-citationUsing circle map in pseudorandom bit generation
Stoyanov, B. P. (2014) · AIP conference proceedings · doi:10.1063/1.4902309 · Cited by 11 · see citing works
Self-citationModified pseudo-random bit generation scheme based on two circle maps and XOR function
Kordov, K. (2014) · Applied Mathematical Sciences · doi:10.12988/ams.2015.411887 · Cited by 11 · see citing works
Self-citationHristov, H. (2018) · Mathematical and Software Engineering (Shumen University) · Cited by 8 · see citing works
Cantorian Sets, Fuzzy Sets, Rough Sets and Fregean Sets
Apostoli, P., & Kanda, A. (2002) · Bulletin of the Polish Academy of Sciences Technical Sciences · Cited by 4 · see citing works
HASH FUNCTION CONSTRUCTION BASED ON THE CHAOTIC LOOK-UP TABLE WITH CHANGEABLE PARAMETER
Li, Y., Xiao, D., & Deng, S. (2011) · International Journal of Modern Physics B · doi:10.1142/s0217979211102241 · Cited by 4 · see citing works
Flagged first, then by citations
Research works printed but not linked: 3
- A. Kanso and N. Smaoui, "Irregularly decimated chaotic map(s) for binary digit generation", International Journal of Bifurcation and Chaos 19 (4), 1169-1183 (2009).
- W. Meier and O. Staffelbach, "The self-shrinking generator", In: Blahut R.E., Costello D.J., Maurer U., Mittelholzer T. (eds) Communications and Cryptography, Springer, Boston, MA, The Springer International Series in Engineering and Computer Science (Communications and Information Theory), vol. 276, 1994, pp. 287-295.
- IEEE Computer Society (2008), 754-2008 -IEEE standard for floating- point arithmetic, Revision of ANSI/IEEE Std 754-1985, 10.1109/ IEEESTD.2008.4610935. · DOI
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
- Authors
- Todorova, M., Stoyanov, B., Szczypiorski, K., & Kordov, K.
- Affiliations
- Shumen University (BG)
- Warsaw University of Technology (PL)
- Venue
- International Journal of Electronics and Telecommunications
- Published
- 2018-11-15
- Pages
- 457-457
- ISSN
- 0867-6747 (ISSN-L)
- 2300-1933
- 2081-8491
- OpenAlex
- W2887914272
- Cited by
- 9
- References
- 31
- Citations by year
- 2024: 1 · 2021: 5 · 2020: 2 · 2019: 1
- FWCI
- 1.00
- Type
- journal article
- Language
- pl
- Open access
- gold
- doi.org
- Locations
- International Journal of Electronics and Telecommunications (publishedVersion)
- International Journal of Electronics and Telecommunications (publishedVersion, cc-by-nc)
- arXiv (Cornell University) (submittedVersion)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
- arXiv (Cornell University)
- Funders
- European Regional Development Fund
- Topics
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Chaos-based Image/Signal Encryption
- Physical Sciences › Mathematics › Mathematical Physics › Mathematical Dynamics and Fractals
- Physical Sciences › Computer Science › Artificial Intelligence › Cryptographic Implementations and Security
- Keywords
- chaotic maps, hash function security, collision resistance, diffusion analysis, sensitivity analysis, distribution analysis
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
