A chaos-based keyed hash function based on fixed point representation

Teh, Je Sen; Tan, Kaixuan; Alawida, Moatsum

doi:10.1007/s10586-018-2870-z

Cited by 48 publications

(23 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…e following statistics are used to test the performance of the hash algorithm. Here, len is the length of the hash value, N is the number of tests, B i denotes the number of different bits between the hash values obtained in the i-th test, B min denotes the minimum number of different bits, B max denotes the maximum number of different bits, B denotes the mean changed bit number, P denotes the mean changed probability, ΔB denotes the standard deviation of numbers of changed bits, and ΔP denotes the standard deviation [13].…”

Section: Statistical Analysis Of Confusion and Diffusionmentioning

confidence: 99%

“…Liu et al [12] proposed a keyed hash function using a hyperchaotic system with time-varying parameter perturbation, which is flexible and has a larger key space. Teh et al [13] designed a keyed hash function based on the logistic map with fixed point representation. Li et al designed four 128-bit parallel hash functions based on cross-coupled map lattices [14], tent map [15], circular shifts [16], and dynamic S-box [17] with varying parameters.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Constructing Keyed Hash Algorithm Using Enhanced Chaotic Map with Varying Parameter

Liu

Kadir

et al. 2020

Mathematical Problems in Engineering

View full text Add to dashboard Cite

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.

show abstract

Section: Statistical Analysis Of Confusion and Diffusionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Constructing Keyed Hash Algorithm Using Enhanced Chaotic Map with Varying Parameter

Liu

Kadir

et al. 2020

Mathematical Problems in Engineering

View full text Add to dashboard Cite

show abstract

“…The partial breaking of families of SHA2 and SHA3 proves the structural flaw was not due to RO and Sponge design principles [17]. JS Teh et al proposed chaotic hash function based on fixed point representation [18]. JS Teh work outperformed the other fixed point chaotic hash functions.…”

Section: Related Workmentioning

confidence: 99%

Design of Dynamic Digest through Polynomial Product for Improved Avalanche Effect on Keyless Hash Function

Karthik¹,

BALA²

2019

IJRTE

View full text Add to dashboard Cite

The integrity violation of remote data draws more significance after the advent of cloud solutions. The conventional digest functions like MD4, MD5, SHA-160, SHA-2 family, and SHA-3 family provide a more elegant solution for the aforesaid problem. But the breaking of MD4, MD5, and SHA-160 algorithms and the partisal breaking of the families of SHA-2 and SHA-3 raises concerns about their use on cryptographic applications. In addition, they do not provide the facility to decide the hash output length dynamically at runtime. This work attempts to address the aforesaid problems through polynomial products. The proposed design uses a higher-order two-variables polynomial function to establish the hash output. The application of polynomial function at the block-level helps the proposed design to produce variable length hash output. The experimental analysis of avalanche response, the effect of an avalanche on the hash output nibbles, and the analysis of confusion and diffusion prove the proposed design performs exceedingly well than the conventional algorithms. Therefore, the proposed design could be considered as a more suitable alternative for the conventional keyless digest function in the perspective of security. Index Terms: Data Integrity confirmation through polynomial function, Dynamic digest function, Enhancing the avalanche effect through polynomial function, One-way dynamic digest function, Polynomial function for message authentication. He is doing his research in the domainof data Security and in particular devising a new Keyless Hash Functions using MDC. He is also actively involved in designing polymorphic symmetric encryption algorithms to address issues related with all encryption attacks including Brute force. The other areas of interest includes network security, information security, design of encryption algorithms and writing Multi-agent based applications for network problems .Dr.SHANTHI BALA is working as assistant professor in the department of Computer science, School of Engineering and Technology, Pondicherry University, Puducherry. She has published more than 25 papers in reputed journals and right now she is guiding 4 research scholars in the domain of Data mining , Network Security and Data security. She has published several papers in various national and international conferences. She has been actively involved in the design of new hash algorithms for issues related with integrity breaches on remote data. She is also involved in designing new encryption algorithm for providing strong resistance to all forms of crypto attacks. The other area of interest includes Knowledge Engineering, Cloud Computing and Internet of Things.

show abstract

“…Akhavan et al have proposed a chaotic hash function based on piecewise nonlinear chaotic map and a 1D chaotic map in parallel mode [24] whereas Teh et al have proposed a keyed hash function based on logistic map realized with fixed point representation [30]. Li et al have proposed a new chaotic hash function based on circular shifts and variable parameters, piecewise linear chaotic map and one-way coupled map lattice [31].…”

Section: Introductionmentioning

confidence: 99%

A New Hash Function Based on Chaotic Maps and Deterministic Finite State Automata

et al. 2020

Self Cite

View full text Add to dashboard Cite

In this paper, a new chaos-based hash function is proposed based on a recently proposed structure known as the deterministic chaotic finite state automata (DCFSA). Out of its various configurations, we select the forward and parameter permutation variant, DCFSA FW P due to its desirable chaotic properties. These properties are analogous to hash function requirements such as diffusion, confusion and collision resistance. The proposed hash function consists of six machine states and three simple chaotic maps. This particular structure of DCFSA can process larger message blocks (leading to higher hashing rates) and optimizes its randomness. The proposed hash function is analyzed in terms of various security aspects and compared with other recently proposed chaos-based hash functions to demonstrate its efficiency and reliability. Results indicate that the proposed hash function has desirable statistical characteristics, elevated randomness, optimal diffusion and confusion properties as well as flexibility.

show abstract

A chaos-based keyed hash function based on fixed point representation

Cited by 48 publications

References 26 publications

Constructing Keyed Hash Algorithm Using Enhanced Chaotic Map with Varying Parameter

Constructing Keyed Hash Algorithm Using Enhanced Chaotic Map with Varying Parameter

Design of Dynamic Digest through Polynomial Product for Improved Avalanche Effect on Keyless Hash Function

A New Hash Function Based on Chaotic Maps and Deterministic Finite State Automata

Contact Info

Product

Resources

About