| from Crypto.Util.number import * | |
| PR.<qr>=PolynomialRing(ZZ) | |
| def calc_params(e,N): | |
| delta = 0.1 | |
| gama = 0.05 | |
| beta = log(e,N).n() | |
| alpha = 0.25 | |
| return alpha,beta,delta,gama |
| class IIter: | |
| def __init__(self, m, n): | |
| self.m = m | |
| self.n = n | |
| self.arr = [0 for _ in range(n)] | |
| self.sum = 0 | |
| self.stop = False | |
| def __iter__(self): | |
| return self |
| # https://pdfs.semanticscholar.org/2d85/9e8937fe652558a60e82ffd39cd4ab835e31.pdf, Section4.4 | |
| # As LLL is not precise for there are only 10 public keys, so I use Babai instead. | |
| # Just randomly construct the target vector, if it is close enough to (dM, 1−k1Λ1, ..., 1−krΛr), we may recover d. | |
| from Crypto.Util.number import * | |
| import random | |
| k = 10 | |
| f = open('output', 'rb') | |
| f.readline() |
| ''' | |
| Common-prime (in group order!) RSA with low private exponent. | |
| p = 2ga + 1 | |
| q = 2gb + 1 | |
| N = p * q | |
| phi(N) = 2gab | |
| ''' | |
| from sage.all import * |