loluwot/StrongPseudoPrimeGeneratorMkII

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

语言：Python · GitHub 星标：9 · Fork：1

在 GitHub 上查看原仓库