Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Is primality checking strong enough? #3

Open
plra opened this issue Jan 25, 2019 · 0 comments
Open

Is primality checking strong enough? #3

plra opened this issue Jan 25, 2019 · 0 comments
Assignees
@plra
Labels
question Further information is requested

Comments

@plra
Copy link
Collaborator

plra commented Jan 25, 2019

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?
@plra plra self-assigned this Jan 25, 2019
@whaatt whaatt added the question Further information is requested label Mar 7, 2019
@whaatt whaatt added this to the 0.2 milestone Mar 7, 2019
@whaatt whaatt removed this from the 0.2 milestone Apr 15, 2019
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees

@plra plra

Labels
question Further information is requested
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
2 participants
@whaatt @plra