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:57:07 and 2016-12-29 22:58:47

    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     29   calculation of the 4*2^9 values should take less than a minute on a desktop
    30     30   computer.</p>
    31     31   
           32  +<p><br>
           33  +</p>
           34  +
           35  +<p>There must be some way to test, whether a particular MCU treats integer
           36  +overflows the same way as the desktop computer does. Otherwise the MCU
           37  +calculated hash might differ from the desktop computer calculated hash.</p>
           38  +
    32     39   <p><br>
    33     40   </p>
    34     41   
    35     42   <p><br>
    36     43   </p>