Файловый менеджер - Редактировать - /opt/imh-python/lib/python3.9/site-packages/Cryptodome/Math/__pycache__/_IntegerGMP.cpython-39.pyc
Ðазад
a b�h�b � @ s d dl Z d dlmZmZ d dlmZmZmZmZm Z m Z m Z m Z ddl mZ dZe jdkrbed��ed e�Zd ed �Zeed �r�ed ��ed dkr�d dlmZmZmZmZ G dd� de�Zdd� Znd dlm Z dd� ZG dd� de �Z e � Z G dd� de�Z dS )� N)�tobytes� is_native_int)�backend�load_lib�get_raw_buffer� get_c_string� null_pointer�create_string_buffer�c_ulong�c_size_t� )� IntegerBasea{ typedef unsigned long UNIX_ULONG; typedef struct { int a; int b; void *c; } MPZ; typedef MPZ mpz_t[1]; typedef UNIX_ULONG mp_bitcnt_t; void __gmpz_init (mpz_t x); void __gmpz_init_set (mpz_t rop, const mpz_t op); void __gmpz_init_set_ui (mpz_t rop, UNIX_ULONG op); int __gmp_sscanf (const char *s, const char *fmt, ...); void __gmpz_set (mpz_t rop, const mpz_t op); int __gmp_snprintf (uint8_t *buf, size_t size, const char *fmt, ...); void __gmpz_add (mpz_t rop, const mpz_t op1, const mpz_t op2); void __gmpz_add_ui (mpz_t rop, const mpz_t op1, UNIX_ULONG op2); void __gmpz_sub_ui (mpz_t rop, const mpz_t op1, UNIX_ULONG op2); void __gmpz_addmul (mpz_t rop, const mpz_t op1, const mpz_t op2); void __gmpz_addmul_ui (mpz_t rop, const mpz_t op1, UNIX_ULONG op2); void __gmpz_submul_ui (mpz_t rop, const mpz_t op1, UNIX_ULONG op2); void __gmpz_import (mpz_t rop, size_t count, int order, size_t size, int endian, size_t nails, const void *op); void * __gmpz_export (void *rop, size_t *countp, int order, size_t size, int endian, size_t nails, const mpz_t op); size_t __gmpz_sizeinbase (const mpz_t op, int base); void __gmpz_sub (mpz_t rop, const mpz_t op1, const mpz_t op2); void __gmpz_mul (mpz_t rop, const mpz_t op1, const mpz_t op2); void __gmpz_mul_ui (mpz_t rop, const mpz_t op1, UNIX_ULONG op2); int __gmpz_cmp (const mpz_t op1, const mpz_t op2); void __gmpz_powm (mpz_t rop, const mpz_t base, const mpz_t exp, const mpz_t mod); void __gmpz_powm_ui (mpz_t rop, const mpz_t base, UNIX_ULONG exp, const mpz_t mod); void __gmpz_pow_ui (mpz_t rop, const mpz_t base, UNIX_ULONG exp); void __gmpz_sqrt(mpz_t rop, const mpz_t op); void __gmpz_mod (mpz_t r, const mpz_t n, const mpz_t d); void __gmpz_neg (mpz_t rop, const mpz_t op); void __gmpz_abs (mpz_t rop, const mpz_t op); void __gmpz_and (mpz_t rop, const mpz_t op1, const mpz_t op2); void __gmpz_ior (mpz_t rop, const mpz_t op1, const mpz_t op2); void __gmpz_clear (mpz_t x); void __gmpz_tdiv_q_2exp (mpz_t q, const mpz_t n, mp_bitcnt_t b); void __gmpz_fdiv_q (mpz_t q, const mpz_t n, const mpz_t d); void __gmpz_mul_2exp (mpz_t rop, const mpz_t op1, mp_bitcnt_t op2); int __gmpz_tstbit (const mpz_t op, mp_bitcnt_t bit_index); int __gmpz_perfect_square_p (const mpz_t op); int __gmpz_jacobi (const mpz_t a, const mpz_t b); void __gmpz_gcd (mpz_t rop, const mpz_t op1, const mpz_t op2); UNIX_ULONG __gmpz_gcd_ui (mpz_t rop, const mpz_t op1, UNIX_ULONG op2); void __gmpz_lcm (mpz_t rop, const mpz_t op1, const mpz_t op2); int __gmpz_invert (mpz_t rop, const mpz_t op1, const mpz_t op2); int __gmpz_divisible_p (const mpz_t n, const mpz_t d); int __gmpz_divisible_ui_p (const mpz_t n, UNIX_ULONG d); �win32zNot using GMP on WindowsZgmp)Zlibrary�apiZ__mpir_versionzMPIR library detectedr �ctypes)� Structure�c_int�c_void_p�byrefc @ s" e Zd ZdefdefdefgZdS )�_MPZZ _mp_allocZ_mp_sizeZ_mp_dN)�__name__� __module__� __qualname__r r Z_fields_� r r ��/root/rpmbuild/BUILDROOT/imh-python39-modules-3.9.7-92.el8.x86_64/opt/imh-python/lib/python3.9/site-packages/Cryptodome/Math/_IntegerGMP.pyr n s �r c C s t t� �S �N)r r r r r r �new_mpzs s r )�ffic C s t �d�S )NzMPZ*)r �newr r r r r z s c @ s e Zd Zdd� ZdS )�_GMPc C s^ |� d�r d|dd � }n(|� d�r8d|dd � }n td| ��tt|�}t| ||� |S )NZmpz_Z__gmpz_� Zgmp_Z__gmp_zAttribute %s is invalid)� startswith�AttributeError�getattr�lib�setattr)�self�name� func_name�funcr r r � __getattr__� s z_GMP.__getattr__N)r r r r* r r r r r s r c @ s� e Zd ZdZe� Ze�eed�� dd� Z dd� Z dd� Z d d � Z d d � Z d d� Zdjdd�Zedd� �Zdd� Zdd� Zdd� Zdd� Zdd � Zd d � Zd d � Zd!d"� ZeZd#d$� Zd%d&� Z d'd(� Z d)d*� Z d+d,� Z d-d.� Z dkd0d1�Z!dld2d3�Z"d4d5� Z#dmd6d7�Z$d8d9� Z%d:d;� Z&d<d=� Z'd>d?� Z(d@dA� Z)dBdC� Z*dDdE� Z+dFdG� Z,dHdI� Z-dJdK� Z.dLdM� Z/dNdO� Z0dPdQ� Z1dRdS� Z2dTdU� Z3dVdW� Z4dXdY� Z5dZd[� Z6d\d]� Z7d^d_� Z8d`da� Z9dbdc� Z:ddde� Z;edfdg� �Z<dhdi� Z=d/S )n� IntegerGMPz#A fast, arbitrary precision integerr c C s� t � | _d| _t|t�r td��d| _t|�rht�| j� t� t t |��d| j�}|dkr�td| ��n t|t �r�t� | j|j� nt�dS )z*Initialize the integer to the given value.Fz-A floating point type is not a natural numberT� %Zdr zError converting '%d'N)r �_mpz_p� _initialized� isinstance�float� ValueErrorr �_gmpZmpz_initZ gmp_sscanfr �strr+ Z mpz_init_set�NotImplementedError)r& �value�resultr r r �__init__� s zIntegerGMP.__init__c C s@ t �| jd�d d }t|�}t �|t|�d| j� tt|��S )N� � r, )r2 �mpz_sizeinbaser- r Z gmp_snprintfr �intr )r& �buf_len�bufr r r �__int__� s zIntegerGMP.__int__c C s t t| ��S r )r3 r; �r& r r r �__str__� s zIntegerGMP.__str__c C s dt | � S )Nz Integer(%s))r3 r? r r r �__repr__� s zIntegerGMP.__repr__c C s t t| ��S r )�hexr; r? r r r �__hex__� s zIntegerGMP.__hex__c C s t | �S r )r; r? r r r � __index__� s zIntegerGMP.__index__c C s� | dk rt d��t�| jd�d d }|| kr:dkrFn nt d��t|�}t�|tdtd�dtd�| j� dtd|| � t |� S ) a= Convert the number into a byte string. This method encodes the number in network order and prepends as many zero bytes as required. It only works for non-negative values. :Parameters: block_size : integer The exact size the output byte string must have. If zero, the string has the minimal length. :Returns: A byte string. :Raise ValueError: If the value is negative or if ``block_size`` is provided and the length of the byte string would exceed it. r �.Conversion only valid for non-negative numbersr8 � � z?Number is too big to convert to byte stringof prescribed lengthr � ) r1 r2 r: r- r Z mpz_exportr r �maxr )r& � block_sizer< r= r r r �to_bytes� s � zIntegerGMP.to_bytesc C s4 t d�}t�|jtt| ��dtd�dtd�| � |S )a Convert a byte string into a number. :Parameters: byte_string : byte string The input number, encoded in network order. It can only be non-negative. :Return: The ``Integer`` object carrying the same value as the input. r r )r+ r2 Z mpz_importr- r �len)Z byte_stringr6 r r r � from_bytes� s �zIntegerGMP.from_bytesc C s t |t�st|�}|| j|j�S r )r/ r+ r- )r& r) �termr r r �_apply_and_return s z IntegerGMP._apply_and_returnc C s( t |t�st|�sdS | �tj|�dkS )NFr �r/ r+ r rO r2 �mpz_cmp�r& rN r r r �__eq__ s zIntegerGMP.__eq__c C s( t |t�st|�sdS | �tj|�dkS )NTr rP rR r r r �__ne__ s zIntegerGMP.__ne__c C s | � tj|�dk S �Nr �rO r2 rQ rR r r r �__lt__ s zIntegerGMP.__lt__c C s | � tj|�dkS rU rV rR r r r �__le__ s zIntegerGMP.__le__c C s | � tj|�dkS rU rV rR r r r �__gt__ s zIntegerGMP.__gt__c C s | � tj|�dkS rU rV rR r r r �__ge__ s zIntegerGMP.__ge__c C s t �| j| j�dkS rU �r2 rQ r- � _zero_mpz_pr? r r r � __nonzero__ s zIntegerGMP.__nonzero__c C s t �| j| j�dk S rU r[ r? r r r � is_negative s zIntegerGMP.is_negativec C sN t d�}t|t �s6z t |�}W n ty4 t Y S 0 t�|j| j|j� |S rU )r+ r/ r4 �NotImplementedr2 �mpz_addr- �r& rN r6 r r r �__add__$ s �zIntegerGMP.__add__c C sN t d�}t|t �s6z t |�}W n ty4 t Y S 0 t�|j| j|j� |S rU )r+ r/ r4 r_ r2 �mpz_subr- ra r r r �__sub__0 s �zIntegerGMP.__sub__c C sN t d�}t|t �s6z t |�}W n ty4 t Y S 0 t�|j| j|j� |S rU )r+ r/ r4 r_ r2 �mpz_mulr- ra r r r �__mul__< s �zIntegerGMP.__mul__c C sN t |t�st|�}t�|j| j�dkr.td��td�}t�|j| j|j� |S )Nr �Division by zero)r/ r+ r2 rQ r- r\ �ZeroDivisionErrorZ mpz_fdiv_q)r& �divisorr6 r r r � __floordiv__H s ���zIntegerGMP.__floordiv__c C sb t |t�st|�}t�|j| j�}|dkr2td��|dk rBtd��td�}t�|j| j|j� |S �Nr rg �Modulus must be positive� r/ r+ r2 rQ r- r\ rh r1 Zmpz_mod)r& ri �compr6 r r r �__mod__T s ��zIntegerGMP.__mod__Nc C s� |d u rD|dk rt d��|dkr(t d��t�| j| jtt|��� n�t|t�sVt|�}|sbtd��|� � rrt d��t |�r�|dk r�t d��|dk r�t� | j| jt|�|j� | S t|�}n|� � r�t d��t� | j| j|j|j� | S )Nr z Exponent must not be negative� zExponent is too bigrg rl � ) r1 r2 Z mpz_pow_uir- r r; r/ r+ rh r^ r Z mpz_powm_uiZmpz_powm)r& �exponent�modulusr r r � inplace_powc sD � � �zIntegerGMP.inplace_powc C s t | �}|�||�S r )r+ rt )r& rr rs r6 r r r �__pow__� s zIntegerGMP.__pow__c C s t d�}t�|j| j� |S rU )r+ r2 Zmpz_absr- )r& r6 r r r �__abs__� s zIntegerGMP.__abs__c C sf |du r2| dk rt d��td�}t�|j| j� n0|dkrBt d��t|�}t| �t| �| |��}|S )zGReturn the largest Integer that does not exceed the square rootNr z Square root of negative valuerl )r1 r+ r2 Zmpz_sqrtr- r; Z_tonelli_shanks�r& rs r6 r r r �sqrt� s �zIntegerGMP.sqrtc C s� t |�rvd| kr dk r:n nt�| j| jt|�� | S d| k rNdk rnn n t�| j| jt| �� | S t|�}t�| j| j|j� | S �Nr rq � ��)r r2 � mpz_add_uir- r � mpz_sub_uir+ r` rR r r r �__iadd__� s& ���zIntegerGMP.__iadd__c C s� t |�rvd| kr dk r:n nt�| j| jt|�� | S d| k rNdk rnn n t�| j| jt| �� | S t|�}t�| j| j|j� | S ry )r r2 r| r- r r{ r+ rc rR r r r �__isub__� s& ���zIntegerGMP.__isub__c C s� t |�r�d| kr dk r:n nt�| j| jt|�� | S d| k rNdk r~n n,t�| j| jt| �� t�| j| j� | S t|�}t�| j| j|j� | S ry )r r2 Z mpz_mul_uir- r Zmpz_negr+ re rR r r r �__imul__� s( ���zIntegerGMP.__imul__c C sZ t |t�st|�}t�|j|j�}|dkr2td��|dk rBtd��t�| j| j|j� | S rk rm )r& ri rn r r r �__imod__� s ��zIntegerGMP.__imod__c C s2 t d�}t|t �st |�}t�|j| j|j� |S rU )r+ r/ r2 Zmpz_andr- ra r r r �__and__� s �zIntegerGMP.__and__c C s2 t d�}t|t �st |�}t�|j| j|j� |S rU )r+ r/ r2 Zmpz_iorr- ra r r r �__or__� s �zIntegerGMP.__or__c C sN t d�}|dk rtd��|dkr0| dk r,dS dS t�|j| jtt|��� |S �Nr znegative shift countrq ���)r+ r1 r2 �mpz_tdiv_q_2expr- r r; �r& �posr6 r r r � __rshift__� s �zIntegerGMP.__rshift__c C sF |dk rt d��|dkr(| dk r$dS dS t�| j| jtt|��� | S r� )r1 r2 r� r- r r; �r& r� r r r � __irshift__ s �zIntegerGMP.__irshift__c C sD t d�}d| kr dk s&n td��t�|j| jtt|��� |S �Nr rq zIncorrect shift count)r+ r1 r2 � mpz_mul_2expr- r r; r� r r r � __lshift__ s �zIntegerGMP.__lshift__c C s< d| krdk s n t d��t�| j| jtt|��� | S r� )r1 r2 r� r- r r; r� r r r � __ilshift__! s �zIntegerGMP.__ilshift__c C sF | dk rt d��|dk r t d��|dkr,dS tt�| jtt|����S )zPReturn True if the n-th bit is set to 1. Bit 0 is the least significant.r z)no bit representation for negative valuesznegative bit countrq )r1 �boolr2 � mpz_tstbitr- r r; )r& �nr r r �get_bit) s �zIntegerGMP.get_bitc C s t �| jd�dkS )Nr r �r2 r� r- r? r r r �is_odd7 s zIntegerGMP.is_oddc C s t �| jd�dkS rU r� r? r r r �is_even: s zIntegerGMP.is_evenc C s | dk rt d��t�| jd�S )z=Return the minimum number of bits that can encode the number.r rE r8 )r1 r2 r: r- r? r r r � size_in_bits= s zIntegerGMP.size_in_bitsc C s | � � d d d S )z>Return the minimum number of bytes that can encode the number.r rG )r� r? r r r � size_in_bytesD s zIntegerGMP.size_in_bytesc C s t �| j�dkS rU )r2 Zmpz_perfect_square_pr- r? r r r �is_perfect_squareH s z IntegerGMP.is_perfect_squarec C sb t |�rFd| k r dk r>n n t�| jt|��r:td��dS t|�}t�| j|j�r^td��dS )z3Raise an exception if the small prime is a divisor.r rq zThe value is compositeN)r r2 Zmpz_divisible_ui_pr- r r1 r+ Zmpz_divisible_p)r& Z small_primer r r �fail_if_divisible_byK s ��z IntegerGMP.fail_if_divisible_byc C s� t |t�st|�}t|�r�d| k r.dk rLn nt�| j|jt|�� | S d| k r`dk r�n n t�| j|jt| �� | S t|�}t�| j|j|j� | S )z/Increment the number by the product of a and b.r rq rz ) r/ r+ r r2 Z mpz_addmul_uir- r Z mpz_submul_uiZ mpz_addmul)r& �a�br r r �multiply_accumulateY s* ���z IntegerGMP.multiply_accumulatec C s& t |t�st|�}t�| j|j� | S )z'Set the Integer to have the given value)r/ r+ r2 Zmpz_setr- )r& �sourcer r r �seto s �zIntegerGMP.setc C sf t |t�st|�}t�|j| j�}|dkr2td��|dk rBtd��t�| j| j|j�}|sbtd��| S )z�Compute the inverse of this number in the ring of modulo integers. Raise an exception if no inverse exists. r zModulus cannot be zerorl z No inverse value can be computed) r/ r+ r2 rQ r- r\ rh r1 Z mpz_invert)r& rs rn r6 r r r �inplace_inversex s ��zIntegerGMP.inplace_inversec C s t | �}|�|� |S r )r+ r� rw r r r �inverse� s zIntegerGMP.inversec C sb t d�}t|�rJd| k r$dk rBn nt�|j| jt|�� |S t |�}t�|j| j|j� |S )zUCompute the greatest common denominator between this number and another term.r i�� )r+ r r2 Z mpz_gcd_uir- r Zmpz_gcdra r r r �gcd� s �zIntegerGMP.gcdc C s2 t d�}t|t �st |�}t�|j| j|j� |S )zQCompute the least common multiplier between this number and another term.r )r+ r/ r2 Zmpz_lcmr- ra r r r �lcm� s zIntegerGMP.lcmc C sL t | t�st| �} t |t�s$t|�}|dks4|�� r<td��t�| j|j�S )zCompute the Jacobi symbolr z-n must be positive even for the Jacobi symbol)r/ r+ r� r1 r2 Z mpz_jacobir- )r� r� r r r � jacobi_symbol� s zIntegerGMP.jacobi_symbolc C s> z&| j d ur | jr t�| j � d | _ W n ty8 Y n0 d S r )r- r. r2 Z mpz_clearr" r? r r r �__del__� s zIntegerGMP.__del__)r )N)N)N)>r r r �__doc__r r\ r2 Zmpz_init_set_uir r7 r> r@ rA rC rD rK � staticmethodrM rO rS rT rW rX rY rZ r] �__bool__r^ rb rd rf rj ro rt ru rv rx r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r+ � sr & ' r+ )!�sysZCryptodome.Util.py3compatr r ZCryptodome.Util._raw_apir r r r r r r r Z _IntegerBaser Zgmp_defs�platform� ImportErrorr$ �implementation�hasattrr r r r r r r r �objectr r2 r+ r r r r �<module> s& ( 5
| ver. 1.1 | |
.
| PHP 8.3.30 | Ð“ÐµÐ½ÐµÑ€Ð°Ñ†Ð¸Ñ Ñтраницы: 0 |
proxy
|
phpinfo
|
ÐаÑтройка