a ‘db ã@sPdZdd„Zdd„Zdd„Zdd„Zd d „Zd d „Zed krLddlZe  ¡dS)z/Common functionality shared by several modules.cCsh|dkr dS|dkr| }|d@d|}t|ƒdddddddddddddddddddœ|dS)as Number of bits needed to represent a integer excluding any prefix 0 bits. As per definition from https://wiki.python.org/moin/BitManipulation and to match the behavior of the Python 3 API. 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%xééé)Ú0Ú1Ú2Ú3Ú4Ú5Ú6Ú7Ú8Ú9ÚaÚbÚcÚdÚeÚf)Úlen)ÚnumZhex_num©rú[/home/tom/ab/renpy-build/tmp/install.linux-x86_64/lib/python3.9/site-packages/rsa/common.pyÚbit_sizesüûrcCs>|dkrtd|ƒ‚|dkr dSd}|r:|d7}|dL}q$|S)zM Returns the number of bits required to hold a specific long number. rz%Only nonnegative numbers possible: %sr)Ú ValueError)ÚnumberÚbitsrrrÚ _bit_size=s  rcCs*tt|ƒdƒ\}}|s|dkr&|d7}|S)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. érr)Údivmodr)rÚquantaÚmodrrrÚ byte_sizeQs r#c Cs†d}d}d}d}|}|}|dkr\||}|||}}||||}}||||}}q|dkrl||7}|dkr|||7}|||fS)z@Returns a tuple (r, i, j) such that r = gcd(a, b) = ia + jb rrr) rrÚxÚyZlxZlyZoaÚobÚqrrrÚ extended_gcdls r(cCs,t||ƒ\}}}|dkr(td||fƒ‚|S)z`Returns x^-1 (mod n) >>> inverse(7, 4) 3 >>> (inverse(143, 4) * 143) % 4 1 rz*x (%d) and n (%d) are not relatively prime)r(r)r$ÚnÚdividerÚinvÚ_rrrÚinverse…s r-c CsXd}d}|D] }||9}q t||ƒD].\}}||}t||ƒ}|||||}q$|S)a…Chinese 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 rr)Úzipr-) Za_valuesZ modulo_valuesÚmr$ÚmoduloZm_iZa_iZM_ir+rrrÚcrt–s  r1Ú__main__rN) Ú__doc__rrr#r(r-r1Ú__name__ÚdoctestÚtestmodrrrrÚs)#