From aca05e6c7d7efff451c3f149d0e9e12d34a63a9f Mon Sep 17 00:00:00 2001 From: Paul Kehrer Date: Sun, 18 Jan 2015 10:02:53 -0600 Subject: various improvements to rsa_recover_prime_factors per review feedback --- docs/hazmat/primitives/asymmetric/rsa.rst | 7 +++---- 1 file changed, 3 insertions(+), 4 deletions(-) (limited to 'docs') 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)`` -- cgit v1.2.3