File manager - Edit - /usr/local/CyberCP/lib/python3.10/site-packages/rsa/__pycache__/common.cpython-310.pyc
Back
o �hG � @ s� d Z ddlZG dd� de�Zdedefdd�Zd edefd d �Zded edefd d�Zdededejeeef fdd�Z dededefdd�Z dej e dej e defdd�Z e dkrfddlZe�� dS dS ) z/Common functionality shared by several modules.� Nc s4 e Zd Zd dededededdf � fdd � Z� ZS ) �NotRelativePrimeError� �a�b�d�msg�returnNc s0 t � �|p d|||f � || _|| _|| _d S )Nz.%d and %d are not relatively prime, divider=%i)�super�__init__r r r )�selfr r r r �� __class__� �=/usr/local/CyberCP/lib/python3.10/site-packages/rsa/common.pyr s z NotRelativePrimeError.__init__)r )�__name__� __module__� __qualname__�int�strr � __classcell__r r r r r s ,r �numr c C s6 z| � � W S ty } 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 �exr r r �bit_size s ��r �numberc C s | dkrdS t t| �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 )r r r r � byte_size8 s r! �divc C s t | |�\}}|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)r r" �quanta�modr r r r Q s r r r c C s� d}d}d}d}| }|}|dkr1| | }|| | } }||| |}}||| |}}|dks|dk r9||7 }|dk rA||7 }| ||fS )z;Returns a tuple (r, i, j) such that r = gcd(a, b) = ia + jbr r r ) r r �x�y�lx�ly�oa�ob�qr r r � extended_gcdi s" � r- r& �nc C s( 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�_r r r �inverse� s r2 �a_values� modulo_valuesc C sX d}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 r r )�zipr2 ) r3 r4 �mr& �modulo�m_i�a_i�M_ir0 r r r �crt� s r; �__main__)�__doc__�typing� ValueErrorr r r r! r �Tupler- r2 �Iterabler; r �doctest�testmodr r r r �<module> s ""# �
| ver. 1.4 |
Github
|
.
| PHP 8.2.28 | Generation time: 0.02 |
proxy
|
phpinfo
|
Settings