A new design paradigm for provably secure keyless hash function with subsets and two variables polynomial function

Karthik, P.; Bala, P. Shanthi

doi:10.1016/j.jksuci.2019.10.003

Cited by 5 publications

(4 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…By incorporating a 128th-degree polynomial function, they significantly increased the unpredictability and randomness of hash outputs, addressing the shortcomings of conventional hash algorithms. Their empirical results affirm the cryptographic robustness and security of their hash function design [28]. Ayubi and colleagues developed a chaotic keyed hash function employing a complex quadratic map and a generalized chaotic map to extend the key length.…”

Section: Figure 1 Diagram Of the Hash Functionmentioning

confidence: 73%

Enhanced Security Hash Function Leveraging Chaotic Coupling Coefficient in Cross-Coupled Map Lattice

2024

Preprint

View full text Add to dashboard Cite

The recent surge in interest within the scientific community towards spatiotemporal chaos underscores its potential for bolstering secure communications and cryptographic mechanisms. This research presents a cutting-edge methodology to amplify the spatiotemporal chaos exhibited by conventional cross-coupled image lattices through the adoption of chaotic coupling coefficients. By innovatively adjusting the structure of these lattices to incorporate chaotic coupling coefficients, we markedly enhance their chaotic dynamics across temporal and spatial dimensions. This advancement facilitates the creation of a secure hash function characterized by substantial security enhancements. Rigorous experimental validation attests to the security, highlighting the chaotic coupling coefficients' pivotal role in augmenting the hash function's defenses against various attacks. This investigation not only introduces a revolutionary alteration to the framework of cross-coupled image lattices but also unveils a pragmatic secure hash function application, demonstrating the significant potential of chaotic systems in the sphere of cryptography. Our findings suggest that integrating chaotic coupling coefficients into cross-coupled image lattices represents a fertile ground for crafting sophisticated cryptographic instruments, thereby paving new pathways in the realm of secure digital communications.

show abstract

Section: Figure 1 Diagram Of the Hash Functionmentioning

confidence: 73%

Enhanced Security Hash Function Leveraging Chaotic Coupling Coefficient in Cross-Coupled Map Lattice

2024

Preprint

View full text Add to dashboard Cite

show abstract

“…Researchers have also proposed modified versions of GOST-R [24], Double-Serial iterative structures [25], and sponge functions with 3D-ECM [26]. Other proposed iterative structures include controlled alternate quantum walk-based block iterative structures [27], provably secure keyless hash iterative structures with subsets and two variables polynomial function [28], keyed hash iterative structures based on complex quadratic maps [29], and MDPH iterative structures with security proofs [30]. All of these proposed iterative structures were based on serial structures, which would be inefficient when handling large files.…”

Section: Related Workmentioning

confidence: 99%

“…However, after statistical analysis, the avalanche performance of Refs [34,39,[40][41] was found to be poor [42]. To address this issue, Karthik designed a compression structure based on polynomial functions [43] and a new message extension structure for SHA2 [44]. However, these two compression structures are challenging to implement in parallel hash functions and their collision resistance is poor [42].…”

Section: Related Workmentioning

confidence: 99%

Parallel Hash Algorithm Based on Cellular Automata and Stochastic Diffusion Model

Yang,

Wan,

Yan

et al. 2024

Preprint

View full text Add to dashboard Cite

The development of a cryptographic hash algorithm is a crucial task due to its numerous practical applications, such as digital signatures, blockchain, and distributed systems. Constructing a novel and efficient hash algorithm that meets the high security requirements is a challenging endeavor. This study introduces a cryptographic parallel hash algorithm based on cellular automata and a stochastic diffusion model, referred to as PCASD. The article delves into the rules of cellular automata, classifies 88 types of equivalent class rules, and utilizes random chaotic rules to generate keys for iterative processes. The stochastic diffusion model optimizes parameters to achieve optimal safety performance indicators. The parallel iteration structure allows for simultaneous execution of different branches, ultimately resulting in a hash value. The experimental results demonstrate that the proposed parallel hash algorithm outperforms popular hash functions in terms of randomness, avalanche, information entropy, collision resistance, and efficiency, indicating its practical feasibility.

show abstract

“…Hash functions, mathematical algorithms that convert input data of any size into a fixed-length output , illustrated in Figure 1 [13], play a crucial role in cryptography [14][15][16], data integrity verification [16][17][18], data indexing [20][21][22], and other applications [23][24][25][26][27]. Specialized hash functions have been developed to meet the distinct needs of various sectors, with notable contributions from Karthik et al [28], Ayubi et al [29],…”

Section: Introductionmentioning

confidence: 99%

Secure Hash Function Utilizing Asymptotically Coupled Cross-Coupled Map Lattices in Spatial Dimensions

2024

Preprint

View full text Add to dashboard Cite

The exploration of spatiotemporal chaos and its integration into cryptographic hash functions has attracted considerable attention, driven by the intrinsic complexity and unpredictability of chaotic systems. In this paper, we introduce a novel cross-coupled map lattice with spatially varying coupling coefficients, diverging from the traditional Cross-Coupled Map Lattice that utilizes fixed coupling coefficients. Our innovative approach incorporates a gradient in the coupling strength along the spatial dimension, which, as evidenced by our experiments, leads to enhanced chaotic indices. Capitalizing on the superior characteristics of the modified cross-coupled map lattice, we have devised a new hash function capable of transforming data of arbitrary length into hash values of 128, 256, or 512 bits. Through extensive experimentation, we have rigorously assessed the security performance of the proposed hash function. Our results indicate that the spatially varying coupling coefficients in the cross-coupled map lattice significantly bolster the hash function's robustness and reliability, rendering it an appealing choice for cryptographic applications and secure data transmission.

show abstract

A new design paradigm for provably secure keyless hash function with subsets and two variables polynomial function

Cited by 5 publications

References 22 publications

Enhanced Security Hash Function Leveraging Chaotic Coupling Coefficient in Cross-Coupled Map Lattice

Enhanced Security Hash Function Leveraging Chaotic Coupling Coefficient in Cross-Coupled Map Lattice

Parallel Hash Algorithm Based on Cellular Automata and Stochastic Diffusion Model

Secure Hash Function Utilizing Asymptotically Coupled Cross-Coupled Map Lattices in Spatial Dimensions

Contact Info

Product

Resources

About