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
In RSA code we generate a blinding factor as simple integer mod n: https://github.com/tomato42/tlslite-ng/blob/9951ec1c769617247a80aa1cae661ec0edc68823/tlslite/utils/python_rsakey.py#L65-L70
we should verify that it's relatively prime to n (by calculating gcd() and checking if it is 1) before using it.
The text was updated successfully, but these errors were encountered:
No branches or pull requests
In RSA code we generate a blinding factor as simple integer mod n:
https://github.com/tomato42/tlslite-ng/blob/9951ec1c769617247a80aa1cae661ec0edc68823/tlslite/utils/python_rsakey.py#L65-L70
we should verify that it's relatively prime to n (by calculating gcd() and checking if it is 1) before using it.
The text was updated successfully, but these errors were encountered: