o ÍtBhJã @sÐdZddlZGdd„deƒZdedefdd„Zd edefd d „Zded edefd d„Zdededejeeeffdd„Z dededefdd„Z dej edej edefdd„Z e dkrfddlZe ¡dSdS)z/Common functionality shared by several modules.éNc s4eZdZd dededededdf ‡fdd „ Z‡ZS) ÚNotRelativePrimeErrorÚÚaÚbÚdÚmsgÚreturnNcs0tƒ |p d|||f¡||_||_||_dS)Nz.%d and %d are not relatively prime, divider=%i)ÚsuperÚ__init__rrr)Úselfrrrr©Ú __class__©úa/var/www/html/riverr-enterprise-integrations-main/venv/lib/python3.10/site-packages/rsa/common.pyr s zNotRelativePrimeError.__init__)r)Ú__name__Ú __module__Ú __qualname__ÚintÚstrr Ú __classcell__rrr rrs,rÚnumrc Cs6z| ¡WSty}z tdt|ƒƒ|‚d}~ww)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_lengthÚAttributeErrorÚ TypeErrorÚtype)rÚexrrrÚbit_sizes  €ÿrÚnumbercCs|dkrdStt|ƒdƒ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. réé)Úceil_divr)rrrrÚ byte_size8sr!ÚdivcCst||ƒ\}}|r |d7}|S)av 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"ÚquantaÚmodrrrr Qsr rrc CsŒd}d}d}d}|}|}|dkr1||}|||}}||||}}||||}}|dks|dkr9||7}|dkrA||7}|||fS)z@Returns a tuple (r, i, j) such that r = gcd(a, b) = ia + jb rrr) rrÚxÚyÚlxÚlyÚoaÚobÚqrrrÚ extended_gcdis"ü r-r&ÚncCs(t||ƒ\}}}|dkrt|||ƒ‚|S)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)r-r)r&r.ÚdividerÚinvÚ_rrrÚinverse‚s  r2Úa_valuesÚ modulo_valuesc CsXd}d}|D]}||9}qt||ƒ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)Úzipr2) r3r4Úmr&ÚmoduloÚm_iÚa_iÚM_ir0rrrÚcrt“s  r;Ú__main__)Ú__doc__ÚtypingÚ ValueErrorrrrr!r ÚTupler-r2ÚIterabler;rÚdoctestÚtestmodrrrrÚs""# ý