StrongPseudoPrimeGeneratorMkII ret2basic · COMPLETED
Generates pseudoprimes that pass the Miller-Rabin primality test with the first n primes. Used to solve the Prime and Prejudice problem on cryptohack. Implementation of this paper: https://eprint.iacr.org/2018/749.pdf
github.com/ret2basic/StrongPseudoPrimeGeneratorMkII · ★ 0 · Forks 0 · Size 2 KB
SUMMARY
Technologies 2
Scored 2
Observed 2
Practices 6
Evidence 2
Skips 0
COVERAGE
Analyzed 2 files · 2 commits · 0 API calls
TECHNOLOGIES & DEPTH
Markdown LANGUAGE Depth 70
1 files · PRODUCTION
Python LANGUAGE Depth 70
1 files · PRODUCTION
PRACTICES
documentation · observedautomated_tests · absentcontinuous_integration · absentcontainerization · absentlinting · absentformatting · absent
ACTIVITY & OWNERSHIP
First commit 2021-02-02
Last commit 2021-02-02
Active months 1
Commits 2