Uploading data!

Please wait...

Haval160,3

Online hash calculator of the Haval160,3 algorithm for digesting your texts

Type what you want to convert in the box below or
(autosubmits, max. 1MB)


HAVAL cryptographic hash function

This hash algorithm invented by Yuliang Zheng, Josef Pieprzyk, and Jennifer Seberry in 1992 can be configured with different lengths (from 128 bits to 256 bits) and rounds (from 3 to 5) to digest any kind of content.

On 17 August 2004, a paper from Xiaoyun Wang, Dengguo Feng, Xuejia Lai, and Hongbo Yu announced collisions for HAVAL (128 bits, 3 passes) were announced, which makes this algorithm vulnerable in its weakest variant.

More information at Wikipedia HAVAL page


© by Lucentinian Works Co Ltd and ehehdada, ltd. 2018-2019

Jump to: ADLER32 | Base64 Decoder | Base64 Encoder | Binary values to Text | CRC32 | CRC32b | Decimal values to Text | FNV132 | FNV1a32 | FNV164 | FNV1a64 | GOST | GOST-CRYPTO | Haval128,3 | Haval128,4 | Haval128,5 | Haval160,3 | Haval160,4 | Haval160,5 | Haval192,3 | Haval192,4 | Haval192,5 | Haval224,3 | Haval224,4 | Haval224,5 | Haval256,3 | Haval256,4 | Haval256,5 | Hex to text | Joaat | JSON Formatter and Beautifier | JSON Minimizer | MD2 | MD4 | MD5 | Octal values to Text | RIPEMD128 | RIPEMD160 | RIPEMD256 | RIPEMD320 | ROT13 | SHA1 | SHA256 | SHA384 | SHA512 | SHA3-224 | SHA3-256 | SHA3-384 | SHA3-512 | Shuffle Characters | Snefru | Snefru256 | String/Text length | Text to Binary | Text to Decimal | Text to Hex | Text to Octal | Tiger128,3 | Tiger128,4 | Tiger160,3 | Tiger160,4 | Tiger192,3 | Tiger192,4 | To lowercase | To UPPERCASE | URL Decoder | URL Encoder | WHIRLPOOL |

Cookies policy

This site is using third party cookies (Google Analytics, Zopim, and CoinImp), which are used mainly for statistics like counting the number of visitors from different places of the world, and settings.

We are not using them to identify particular users and we are not going to sell this data to anyone else, because it is used for our own understanding of our audience and improve our services.

For further questions, please don't hesitate to contact us.