(phG .SrSSKr"SS\5rS\S\4SjrS\S\4S jrS\S \S\4S jrS \S \S\R\\\44Sjr S\S\S\4Sjr S\R\S\R\S\4Sjr \ S:XaSSKr\R"5 gg)z/Common functionality shared by several modules.Nc D^\rSrSrS S\S\S\S\SS4 U4SjjjrS rU=r$) NotRelativePrimeErrorabdmsgreturnNcd>[TU]U=(d SXU4-5 XlX lX0lg)Nz.%d and %d are not relatively prime, divider=%i)super__init__rrr)selfrrrr __class__s =/var/www/html/venv/lib/python3.13/site-packages/rsa/common.pyr NotRelativePrimeError.__init__s1 \ PTUZ[S\ \])rrr)) __name__ __module__ __qualname____firstlineno__intstrr __static_attributes__ __classcell__)rs@rrrs0###Crrnumr cxUR5$![an[S[U5-5UeSnAff=f)a Number of bits needed to represent a integer excluding any prefix 0 bits. Usage:: >>> bit_size(1023) 10 >>> bit_size(1024) 11 >>> bit_size(1025) 11 :param num: Integer value. If num is 0, returns 0. Only the absolute value of the number is considered. Therefore, signed integers will be abs(num) before the number's bit length is determined. :returns: Returns the number of bits in the integer. z,bit_size(num) only supports integers, not %rN) bit_lengthAttributeError TypeErrortype)rexs rbit_sizer#s?,\~~ \FcRSY[[\s 949numberc:US:Xag[[U5S5$)a\ Returns the number of bytes required to hold a specific long number. The number of bytes is rounded up. Usage:: >>> byte_size(1 << 1023) 128 >>> byte_size((1 << 1024) - 1) 128 >>> byte_size(1 << 1024) 129 :param number: An unsigned integer :returns: The number of bytes required to hold a specific long number. r)ceil_divr#)r$s r byte_sizer)8s ({ HV$a ((rdivc8[X5up#U(aUS- nU$)aF Returns the ceiling function of a division between `num` and `div`. Usage:: >>> ceil_div(100, 7) 15 >>> ceil_div(100, 10) 10 >>> ceil_div(1, 4) 1 :param num: Division's numerator, a number :param div: Division's divisor, a number :return: Rounded up result of the division between the parameters. r&)divmod)rr*quantamods rr(r(Qs!$"KF !  MrrrcSnSnSnSnUnUnUS:wa!X-nXU-pXHU-- UpBXXU-- UpSUS:waM!US:aXG- nUS:aXV- nXU4$)z;Returns a tuple (r, i, j) such that r = gcd(a, b) = ia + jbrr&) rrxylxlyoaobqs r extended_gcdr8is A A B B B B q& FUAa%L1Ba%L1B q&  Av  Av  "9rr1ncF[X5up#nUS:wa [XU5eU$)z}Returns the inverse of x % n under multiplication, a.k.a x^-1 (mod n) >>> inverse(7, 4) 3 >>> (inverse(143, 4) * 143) % 4 1 r&)r8r)r1r9dividerinv_s rinverser>s,%Q*W1!|#A'22 Jra_values modulo_valuescSnSnUHnX$-nM [X5H!upVX%-n[Xu5nX6U-U--U-nM# U$)aYChinese Remainder Theorem. Calculates x such that x = a[i] (mod m[i]) for each i. :param a_values: the a-values of the above equation :param modulo_values: the m-values of the above equation :returns: x such that x = a[i] (mod m[i]) for each i >>> crt([2, 3], [3, 5]) 8 >>> crt([2, 3, 2], [3, 5, 7]) 23 >>> crt([2, 3, 0], [7, 11, 15]) 135 r&r)zipr>) r?r@mr1modulom_ia_iM_ir<s rcrtrHs_( A A  -2 hc sS A % 3 Hr__main__)__doc__typing ValueErrorrrr#r)r(Tupler8r>IterablerHrdoctesttestmodr0rrrQs6 J\#\#\8)c)c)2#CC0CCFLLc3$?0sss"  &//#&  vs7K  PS  F z OOr