o

��aG�	@s�dZd
dl
Z
Gdd�de�Zdedefdd�Zd	edefd
d�Zdededefd
d�Zdedede
jeeeffdd�Z	dededefdd�Z
de
jede
jedefdd�Ze
dkrfd
dlZe��
dSdS)z/Common functionality shared by several modules.�Ncs4eZ
dZd
dededededdf
�f
dd	�
Z�ZS)�NotRelativePrimeError��
a�
b�
d�msg�returnNcs0t��
|pd
|
||f�

|
|_||_||_dS)Nz.%d and %d are not relatively prime, divider=%i)�super�__init__rrr)�selfrrrr�
�	__class__��,/usr/lib/python3/dist-packages/rsa/common.pyr
s




zNotRelativePrimeError.__init__)
r)�__name__�
__module__�__qualname__�int�strr
�
__classcell__rrrrrs,
r�numrc

Cs6z|��WSt
y
}

z	td
t|�
�
|
�d}
~
w
w)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�numberc

Cs|d
krdStt
|�
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_size8s

r!�divcCst||
�\}}|r
|d
7}|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 Qs


r rrc	Cs�d
}d}d}d
}|}|
}|
d
kr1||
}|
||
}}
||||}}||||}}|
d
ks|d
kr9||7}|d
krA||7}|||fS)z;Returns a tuple (r, i, j) such that r = gcd(a, b) = ia + jbr
rr)	rr�
x�
y�lx�ly�oa�ob�
qrrr�extended_gcdis"









�




r-r&�
ncCs(t||
�\}}}|d
krt
||
|��
|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�<module>
s""#
�