o Xzja@s"dZddlmZGdddZdS)z/ This module holds a fast Factorization class. )randintc@s(eZdZdZeddZeddZdS) FactorizationzB Simple module to factorize large numbers really quickly. c Csx|ddkr d|dfStd|dtd|dtd|d}}}d}}}d}} |dkr|}t|D] } t|d|||}q7d} | |kr|dkr|} tt||| D]} t|d|||}|t|||}qY|||}| |7} | |kr|dksN|d9}|dks1||kr t| d|||} |t|| |}|dkrnq|||} }| |kr| |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) clspqycmgrqxysikprX/var/www/kodo/tsheker/venv/lib/python3.10/site-packages/telethon/crypto/factorization.py factorize s: .    zFactorization.factorizecCs|r |||}}|s|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)r randomrrrrrrs