×

Constructing keyed hash algorithm using enhanced chaotic map with varying parameter. (English) Zbl 1459.94126

Summary: A keyed hash algorithm is proposed based on 1-D enhanced quadratic map (EQM) with varying parameter. Three measures, including assigning unique one-time keys, key expansion, and hash length extension, are taken to enhance its security. First, the message is transformed into a parameter sequence for the EQM to be absorbed, and then the extended keys are generated as the initial values of the EQM. Finally, the EQM is iterated with redundant loops to transform the variable values into a hash value. The algorithm is so flexible that it can generate hash value with different lengths of 256, 512, 1024, or more bits through a parameter switcher, and redundant loops can eliminate the transient effect of chaos and mitigate the increasing threat of the side-channel attack. Security evaluations and comparison demonstrated its practicability and reliability.

MSC:

94A60 Cryptography
37D45 Strange attractors, chaotic dynamics of systems with hyperbolic behavior

Software:

Keccak
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Nofer, M.; Gomber, P.; Hinz, O.; Schiereck, D., Blockchain, Business & Information Systems Engineering, 59, 3, 183-187 (2017) · doi:10.1007/s12599-017-0467-3
[2] Schiereck, M. J., Sha-3 Standard: Permutation-Based Hash and Extendable-Output Functions (2015), Gaithersburg, MD, USA: Federal Inf. Process. Stds. (NIST FIPS)-202, Gaithersburg, MD, USA
[3] Wang, X.; Yin, Y. L.; Yu, H., Finding collisions in the full SHA-1, Advances in Cryptology-CRYPTO 2005, 3621, 17-36 (2005) · Zbl 1145.94454 · doi:10.1007/11535218_2
[4] Sotirov, A.; Stevens, M.; Appelbaum, J., MD5 considered harmful today, creating a rogue CA certificate, Proceedings of the 25th Annual Chaos Communication Congress
[5] Fox-Brewster, T., Google Just “Shattered” an Old Crypto Algorithm-Here’s Why That’s Big for Web Security (2017), Waltham, MA, USA: Forbes, Waltham, MA, USA
[6] Guo, J.; Liao, G.; Liu, G.; Liu, M.; Qiao, K.; Song, L., Practical collision attacks against round-reduced SHA-3, Journal of Cryptology, 33, 1, 228-270 (2019) · Zbl 1455.94160 · doi:10.1007/s00145-019-09313-3
[7] Liu, M. A.; Jamali, S.; Khasmakhi, N., A novel keyed parallel hashing scheme based on a new chaotic system, Chaos, Solitons & Fractals, 87, 216-225 (2016) · Zbl 1355.94044 · doi:10.1016/j.chaos.2016.04.007
[8] Xiao, D.; Liao, X.; Deng, S., One-way Hash function construction based on the chaotic map with changeable-parameter, Chaos, Solitons & Fractals, 24, 1, 65-71 (2005) · Zbl 1068.94019 · doi:10.1016/s0960-0779(04)00456-4
[9] Guo, W.; Wang, X.; He, D.; Cao, Y., Cryptanalysis on a parallel keyed hash function based on chaotic maps, Physics Letters A, 373, 36, 3201-3206 (2009) · Zbl 1233.94016 · doi:10.1016/j.physleta.2009.07.016
[10] Kwok, H. S.; Tang, W. K. S., A chaos-based cryptographic hash function for message authentication, International Journal of Bifurcation and Chaos, 15, 12, 4043-4050 (2005) · Zbl 1096.94031 · doi:10.1142/s0218127405014489
[11] Deng, S.; Li, Y.; Xiao, D., Analysis and improvement of a chaos-based Hash function construction, Communications in Nonlinear Science and Numerical Simulation, 15, 5, 1338-1347 (2010) · Zbl 1221.94043 · doi:10.1016/j.cnsns.2009.05.065
[12] Liu, H.; Kadir, A.; Liu, J., Keyed hash function using hyper chaotic system with time-varying parameters perturbation, IEEE Access, 7, 1, 37211-37219 (2019) · doi:10.1109/access.2019.2896661
[13] Teh, J. S.; Tan, K.; Alawida, M., A chaos-based keyed hash function based on fixed point representation, Cluster Computing, 22, 2, 649-660 (2019) · doi:10.1007/s10586-018-2870-z
[14] Li, Y.; Ge, G., Cryptographic and parallel hash function based on cross coupled map lattices suitable for multimedia communication security, Multimedia Tools and Applications, 78, 13, 17973-17994 (2019) · doi:10.1007/s11042-018-7122-y
[15] Li, Y., Collision analysis and improvement of a hash function based on chaotic tent map, Optik, 127, 10, 4484-4489 (2016) · doi:10.1016/j.ijleo.2016.01.176
[16] Li, Y.; Li, X., Chaotic hash function based on circular shifts with variable parameters, Chaos, Solitons & Fractals, 91, 639-648 (2016) · Zbl 1372.94434 · doi:10.1016/j.chaos.2016.08.014
[17] Li, Y.; Ge, G.; Xia, D., Chaotic hash function based on the dynamic S-Box with variable parameters, Nonlinear Dynamics, 84, 4, 2387-2402 (2016) · Zbl 1347.94044 · doi:10.1007/s11071-016-2652-1
[18] Horálek, J.; Holík, F.; Horák, O.; Petr, L.; Sobeslav, V., Analysis of the use of rainbow tables to break hash, Journal of Intelligent & Fuzzy Systems, 32, 2, 1523-1534 (2017) · doi:10.3233/jifs-169147
[19] Petr, H.-J.; Hong, S.; Shin, J., A novel secure and efficient hash function with extra padding against rainbow table attacks, Cluster Computing, 21, 1, 1161-1173 (2018) · doi:10.1007/s10586-017-0886-4
[20] Moreira, F. J. S., Chaotic Dynamics of Quadratic Maps (1993), Colchester, UK: IMPA, Colchester, UK
[21] Liu, H.; Zhang, Y.; Kadir, A.; Xu, Y., Image encryption using complex hyper chaotic system by injecting impulse into parameters, Applied Mathematics and Computation, 360, 83-93 (2019) · Zbl 1428.94030 · doi:10.1016/j.amc.2019.04.078
[22] Xu, A.; Yahyaoui, H.; Almulla, M., Keyed hash function based on a chaotic map, Information Sciences, 186, 1, 249-264 (2012) · Zbl 1239.94053 · doi:10.1016/j.ins.2011.09.008
[23] Kanso, A.; Ghebleh, M., A fast and efficient chaos-based keyed hash function, Communications in Nonlinear Science and Numerical Simulation, 18, 1, 109-123 (2013) · Zbl 1277.94028 · doi:10.1016/j.cnsns.2012.06.019
[24] Bertoni, G.; Daemen, J.; Peeters, M.; Van Assche, G., The keccak sponge function family, 2011, submission to NIST’s SHA-3 competition (2011)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.