,h,FddlZddlmZmZmZmZddlmZGddeZy)N) iter_rangebordbchrABC)RandomceZdZejdZejdZejdZejd4dZe ejd5dZ ejdZ ejdZ ejdZ ejd Zejd Zejd Zejd ZeZejd ZejdZejdZejdZejdZejdZejd6dZejd6dZejdZejd6dZejdZejdZejdZejdZ ejdZ!ejdZ"ejdZ#ejdZ$ejd Z%ejd!Z&ejd"Z'ejd#Z(ejd$Z)ejd%Z*ejd&Z+ejd'Z,ejd(Z-ejd)Z.ejd*Z/ejd+Z0ejd,Z1ejd-Z2ejd.Z3e ejd/Z4e d0Z5e6d1Z7e6d2Z8e ejd3Z9y)7 IntegerBasecyNselfs Z/var/www/html/Resume-Scraper/venv/lib/python3.12/site-packages/Crypto/Math/_IntegerBase.py__int__zIntegerBase.__int__) cyr r r s r__str__zIntegerBase.__str__-rrcyr r r s r__repr__zIntegerBase.__repr__1rrcyr r )r block_size byteorders rto_byteszIntegerBase.to_bytes5rrcyr r ) byte_stringrs r from_byteszIntegerBase.from_bytes9 rcyr r rterms r__eq__zIntegerBase.__eq__?rrcyr r r s r__ne__zIntegerBase.__ne__Crrcyr r r s r__lt__zIntegerBase.__lt__Grrcyr r r s r__le__zIntegerBase.__le__Krrcyr r r s r__gt__zIntegerBase.__gt__Orrcyr r r s r__ge__zIntegerBase.__ge__Srrcyr r r s r __nonzero__zIntegerBase.__nonzero__Wrrcyr r r s r is_negativezIntegerBase.is_negative\rrcyr r r s r__add__zIntegerBase.__add__arrcyr r r s r__sub__zIntegerBase.__sub__errcyr r )rfactors r__mul__zIntegerBase.__mul__irrcyr r rdivisors r __floordiv__zIntegerBase.__floordiv__mrrcyr r r9s r__mod__zIntegerBase.__mod__qrrNcyr r rexponentmoduluss r inplace_powzIntegerBase.inplace_powurrcyr r r?s r__pow__zIntegerBase.__pow__yrrcyr r r s r__abs__zIntegerBase.__abs__}rrcyr r rrAs rsqrtzIntegerBase.sqrtrrcyr r r s r__iadd__zIntegerBase.__iadd__rrcyr r r s r__isub__zIntegerBase.__isub__rrcyr r r s r__imul__zIntegerBase.__imul__rrcyr r r s r__imod__zIntegerBase.__imod__rrcyr r r s r__and__zIntegerBase.__and__rrcyr r r s r__or__zIntegerBase.__or__rrcyr r rposs r __rshift__zIntegerBase.__rshift__rrcyr r rWs r __irshift__zIntegerBase.__irshift__rrcyr r rWs r __lshift__zIntegerBase.__lshift__rrcyr r rWs r __ilshift__zIntegerBase.__ilshift__rrcyr r )rns rget_bitzIntegerBase.get_bitrrcyr r r s ris_oddzIntegerBase.is_oddrrcyr r r s ris_evenzIntegerBase.is_evenrrcyr r r s r size_in_bitszIntegerBase.size_in_bitsrrcyr r r s r size_in_byteszIntegerBase.size_in_bytesrrcyr r r s ris_perfect_squarezIntegerBase.is_perfect_squarerrcyr r )r small_primes rfail_if_divisible_byz IntegerBase.fail_if_divisible_byrrcyr r )rabs rmultiply_accumulatezIntegerBase.multiply_accumulaterrcyr r )rsources rsetzIntegerBase.setrrcyr r rHs rinplace_inversezIntegerBase.inplace_inverserrcyr r rHs rinversezIntegerBase.inverserrcyr r r s rgcdzIntegerBase.gcdrrcyr r r s rlcmzIntegerBase.lcmrrcyr r )rqras r jacobi_symbolzIntegerBase.jacobi_symbolrrc|dvr|S|dzdk(r0t||dzdz|}t|d||k7r td|Sd}|dz dz}|dzs|dz }|dz}|dzs|jd} t||dz dz|}|dk(r|dz }||dz k(rn td|}t|||}t|||} t||dzdz|} | dk7rttd|D]} t| d| z|dk(sn |k(rtd||fzt|d|| z dz z|} | }| dz|z}| | dzz|z} | | z|z} | dk7rtt| d||k7r td| 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. )rrzCannot compute square rootrz'Cannot compute square root of %d mod %d)pow ValueError __class__r) raprootsqzeulermctrirrs r_tonelli_shankszIntegerBase._tonelli_shankss" ;H q5A:q1q5Q,*D4A!# !=>>K  UqLq5 FA !GAq5 KKNAEa<+EzQA~9: :  1aL 1aL AEa< #1f1% q!Q$?a' Av !JaQRV!STTAq1q519~q)AA1qAQTQAQ! A1f q!Q<1 9: :rc |jdd}|jdd}|jdd}|tjj}| | t d| | t d|xs|}|dz dzdz}d|dz|z z }t |dd }| |d|dz zz}|d|zdz z}|j t|||dz zS) 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 exclusiverr)poprnewreadrrrr) clskwargsrrrbits bytes_neededsignificant_bits_msbmsbs rrandomzIntegerBase.random)s2ZZ d3 ::j$/::j$/  zz|((H  ("2RS S  !h&:QR R%Xa1,  L1$4t$;<8A;q>"  ! 1-12 2C ))Q..~~d3i(>@-F-F^-.-.^  rr ) rCrypto.Util.py3compatrrrrCryptorr r rrrs!> ==v #v r