i,FSSKrSSKJrJrJrJr SSKJr "SS\5rg)N) iter_rangebordbchrABC)Randomc\rSrSr\R S5r\R S5r\R S5r\R S6Sj5r \ \R S7Sj55r \R S5r \R S5r \R S 5r\R S 5r\R S 5r\R S 5r\R S 5r\r\R S5r\R S5r\R S5r\R S5r\R S5r\R S5r\R S8Sj5r\R S8Sj5r\R S5r\R S8Sj5r\R S5r\R S5r\R S5r \R S5r!\R S5r"\R S5r#\R S5r$\R S 5r%\R S!5r&\R S"5r'\R S#5r(\R S$5r)\R S%5r*\R S&5r+\R S'5r,\R S(5r-\R S)5r.\R S*5r/\R S+5r0\R S,5r1\R S-5r2\R S.5r3\R S/5r4\ \R S055r5\ S15r6\7S25r8\7S35r9\ \R S455r:S5r;g)9 IntegerBase&cgNselfs S/var/www/html/trading/venv/lib/python3.13/site-packages/Crypto/Math/_IntegerBase.py__int__IntegerBase.__int__) cgr r rs r__str__IntegerBase.__str__-rrcgr r rs r__repr__IntegerBase.__repr__1rrcgr r )r block_size byteorders rto_bytesIntegerBase.to_bytes5rrcgr r ) byte_stringrs r from_bytesIntegerBase.from_bytes9 rcgr r rterms r__eq__IntegerBase.__eq__?rrcgr r r&s r__ne__IntegerBase.__ne__Crrcgr r r&s r__lt__IntegerBase.__lt__Grrcgr r r&s r__le__IntegerBase.__le__Krrcgr r r&s r__gt__IntegerBase.__gt__Orrcgr r r&s r__ge__IntegerBase.__ge__Srrcgr r rs r __nonzero__IntegerBase.__nonzero__Wrrcgr r rs r is_negativeIntegerBase.is_negative\rrcgr r r&s r__add__IntegerBase.__add__arrcgr r r&s r__sub__IntegerBase.__sub__errcgr r )rfactors r__mul__IntegerBase.__mul__irrcgr r rdivisors r __floordiv__IntegerBase.__floordiv__mrrcgr r rJs r__mod__IntegerBase.__mod__qrrNcgr r rexponentmoduluss r inplace_powIntegerBase.inplace_powurrcgr r rRs r__pow__IntegerBase.__pow__yrrcgr r rs r__abs__IntegerBase.__abs__}rrcgr r rrTs rsqrtIntegerBase.sqrtrrcgr r r&s r__iadd__IntegerBase.__iadd__rrcgr r r&s r__isub__IntegerBase.__isub__rrcgr r r&s r__imul__IntegerBase.__imul__rrcgr r r&s r__imod__IntegerBase.__imod__rrcgr r r&s r__and__IntegerBase.__and__rrcgr r r&s r__or__IntegerBase.__or__rrcgr r rposs r __rshift__IntegerBase.__rshift__rrcgr r rts r __irshift__IntegerBase.__irshift__rrcgr r rts r __lshift__IntegerBase.__lshift__rrcgr r rts r __ilshift__IntegerBase.__ilshift__rrcgr r )rns rget_bitIntegerBase.get_bitrrcgr r rs ris_oddIntegerBase.is_oddrrcgr r rs ris_evenIntegerBase.is_evenrrcgr r rs r size_in_bitsIntegerBase.size_in_bitsrrcgr r rs r size_in_bytesIntegerBase.size_in_bytesrrcgr r rs ris_perfect_squareIntegerBase.is_perfect_squarerrcgr r )r small_primes rfail_if_divisible_by IntegerBase.fail_if_divisible_byrrcgr r )rabs rmultiply_accumulateIntegerBase.multiply_accumulaterrcgr r )rsources rsetIntegerBase.setrrcgr r r^s rinplace_inverseIntegerBase.inplace_inverserrcgr r r^s rinverseIntegerBase.inverserrcgr r r&s rgcdIntegerBase.gcdrrcgr r r&s rlcmIntegerBase.lcmrrcgr r )rrs r jacobi_symbolIntegerBase.jacobi_symbolr$rcUS;aU$US-S:Xa0[XS-S-U5n[USU5U:wa [S5eU$SnUS- S-nUS-(dUS- nUS-nUS-(dMURS5n[XQS- S-U5nUS:XaUS- nM XaS- :XaO [S5eUn[XTU5n[XU5n [XS-S-U5n U S:wav[SU5Hn [U SU -U5S:XdM O W U:Xa[SX4-5e[USX{- S- -U5n U nU S-U-nXS--U-n X-U-n U S:waMv[U SU5U:wa [S5eU $) anTonelli-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) rprootsqzeulermctrirs r_tonelli_shanksIntegerBase._tonelli_shankss" ;H q5A:qq5Q,*D4A!# !=>>K  UqLq5 FA !GAq55 KKNEa<+EzQA~9: :  aL aL Ea< #1f1%q!Q$?a'&Av !JaV!STTAq1519~q)AA1qATQA! A1f q!Q<1 9: :rc URSS5nURSS5nURSS5nUc[R"5RnUcUc [ S5eUbUb [ S5eU=(d UnUS- S-S-nSUS-U- - n[ U"S5S 5nUb USUS- --nUSU-S- -nUR [U5U"US- 5-5$) aGenerate 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)poprnewreadrrr"r) clskwargsrrrbits bytes_neededsignificant_bits_msbmsbs rrandomIntegerBase.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