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
Needed for hash functions in RSA. Like maximum bytes that can be processed bu SHA1 = 2^61 - 1.
The text was updated successfully, but these errors were encountered:
On Thu, Oct 03, 2013 at 10:13:31PM -0700, satvikc wrote:
I remember that for sha1 the standard says that if the number of bits is more than 2^64 - 1 then the padding is the length mod 2^64.
Regards
ppk
Sorry, something went wrong.
Also we need some abstraction for random number generation. I need a random Octet string in rsa. Should I use some package (if yes then which one)?
I think I can close this issue. It is not something on which action has to be taken
No branches or pull requests
Needed for hash functions in RSA. Like maximum bytes that can be processed bu SHA1 = 2^61 - 1.
The text was updated successfully, but these errors were encountered: