Changes To Experiment: mmmv_microbot_crypto_t1: Implementation Ideas
Not logged in

Changes to "Experiment: mmmv_microbot_crypto_t1: Implementation Ideas" between 2016-12-29 22:56:45 and 2016-12-29 22:57:07

    22     22   collisions must be maximized. The way to do it is to require a minimum of N
    23     23   bytes as an input and use some constants, when the input data is smaller. The
    24     24   constants can be pre-processed with input data before using them as inputs for
    25     25   the hash function. Different Hash function implementations can be evaluated by
    26     26   counting the number of collisions that literally every 4B number has. The 4B
    27     27   can address 4GiB, so results must be stored sparsely, may be by using a
    28     28   histogram. Given that it's a fast C program that fits wholly to CPU-cache, the
    29         -calculation of the 4*2^9 values should take less than a minute.&nbsp;</p>
           29  +calculation of the 4*2^9 values should take less than a minute on a desktop
           30  +computer.</p>
    30     31   
    31     32   <p><br>
    32     33   </p>
    33     34   
    34     35   <p><br>
    35     36   </p>