Residue Number System-Based Hash Function: Design and Cryptographic Analysis

Abstract

In this paper, we propose a novel cryptographic hash function based on the Residue Number System (RNS). The design leverages the inherent parallelism of RNS to enhance computational efficiency and resilience against certain classes of attacks. Through modular processing across independent residues, the function achieves notable improvements in hardware acceleration capabilities, making it particularly suitable for resource-constrained environments. To assess the robustness of the proposed function, we conduct a series of tests including the distribution of Hamming weights, bit balance evaluation, and avalanche effect analysis. The results demonstrate that the hash function produces uniformly distributed outputs, exhibits strong avalanche characteristics, and maintains high resistance to input structure correlation. These properties confirm the potential of the proposed RNS-based approach for secure and efficient hashing in modern cryptographic applications.