U

+�[��@shdd
lm
Z

Gdd�de�Zdd�Zdd�Zdd	�Zd
d�Zdd
�Zdd�Z	e
dkrdddlZe��
dS)�)
�zipcseZ
dZd�f
dd�	Z�ZS)�NotRelativePrimeErrorNcs4tt
|��|pd
|
||f�

|
|_||_||_dS)Nz.%d and %d are not relatively prime, divider=%i)�superr�__init__�
a�
b�
d)�selfrrr�msg�
�	__class__��,/usr/lib/python3/dist-packages/rsa/common.pyrs


�

zNotRelativePrimeError.__init__)
N)�__name__�
__module__�__qualname__r�
__classcell__r
r
rrrs
rc

Cs4z
|��WSt
k
r.


td
t|�
�
�
YnXdS)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)
�numr
r
r�bit_sizes



rc

Cs|d
krdStt
|�
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)
Znumberr
r
r�	byte_size;s

rcCst||
�\}}|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)rZdivZquanta�modr
r
rrTs


rc	Cs�d
}d}d}d
}|}|
}|
d
kr\||
}|
||
}}
||||}}||||}}q|d
krl||7}|d
kr|||7}|||fS)z@Returns a tuple (r, i, j) such that r = gcd(a, b) = ia + jb
    r
rr
)	rr�
x�
yZlxZlyZoa�ob�
qr
r
r�extended_gcdls 














r#cCs(t||
�\}}}|d
kr$t
||
|��
|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�
nZdivider�inv�
_r
r
r�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
)rr')	Za_valuesZ
modulo_values�
mrZmoduloZm_iZa_iZM_ir%r
r
r�crt�s





r)�__main__N)
Zrsa._compatr�
ValueErrorrrrrr#r'r)rZdoctestZtestmodr
r
r
r�<module>s	#