"The bit size must be a power of 2 greater than or equal to 8." is not currently being tested, and there are some answers that just require it to be a multiple of 8.
The formula for d is wrong, and furthermore it's not clear that it is the formula for d in the first place.
I propose changing "Compute the modular multiplicative inverse of e (mod n) - this will be the exponent used in the private key" to "Compute the modular multiplicative inverse of e (mod phi(n)) - this will be the exponent d used in the private key".
Prolog translation
"The bit size must be a power of 2 greater than or equal to 8." is not currently being tested, and there are some answers that just require it to be a multiple of 8.
Missing random tests in Ruby.
This isn't currently being tested in python or ruby.
Scala translation
I don't understand the purpose of the 'update' method (python).
Is this were the SHA1 padding/preprocessing is to take place?
TypeScript translation
The formula for
dis wrong, and furthermore it's not clear that it is the formula fordin the first place.I propose changing "Compute the modular multiplicative inverse of
e (mod n)- this will be the exponent used in the private key" to "Compute the modular multiplicative inverse ofe (mod phi(n))- this will be the exponentdused in the private key".when submitting Verify has a bug:
TypeError: lstrip arg must be None or str
which seems to be caused by an invalid second argument to lstrip