Is primality checking strong enough?
plra opened this issue · 0 comments
plra commented
This should be answered by aggressive testing on all accumulator implementations, involving O(10^9) additions + inclusion/exclusion proofs. Though no composite has been found which passes BPSW (i.e. a number which is both a base-2 Fermat and strong Lucas pseudoprime), could an attack be constructed if one were found?