mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-03-27 17:06:44 +00:00
Code Issues Packages Projects Releases Wiki Activity

fix implementation errors. (#1568)

Browse Source 
I revised my implementation and found out that I have miss a inner loop for t.  x and y should be recalculated everytime when t is divisble by 2. I have also included a more readble source for this algorithm.
This commit is contained in:
Zizhou Zhang 2019-11-15 06:29:54 +11:00 committed by Christian Clauss
parent ea9bf0a90c
commit e3aa0f65e8
1 changed files with 13 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

19
ciphers/rsa_factorization.py
View File

@ -4,6 +4,7 @@ An RSA prime factor algorithm.
The program can efficiently factor RSA prime number given the private key d and The program can efficiently factor RSA prime number given the private key d and
public key e. public key e.
Source: on page 3 of https://crypto.stanford.edu/~dabo/papers/RSA-survey.pdf Source: on page 3 of https://crypto.stanford.edu/~dabo/papers/RSA-survey.pdf
More readable source: https://www.di-mgt.com.au/rsa_factorize_n.html
large number can take minutes to factor, therefore are not included in doctest. large number can take minutes to factor, therefore are not included in doctest.
""" """
import math import math
@ -35,13 +36,17 @@ def rsafactor(d: int, e: int, N: int) -> List[int]:
while p == 0: while p == 0:
g = random.randint(2, N - 1) g = random.randint(2, N - 1)
t = k t = k
if t % 2 == 0: while True:
t = t // 2 if t % 2 == 0:
x = (g ** t) % N t = t // 2
y = math.gcd(x - 1, N) x = (g ** t) % N
if x > 1 and y > 1: y = math.gcd(x - 1, N)
p = y if x > 1 and y > 1:
q = N // y p = y
q = N // y
break # find the correct factors
else:
break # t is not divisible by 2, break and choose another g
return sorted([p, q]) return sorted([p, q])