php: number only hash?

后端 未结 7 1952
眼角桃花
眼角桃花 2020-12-03 01:00

In php is there a way to give a unique hash from a string, but that the hash was made up from numbers only?

example:

return md5(234); // returns 098f         


        
相关标签:
7条回答
  • 2020-12-03 01:09

    An MD5 or SHA1 hash in PHP returns a hexadecimal number, so all you need to do is convert bases. PHP has a function that can do this for you:

    $bignum = hexdec( md5("test") );
    

    or

    $bignum = hexdec( sha1("test") );
    

    PHP Manual for hexdec

    Since you want a limited size number, you could then use modular division to put it in a range you want.

    $smallnum = $bignum % [put your upper bound here]
    

    EDIT

    As noted by Artefacto in the comments, using this approach will result in a number beyond the maximum size of an Integer in PHP, and the result after modular division will always be 0. However, taking a substring of the hash that contains the first 16 characters doesn't have this problem. Revised version for calculating the initial large number:

    $bignum = hexdec( substr(sha1("test"), 0, 15) );
    
    0 讨论(0)
  • 2020-12-03 01:11

    First of all, md5 is basically compromised, so you shouldn't be using it for anything but non-critical hashing. PHP5 has the hash() function, see http://www.php.net/manual/en/function.hash.php.

    Setting the last parameter to true will give you a string of binary data. Alternatively, you could split the resulting hexadecimal hash into pieces of 2 characters and convert them to integers individually, but I'd expect that to be much slower.

    0 讨论(0)
  • 2020-12-03 01:13

    You can try crc32(). See the documentation at: http://php.net/manual/en/function.crc32.php

    $checksum = crc32("The quick brown fox jumped over the lazy dog.");
    printf("%u\n", $checksum); // prints 2191738434 
    

    With that said, crc should only be used to validate the integrity of data.

    0 讨论(0)
  • 2020-12-03 01:14

    Just use my manual hash method below:

    Divide the number (e.g. 6 digit) by prime values, 3,5,7.

    And get the first 6 values that are in the decimal places as the ID to be used. Do a check on uniqueness before actual creation of the ID, if a collision exists, increase the last digit by +1 until a non collision.
    E.g. 123456 gives you 771428 123457 gives you 780952 123458 gives you 790476.

    0 讨论(0)
  • 2020-12-03 01:24

    The problem of cut off the hash are the collisions, to avoid it try:

    return  hexdec(crc32("Hello World"));
    

    The crc32():

    Generates the cyclic redundancy checksum polynomial of 32-bit lengths of the str. This is usually used to validate the integrity of data being transmitted.

    That give us an integer of 32 bit, negative in 32 bits installation, or positive in the 64 bits. This integer could be store like an ID in a database. This don´t have collision problems, because it fits into 32bits variable, once you convert it to decimal with the hexdec() function.

    0 讨论(0)
  • 2020-12-03 01:27

    Try hashid.
    It hash a number into format you can define. The formats include how many character, and what character included.
    Example:
    $hashids->encode(1);
    Will return "28630" depends on your format,

    0 讨论(0)
提交回复
热议问题