RSA key generation may need improvement
Bug #408660 reported by
Darsey Litzenberger
This bug affects 1 person
Affects | Status | Importance | Assigned to | Milestone | |
---|---|---|---|---|---|
Python-Crypto |
Fix Released
|
Medium
|
Unassigned |
Bug Description
Anthony Honstain posted this to the mailing list (see http://
In the generate_py function of lib/Crypto/
appear to be possible that the the primes p and q can be generated such that
the GCD( 65537, (p-1)(q-1)) != 1 which would result in a unusable key. If
anyone can clarify this it would be greatly appreciated.
Changed in pycrypto: | |
milestone: | none → 2.1.0 |
To post a comment you must log in.
Anyone planning to modify the RSA key generation algorithm should (at least) look at the 1997 paper by Robert D. Silverman, "Fast generation of random, strong RSA primes", available here:
http:// citeseerx. ist.psu. edu/viewdoc/ download? doi=10. 1.1.17. 2713&rep= rep1&type= pdf