diff options
| author | Paul Kehrer <paul.l.kehrer@gmail.com> | 2015-01-18 10:02:53 -0600 |
|---|---|---|
| committer | Paul Kehrer <paul.l.kehrer@gmail.com> | 2015-01-18 10:02:53 -0600 |
| commit | aca05e6c7d7efff451c3f149d0e9e12d34a63a9f (patch) | |
| tree | d51943fcbda6863847fe41bfff4fe1e4c920da6c /docs | |
| parent | 836b830b155c1b04fbad40ab76f0de4339d8628c (diff) | |
| download | cryptography-aca05e6c7d7efff451c3f149d0e9e12d34a63a9f.tar.gz cryptography-aca05e6c7d7efff451c3f149d0e9e12d34a63a9f.tar.bz2 cryptography-aca05e6c7d7efff451c3f149d0e9e12d34a63a9f.zip | |
various improvements to rsa_recover_prime_factors per review feedback
Diffstat (limited to 'docs')
| -rw-r--r-- | docs/hazmat/primitives/asymmetric/rsa.rst | 7 |
1 files changed, 3 insertions, 4 deletions
diff --git a/docs/hazmat/primitives/asymmetric/rsa.rst b/docs/hazmat/primitives/asymmetric/rsa.rst index 7a22c204..4423aa8e 100644 --- a/docs/hazmat/primitives/asymmetric/rsa.rst +++ b/docs/hazmat/primitives/asymmetric/rsa.rst @@ -395,15 +395,14 @@ this without having to do the math themselves. .. versionadded:: 0.8 + Computes ``(p, q)`` given the modulus, public exponent, and private + exponent. + .. note:: When recovering prime factors this algorithm will always return ``p`` and ``q`` such that ``p < q``. - - Computes ``(p, q)`` given the modulus, public exponent, and private - exponent. - :return: A tuple ``(p, q)`` |