a !f)@s@ddlZddlmZmZmZmZddlmZGdddeZdS)N) iter_rangebordbchrABC)Randomc@seZdZejddZejddZejddZejdfd d Ze ejdgd d Z ejd dZ ejddZ ejddZ ejddZejddZejddZejddZeZejddZejddZejdd Zejd!d"Zejd#d$Zejd%d&Zejdhd(d)Zejdid*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`daZ5e6dbdcZ7e6dddeZ8d'S)k IntegerBasecCsdSNselfr r ]/var/www/html/python-backend/venv/lib/python3.9/site-packages/Cryptodome/Math/_IntegerBase.py__int__)szIntegerBase.__int__cCsdSrr r r r r __str__-szIntegerBase.__str__cCsdSrr r r r r __repr__1szIntegerBase.__repr__rbigcCsdSrr )r block_size byteorderr r r to_bytes5szIntegerBase.to_bytescCsdSrr )Z byte_stringrr r r from_bytes9szIntegerBase.from_bytescCsdSrr r termr r r __eq__?szIntegerBase.__eq__cCsdSrr rr r r __ne__CszIntegerBase.__ne__cCsdSrr rr r r __lt__GszIntegerBase.__lt__cCsdSrr rr r r __le__KszIntegerBase.__le__cCsdSrr rr r r __gt__OszIntegerBase.__gt__cCsdSrr rr r r __ge__SszIntegerBase.__ge__cCsdSrr r r r r __nonzero__WszIntegerBase.__nonzero__cCsdSrr r r r r is_negative\szIntegerBase.is_negativecCsdSrr rr r r __add__aszIntegerBase.__add__cCsdSrr rr r r __sub__eszIntegerBase.__sub__cCsdSrr )r factorr r r __mul__iszIntegerBase.__mul__cCsdSrr r Zdivisorr r r __floordiv__mszIntegerBase.__floordiv__cCsdSrr r#r r r __mod__qszIntegerBase.__mod__NcCsdSrr r exponentmodulusr r r inplace_powuszIntegerBase.inplace_powcCsdSrr r&r r r __pow__yszIntegerBase.__pow__cCsdSrr r r r r __abs__}szIntegerBase.__abs__cCsdSrr r r(r r r sqrtszIntegerBase.sqrtcCsdSrr rr r r __iadd__szIntegerBase.__iadd__cCsdSrr rr r r __isub__szIntegerBase.__isub__cCsdSrr rr r r __imul__szIntegerBase.__imul__cCsdSrr rr r r __imod__szIntegerBase.__imod__cCsdSrr rr r r __and__szIntegerBase.__and__cCsdSrr rr r r __or__szIntegerBase.__or__cCsdSrr r posr r r __rshift__szIntegerBase.__rshift__cCsdSrr r4r r r __irshift__szIntegerBase.__irshift__cCsdSrr r4r r r __lshift__szIntegerBase.__lshift__cCsdSrr r4r r r __ilshift__szIntegerBase.__ilshift__cCsdSrr )r nr r r get_bitszIntegerBase.get_bitcCsdSrr r r r r is_oddszIntegerBase.is_oddcCsdSrr r r r r is_evenszIntegerBase.is_evencCsdSrr r r r r size_in_bitsszIntegerBase.size_in_bitscCsdSrr r r r r size_in_bytesszIntegerBase.size_in_bytescCsdSrr r r r r is_perfect_squareszIntegerBase.is_perfect_squarecCsdSrr )r Z small_primer r r fail_if_divisible_bysz IntegerBase.fail_if_divisible_bycCsdSrr )r abr r r multiply_accumulateszIntegerBase.multiply_accumulatecCsdSrr )r sourcer r r setszIntegerBase.setcCsdSrr r,r r r inplace_inverseszIntegerBase.inplace_inversecCsdSrr r,r r r inverseszIntegerBase.inversecCsdSrr rr r r gcdszIntegerBase.gcdcCsdSrr rr r r lcmszIntegerBase.lcmcCsdSrr )rBr:r r r jacobi_symbolszIntegerBase.jacobi_symbolc Cs|dvr |S|ddkrHt||dd|}t|d||krDtd|Sd}|dd}|d@sr|d7}|dL}qX|d}t||dd|}|dkr|d7}q|||dkrqtdq||}t|||}t|||} t||dd|} | dkr~td|D]} t| d| |dkrqq| |kr8td||ft|d|| d|} | }| d|}| | d|} | | |} qt| 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. )rrLzCannot compute square rootrz'Cannot compute square root of %d mod %d)pow ValueError __class__r) r:prootsqzZeulermctrirCr r r _tonelli_shankssL           zIntegerBase._tonelli_shanksc Ks|dd}|dd}|dd}|dur6tj}|durN|durNtd|durf|durftd|pl|}|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 exclusiverLr)poprnewreadrQrrr) clskwargsr^r_r`bitsZ bytes_neededZsignificant_bits_msbZmsbr r r random)s"    zIntegerBase.randomc Ks|dd}|dd}|dd}|dd}|rFtdt|jd||fvrZtd|durj|d}d||fvr~td |durtj}||}||}d }d |kr|ksn|j||d }q||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_exclusiver`zUnknown keywords: z8max_inclusive and max_exclusive cannot be both specifiedrLz(Missing keyword to identify the intervalr)r_r`) rbrQstrkeysrrcrdr>rh) rerfrirjrkr`Z norm_maximumZ bits_neededZnorm_candidater r r random_rangeYs.        zIntegerBase.random_range)rr)r)N)N)N)9__name__ __module__ __qualname__abcabstractmethodr rrr staticmethodrrrrrrrr__bool__rrr r"r$r%r)r*r+r-r.r/r0r1r2r3r6r7r8r9r;r<r=r>r?r@rArDrFrGrHrIrJrKr] classmethodrhror r r r r&s                                              @ /r) rsZCryptodome.Util.py3compatrrrrZ Cryptodomerrr r r r s