All geek questions in one place

Create a quick hash function for entering fixed length

I am currently working on a project where some information needs to be hashed. Since the data set is huge (millions of records created every day), the data conversion algorithm must be fast.

The pieces of data that must be hashed are a fixed length (11 decimal numbers - example: 05018144298). Therefore, I would like to know whether it is worth creating your own hash function instead of using some existing ones (for example, MD5) in order to significantly reduce processing time, and if so, what would be the best way to do this, This is a good way to change some of the existing algorithms ( for example, MD5, but split the input into smaller pieces and change other parameters for fixed input of 11 decimal numbers) or is it better to design a hash function from scratch?

Thank!

+3
source share
3 answers

  • , , , - - . MD5 , ​​ . , " " - .

  • -, -, - . -, , NIST. . , , , . - .

- -. MD5, ; ( 1996 , MD5 15 ). SHA-256.

-, - -, - . , , .

+4

. , , , . , , , , , , , .

, , :

11 , 64- (long long int C). ?

11-, , , 11 32- , , MD5, SHA-1 , , OpenSSL. OpenSSL ( MMX, , AES, ), .

+2

, (, , ..), . , , , - - -, .

(OTP). , , . ( RNG Windows CSP - ) , .

OTP, . , OTP.

, . , , , - , .

+1
source

Source: https://habr.com/ru/post/1763302/

More articles:


All Articles