3 uQha@s"dZddlmZGdddZdS)z/ This module holds a fast Factorization class. )randintc@s(eZdZdZeddZeddZdS) FactorizationzB Simple module to factorize large numbers really quickly. c Cs|ddkrd|dfStd|dtd|dtd|d}}}d}}}d}} x|dkr|}x$t|D]} t|d|||}qtWd} xr| |ko|dkr|} xBtt||| D],} t|d|||}|t|||}qW|j||}| |7} qW|d9}q\W||krZx:t| d|||} |jt|| |}|dkr Pq W|||} }| |krz| |fS|| fS)a Factorizes the given large integer. Implementation from https://comeoncodeon.wordpress.com/2010/09/18/pollard-rho-brent-integer-factorization/. :param pq: the prime pair pq. :return: a tuple containing the two factors p and q. r)rrangepowminabsgcd) clsZpqycmgrqxZysikprA/tmp/pip-build-2nz6shyl/telethon/telethon/crypto/factorization.py factorize s4  .       zFactorization.factorizecCsx|r|||}}qW|S)z Calculates the Greatest Common Divisor. :param a: the first number. :param b: the second number. :return: GCD(a, b) r)abrrrr 7s zFactorization.gcdN)__name__ __module__ __qualname____doc__ classmethodr staticmethodr rrrrrs ,rN)rrandomrrrrrrs