Experiment: Fast finite field arithmetic modulo Solinas prime Fp=2^64-2^32+1 in C++ - Chris Taylor - catid

GitHub GitHub
Size 608K (612K (-4K))
Commits 12 (-1 (+13))
Update Stats 1s ... 4m15s (2s * 10)
Last Change 2019-01-10 00:12:41
Last Check 2019-12-07 13:31:01
Created 2019-01-22 17:11:02
Remotes
1. https://github.com/catid/solinas64
Forks

Messages as of last check on 2019-12-07 13:31:01

Operation

m-vcs-git-https%3a%2f%2fgithub.com%2fcatid%2fsolinas64  https://github.com/catid/solinas64 (fetch)
m-vcs-git-https%3a%2f%2fgithub.com%2fcatid%2fsolinas64  https://github.com/catid/solinas64 (push)
m-vcs-git-https%3a%2f%2fgithub.com%2fcatid%2fsolinas64
12
Fetching m-vcs-git-https%3a%2f%2fgithub.com%2fcatid%2fsolinas64
12

Contact information

Mail to Andreas Kupries