o j ,@s@ddlZddlmZmZmZmZddlmZGdddeZdS)N) iter_rangebordbchrABC)Randomc@seZdZejddZejddZejddZejdhd d Ze ejdid d Z ejd dZ ejddZ ejddZ ejddZejddZejddZejddZeZejddZejddZejdd Zejd!d"Zejd#d$Zejd%d&Zejdjd(d)Zejdjd*d+Zejd,d-Zejdjd.d/Zejd0d1Zejd2d3Zejd4d5Zejd6d7Z ejd8d9Z!ejd:d;Z"ejdd?Z$ejd@dAZ%ejdBdCZ&ejdDdEZ'ejdFdGZ(ejdHdIZ)ejdJdKZ*ejdLdMZ+ejdNdOZ,ejdPdQZ-ejdRdSZ.ejdTdUZ/ejdVdWZ0ejdXdYZ1ejdZd[Z2ejd\d]Z3e ejd^d_Z4e d`daZ5e6dbdcZ7e6dddeZ8e ejdfdgZ9d'S)k IntegerBasecCdSNselfr r /root/aizidognhua/tmp/workspace/projects/ec89d86c-575f-41c9-af57-ac45cbdbf775/venv/lib/python3.10/site-packages/Cryptodome/Math/_IntegerBase.py__int__)zIntegerBase.__int__cCrr r r r r r __str__-rzIntegerBase.__str__cCrr r r r r r __repr__1rzIntegerBase.__repr__rbigcCrr r )r block_size byteorderr r r to_bytes5rzIntegerBase.to_bytescCrr r ) byte_stringrr r r from_bytes9zIntegerBase.from_bytescCrr r r termr r r __eq__?rzIntegerBase.__eq__cCrr r rr r r __ne__CrzIntegerBase.__ne__cCrr r rr r r __lt__GrzIntegerBase.__lt__cCrr r rr r r __le__KrzIntegerBase.__le__cCrr r rr r r __gt__OrzIntegerBase.__gt__cCrr r rr r r __ge__SrzIntegerBase.__ge__cCrr r r r r r __nonzero__WrzIntegerBase.__nonzero__cCrr r r r r r is_negative\rzIntegerBase.is_negativecCrr r rr r r __add__arzIntegerBase.__add__cCrr r rr r r __sub__erzIntegerBase.__sub__cCrr r )r factorr r r __mul__irzIntegerBase.__mul__cCrr r r divisorr r r __floordiv__mrzIntegerBase.__floordiv__cCrr r r'r r r __mod__qrzIntegerBase.__mod__NcCrr r r exponentmodulusr r r inplace_powurzIntegerBase.inplace_powcCrr r r+r r r __pow__yrzIntegerBase.__pow__cCrr r r r r r __abs__}rzIntegerBase.__abs__cCrr r r r-r r r sqrtrzIntegerBase.sqrtcCrr r rr r r __iadd__rzIntegerBase.__iadd__cCrr r rr r r __isub__rzIntegerBase.__isub__cCrr r rr r r __imul__rzIntegerBase.__imul__cCrr r rr r r __imod__rzIntegerBase.__imod__cCrr r rr r r __and__rzIntegerBase.__and__cCrr r rr r r __or__rzIntegerBase.__or__cCrr r r posr r r __rshift__rzIntegerBase.__rshift__cCrr r r9r r r __irshift__rzIntegerBase.__irshift__cCrr r r9r r r __lshift__rzIntegerBase.__lshift__cCrr r r9r r r __ilshift__rzIntegerBase.__ilshift__cCrr r )r nr r r get_bitrzIntegerBase.get_bitcCrr r r r r r is_oddrzIntegerBase.is_oddcCrr r r r r r is_evenrzIntegerBase.is_evencCrr r r r r r size_in_bitsrzIntegerBase.size_in_bitscCrr r r r r r size_in_bytesrzIntegerBase.size_in_bytescCrr r r r r r is_perfect_squarerzIntegerBase.is_perfect_squarecCrr r )r small_primer r r fail_if_divisible_byrz IntegerBase.fail_if_divisible_bycCrr r )r abr r r multiply_accumulaterzIntegerBase.multiply_accumulatecCrr r )r sourcer r r setrzIntegerBase.setcCrr r r1r r r inplace_inverserzIntegerBase.inplace_inversecCrr r r1r r r inverserzIntegerBase.inversecCrr r rr r r gcdrzIntegerBase.gcdcCrr r rr r r lcmrzIntegerBase.lcmcCrr r )rHr?r r r jacobi_symbolrzIntegerBase.jacobi_symbolc Cs|dvr|S|ddkr$t||dd|}t|d||kr"td|Sd}|dd}|d@s<|d7}|dL}|d@r0|d} t||dd|}|dkrU|d7}qA||dkr\ntd|}t|||}t|||} t||dd|} | dkrtd|D]} t| d| |dkrnq| |krtd ||ft|d|| d|} | }| d|}| | d|} | | |} | dks|t| d||krtd| S) aTonelli-shanks algorithm for computing the square root of n modulo a prime p. n must be in the range [0..p-1]. p must be at least even. The return value r is the square root of modulo p. If non-zero, another solution will also exist (p-r). Note we cannot assume that p is really a prime: if it's not, we can either raise an exception or return the correct value. )rrRzCannot compute square rootTrz'Cannot compute square root of %d mod %d)pow ValueError __class__r) r?prootsqzeulermctrirIr r r _tonelli_shankssT         zIntegerBase._tonelli_shanksc Ks|dd}|dd}|dd}|durtj}|dur'|dur'td|dur3|dur3td|p6|}|ddd}d|d|}t|dd }|dur[|d|d>O}|d|>dM}|t|||dS) a!Generate a random natural integer of a certain size. :Keywords: exact_bits : positive integer The length in bits of the resulting random Integer number. The number is guaranteed to fulfil the relation: 2^bits > result >= 2^(bits - 1) max_bits : positive integer The maximum length in bits of the resulting random Integer number. The number is guaranteed to fulfil the relation: 2^bits > result >=0 randfunc : callable A function that returns a random byte string. The length of the byte string is passed as parameter. Optional. If not provided (or ``None``), randomness is read from the system RNG. :Return: a Integer object exact_bitsNmax_bitsrandfuncz3Either 'exact_bits' or 'max_bits' must be specifiedz2'exact_bits' and 'max_bits' are mutually exclusiverRr)poprnewreadrWrrr) clskwargsrerfrgbits bytes_neededsignificant_bits_msbmsbr r r random)s"    zIntegerBase.randomc Ks|dd}|dd}|dd}|dd}|r#tdt|jd||fvr-td|dur5|d}d||fvr?td |durHtj}||}||}d }d |kr^|ksun|j||d }d |krs|kr_||Sq_||S) aGenerate a random integer within a given internal. :Keywords: min_inclusive : integer The lower end of the interval (inclusive). max_inclusive : integer The higher end of the interval (inclusive). max_exclusive : integer The higher end of the interval (exclusive). randfunc : callable A function that returns a random byte string. The length of the byte string is passed as parameter. Optional. If not provided (or ``None``), randomness is read from the system RNG. :Returns: An Integer randomly taken in the given interval. min_inclusiveN max_inclusive max_exclusivergzUnknown keywords: z8max_inclusive and max_exclusive cannot be both specifiedrRz(Missing keyword to identify the intervalr)rfrg) rirWstrkeysrrjrkrCrr) rlrmrsrtrurg norm_maximum bits_needednorm_candidater r r random_rangeYs4        zIntegerBase.random_rangecCsdS)aMultiply two integers, take the modulo, and encode as big endian. This specialized method is used for RSA decryption. Args: term1 : integer The first term of the multiplication, non-negative. term2 : integer The second term of the multiplication, non-negative. modulus: integer The modulus, a positive odd number. :Returns: A byte string, with the result of the modular multiplication encoded in big endian mode. It is as long as the modulus would be, with zero padding on the left if needed. Nr )term1term2r-r r r _mult_modulo_bytesszIntegerBase._mult_modulo_bytes)rr)rr ):__name__ __module__ __qualname__abcabstractmethodrrrr staticmethodrrrrrrr r!__bool__r"r#r$r&r)r*r.r/r0r2r3r4r5r6r7r8r;r<r=r>r@rArBrCrDrErGrJrLrMrNrOrPrQrd classmethodrrr|rr r r r r&s                                              @ / /r) rCryptodome.Util.py3compatrrrr Cryptodomerrr r r r s