We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
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
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
The text was updated successfully, but these errors were encountered:
https://github.com/DonaldTsang/Personal/blob/master/shamir.py 404s for me
Sorry, something went wrong.
Try finding the script in https://github.com/DonaldTsang/Personal/blob/master/freedom.py
No branches or pull requests
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
The text was updated successfully, but these errors were encountered: