Paper 2025/1606
Collatz Hash: Hash Algorithm Using 3x+1 Conjecture
, Defence Research and Development OrganisationAbstract
In this paper, we introduce a new hash algorithm in that we used the Collatz problem, focusing on its conditional branching structure, an element often overlooked despite the fame of the 3x + 1 conjecture. This hash algorithm takes an arbitrary-length input and produces a fixed-length 512/384/256 bit output. The presented hash algorithm is in the category of strong one-way Hash Function (OWHF), and this hash algorithm is designed by focusing on its use in password storing and Pseudo-Random Number Generator (PRNG). Until now, quantum computers also didn’t show any speedup in the Collatz conjecture problem, so the proving and disproving of the Collatz conjecture is still a big question, so we believe that there is no structural attack on this hash algorithm.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Preprint.
- Keywords
- Collatz ConjectureHash AlgorithmHash FunctionOne-Way Hash Function
- Contact author(s)
-
shauryapratap2114 @ gmail com
bhupendra cair @ gov in
alokmishra cair @ gov in - History
- 2026-06-29: last of 2 revisions
- 2025-09-07: received
- See all versions
- Short URL
- https://ia.cr/2025/1606
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2025/1606,
author = {Shaurya Pratap Singh and Bhupendra Singh and Alok Mishra},
title = {Collatz Hash: Hash Algorithm Using 3x+1 Conjecture},
howpublished = {Cryptology {ePrint} Archive, Paper 2025/1606},
year = {2025},
url = {https://eprint.iacr.org/2025/1606}
}
