Experiment: Fast finite field arithmetic modulo Solinas prime Fp=2^64-2^32+1 in C++ - Chris Taylor - catid |
GitHub | https://github.com/catid/solinas64 | |
Size | 608K (588K (+20K)) | |
Commits | 12 (-1 (+13)) | |
Update Stats | 0s ... 4m15s [Ø (last 10) 14s (1,1,1,134,1,1,1,1,0,1))] | |
Last Change | 2019-01-10 09:12:41 | |
Last Check | 2023-09-16 09:26:35 | |
Created | 2019-01-23 02:11:02 |
Operation
Verifying url ...
Mail to Andreas Kupries