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.

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

What are the criteria ofr selecting primes? #19

Open
DonaldTsang opened this issue Jul 30, 2016 · 2 comments
Open

What are the criteria ofr selecting primes? #19

DonaldTsang opened this issue Jul 30, 2016 · 2 comments

Comments

@DonaldTsang
Copy link

DonaldTsang commented Jul 30, 2016

So why are there only the smallest 257, 321 and 385 bit primes on the list?
And why does it not include 2^x-y and 2^(x-1)+y and 2^(x-1)-y on the list?

This is my own collection of primes
https://github.com/DonaldTsang/Personal/blob/master/shamir.py

@BlinkyStitt
Copy link

@DonaldTsang
Copy link
Author

Try finding the script in https://github.com/DonaldTsang/Personal/blob/master/freedom.py

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants