I’m implementing a Skein hash function in Java, and I have a problem with a part where some additions where modulo 2^64. As I we know, long in java has max value = 2^63-1. So my problem is, how to implement this modulo operation.
(All operations in Skein are on 64bit words.)
I’m implementing a Skein hash function in Java, and I have a problem with
Share
longin Java is 64-bit so all operations are mod 2^64 already. You don’t have to do anything extra to make that happen.Is the problem that you don’t know how to handle signed values?
Is this something you want or is it something you are trying to avoid?