|
|
|
|
|
|
by mschireson
5530 days ago
|
|
|
Simpler to do the arithmetic modulo a prime just smaller than 2^64 if you ignore the case where n is very close to 2^64 (which should be fine in real life). In case you leave your code will be easier to maintain than if you bring Galois Fields into it. I was kinda expecting the bigint solution though. -- Max |
|
|