Mersenne Prime — M61 for Hashing

Revision en1, by -synx-, 2018-01-11 18:40:56


It is easy to calculate modulus using this prime (with bitwise operations, it is well known)!
My question is how can we efficiently calculate , where a and b can both have at most 61 bits.

Tags hash, mersenne, prime

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English -synx- 2018-01-11 21:36:47 256
en1 English -synx- 2018-01-11 18:40:56 306 Initial revision (published)