File manager - Edit - /opt/saltstack/salt/lib/python3.10/site-packages/Cryptodome/Math/__pycache__/_IntegerGMP.cpython-310.pyc
Back
o ;j�l � @ s d dl Z d dlZd dlmZ d dlmZmZmZmZm Z ddl m Z dZ e j dkr-ed��ed e �Zd ed �Zeed �r@ed ��G d d� de�Ze� Zed dkrnd dlmZmZmZmZ G dd� de�Zdd� Zeej _ n d dlm Z dd� Zde� d� Z G dd� de �Z!dS ) � N)� is_native_int)�backend�load_lib�c_ulong�c_size_t� c_uint8_ptr� )� 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); UNIX_ULONG __gmpz_get_ui (const mpz_t op); void __gmpz_set (mpz_t rop, const mpz_t op); void __gmpz_set_ui (mpz_t rop, UNIX_ULONG op); 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); size_t __gmpz_size (const mpz_t op); UNIX_ULONG __gmpz_getlimbn (const mpz_t op, size_t n); �win32zNot using GMP on WindowsZgmp)�library�apiZ__mpir_versionzMPIR library detectedc @ s e Zd Zdd� ZdS )�_GMPc C s^ |� d�rd|dd � }n|� d�r d|dd � }ntd| ��tt|�}t| ||� |S )NZmpz_Z__gmpz_� Zgmp_Z__gmp_zAttribute %s is invalid)� startswith�AttributeError�getattr�lib�setattr)�self�nameZ func_name�func� r �O/opt/saltstack/salt/lib/python3.10/site-packages/Cryptodome/Math/_IntegerGMP.py� __getattr__p s z_GMP.__getattr__N)�__name__� __module__� __qualname__r r r r r r n s r r �ctypes)� Structure�c_int�c_void_p�byrefc @ s" e Zd ZdefdefdefgZdS )�_MPZZ _mp_allocZ_mp_sizeZ_mp_dN)r r r r r �_fields_r r r r r" � s �r" c C s t t� �S �N)r! r" r r r r �new_mpz� � r% )�ffic C s t �d�S )NzMPZ*)r' �newr r r r r% � r& � �Pc @ s� e Zd ZdZe� Ze�eed�� dd� Z dd� Z dd� Z d d � Z d d � Z d d� Zdmdd�Zedndd��Zdd� Zdd� Zdd� Zdd� Zd d � Zd d � Zd d!� Zd"d#� ZeZd$d%� Zd&d'� Z d(d)� Z d*d+� Z d,d-� Z d.d/� Z dod1d2�Z!dod3d4�Z"d5d6� Z#dod7d8�Z$d9d:� Z%d;d<� Z&d=d>� Z'd?d@� Z(dAdB� Z)dCdD� Z*dEdF� Z+dGdH� Z,dIdJ� Z-dKdL� Z.dMdN� Z/dOdP� Z0dQdR� Z1dSdT� Z2dUdV� Z3dWdX� Z4dYdZ� Z5d[d\� Z6d]d^� Z7d_d`� Z8dadb� Z9dcdd� Z:dedf� Z;edgdh� �Z<edidj� �Z=dkdl� Z>d0S )p� IntegerGMPz#A fast, arbitrary precision integerr c C s6 t � | _d| _t|t�rtd��t|�r�t�| j� d| _|dkr#dS t � }t�|� zG|dk}t |�}|� � d d d }|dkrl|d }t� |t d||d ? @ �� t� ||t |d �� t�| j| j|� |dksBW t�|� nt�|� w |s�t�| j| j� dS dS t|t�r�t�| j|j� d| _dS t�) z*Initialize the integer to the given value.Fz-A floating point type is not a natural numberTr Nr � � �� )r% �_mpz_p� _initialized� isinstance�float� ValueErrorr �_gmpZmpz_init�abs� bit_lengthZ mpz_set_uir � mpz_mul_2exp�mpz_add� mpz_clear�mpz_negr+ � mpz_init_set�NotImplementedError)r �value�tmpZpositive�reduce�slotsr r r �__init__� s@ ���� zIntegerGMP.__init__c C s� t � }t�|| j� z9d}d}t�|| j�dkr=t�|�d@ }|||d > O }t�||td�� |d }t�|| j�dksW t� |� nt� |� w | dk rQ| }t |�S )Nr r- r, r ) r% r3 r: r. �mpz_cmp� _zero_mpz_pZ mpz_get_ui�mpz_tdiv_q_2expr r8 �int)r r= r< ZslotZlsbr r r �__int__� s ��zIntegerGMP.__int__c C � t t| ��S r$ )�strrD �r r r r �__str__� � zIntegerGMP.__str__c C s dt | � S )Nz Integer(%s))rG rH r r r �__repr__� rJ zIntegerGMP.__repr__c C rF r$ )�hexrD rH r r r �__hex__� rJ zIntegerGMP.__hex__c C s t | �S r$ )rD rH r r r � __index__� s zIntegerGMP.__index__�bigc s@ �dk rt d��t��j�� tdkr d}td� |d d �� ntdkr0d }td� |d d �� nt d ��� �fd d�t� �D �}tjd|� g|�R � }t |�| }|dkr]|� d�}n$|dkrv|d|� d| krot d��||d� }n |dk r�d| | }|dkr�|ddd� }n |dkr�nt d��t |�dkr�d}|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. byteorder : string 'big' for big-endian integers (default), 'little' for litte-endian. :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 numbersr, �Lr � r �@ �Q� r) zUnknown limb sizec s" g | ] }t ��j� | d ��qS )r )r3 � mpz_getlimbnr. )�.0�i�Z num_limbsr r r � <listcomp> s " z'IntegerGMP.to_bytes.<locals>.<listcomp>�>� Nz@Number is too big to convert to byte string of prescribed length�little���rO �Incorrect byteorder) r2 r3 Zmpz_sizer. � _sys_bits�max�range�struct�pack�len�lstrip)r � block_size� byteorderZspcharZlimbs�resultZ cutoff_lenr rY r �to_bytes� s: zIntegerGMP.to_bytesc C sd t d�}|dkr n|dkrt| �} | �� ntd��t�|jtt| ��dtd�dtd�t | �� |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. byteorder : string 'big' for big-endian integers (default), 'little' for litte-endian. :Return: The ``Integer`` object carrying the same value as the input. r rO r] r_ r ) r+ � bytearray�reverser2 r3 Z mpz_importr. r re r )Z byte_stringrh ri r r r � from_bytes( s" �zIntegerGMP.from_bytesc C s t |t�s t|�}|| j|j�S r$ )r0 r+ r. )r r �termr r r �_apply_and_returnI s z IntegerGMP._apply_and_returnc C s( t |t�s t|�s dS | �tj|�dkS )NFr �r0 r+ r ro r3 rA �r rn r r r �__eq__N � zIntegerGMP.__eq__c C s( t |t�s t|�s dS | �tj|�dkS )NTr rp rq r r r �__ne__S rs zIntegerGMP.__ne__c C s | � tj|�dk S �Nr �ro r3 rA rq r r r �__lt__X � zIntegerGMP.__lt__c C s | � tj|�dkS ru rv rq r r r �__le__[ rx zIntegerGMP.__le__c C s | � tj|�dkS ru rv rq r r r �__gt__^ rx zIntegerGMP.__gt__c C s | � tj|�dkS ru rv rq r r r �__ge__a rx zIntegerGMP.__ge__c C s t �| j| j�dkS ru �r3 rA r. rB rH r r r � __nonzero__d � zIntegerGMP.__nonzero__c C s t �| j| j�dk S ru r| rH r r r � is_negativeh r~ zIntegerGMP.is_negativec C �N t d�}t|t �szt |�}W n ty t Y S w t�|j| j|j� |S ru )r+ r0 r; �NotImplementedr3 r7 r. �r rn ri r r r �__add__l � ��zIntegerGMP.__add__c C r� ru )r+ r0 r; r� r3 �mpz_subr. r� r r r �__sub__x r� zIntegerGMP.__sub__c C r� ru )r+ r0 r; r� r3 �mpz_mulr. r� r r r �__mul__� r� zIntegerGMP.__mul__c C sN t |t�s t|�}t�|j| j�dkrtd��td�}t�|j| j|j� |S )Nr �Division by zero)r0 r+ r3 rA r. rB �ZeroDivisionErrorZ mpz_fdiv_q)r �divisorri r r r � __floordiv__� s ���zIntegerGMP.__floordiv__c C sb t |t�s t|�}t�|j| j�}|dkrtd��|dk r!td��td�}t�|j| j|j� |S �Nr r� �Modulus must be positive� r0 r+ r3 rA r. rB r� r2 Zmpz_mod)r r� �compri r r r �__mod__� s ��zIntegerGMP.__mod__Nc C s� |d u r#|dk r t d��|dkrt d��t�| j| jtt|��� | S t|t�s,t|�}|s2td��|� � r:t d��t |�r^|dk rFt d��|dk rYt� | j| jt|�|j� | S t|�}n|� � rft d��t� | j| j|j|j� | S )Nr z Exponent must not be negative� zExponent is too bigr� r� � ) r2 r3 Z mpz_pow_uir. r rD r0 r+ r� r r Z mpz_powm_uiZmpz_powm)r �exponent�modulusr r r � inplace_pow� sF � �� �zIntegerGMP.inplace_powc C s t | �}|�||�S r$ )r+ r� )r r� r� ri r r r �__pow__� s zIntegerGMP.__pow__c C s t d�}t�|j| j� |S ru )r+ r3 Zmpz_absr. )r ri r r r �__abs__� s zIntegerGMP.__abs__c C sh |du r| dk r t d��td�}t�|j| j� |S |dkr"t d��t|�}t| �t| �| |��}|S )zGReturn the largest Integer that does not exceed the square rootNr z Square root of negative valuer� )r2 r+ r3 Zmpz_sqrtr. rD Z_tonelli_shanks�r r� ri r r r �sqrt� s ��zIntegerGMP.sqrtc C � t |�r;d| krdk r n n t�| j| jt|�� | S d| k r'dk r7n nt�| j| jt| �� | S t|�}t�| j| j|j� | S �Nr r� � ��)r r3 � mpz_add_uir. r � mpz_sub_uir+ r7 rq r r r �__iadd__� �& ���zIntegerGMP.__iadd__c C r� r� )r r3 r� r. r r� r+ r� rq r r r �__isub__� r� zIntegerGMP.__isub__c C s� t |�rCd| krdk r n n t�| j| jt|�� | S d| k r'dk r?n nt�| j| jt| �� t�| j| j� | S t|�}t�| j| j|j� | S r� )r r3 Z mpz_mul_uir. r r9 r+ r� rq r r r �__imul__ s( ���zIntegerGMP.__imul__c C sZ t |t�s t|�}t�|j|j�}|dkrtd��|dk r!td��t�| j| j|j� | S r� r� )r r� r� r r r �__imod__$ s ��zIntegerGMP.__imod__c C �2 t d�}t|t �s t |�}t�|j| j|j� |S ru )r+ r0 r3 Zmpz_andr. r� r r r �__and__3 � �zIntegerGMP.__and__c C r� ru )r+ r0 r3 Zmpz_iorr. r� r r r �__or__< r� zIntegerGMP.__or__c C sN t d�}|dk r td��|dkr| dk rdS dS t�|j| jtt|��� |S �Nr znegative shift countr� r^ )r+ r2 r3 rC r. r rD �r �posri r r r � __rshift__E s �zIntegerGMP.__rshift__c C sF |dk rt d��|dkr| dk rdS dS t�| j| jtt|��� | S r� )r2 r3 rC r. r rD �r r� r r r � __irshift__S s �zIntegerGMP.__irshift__c C sJ t d�}d| krdk std�� td��t�|j| jtt|��� |S �Nr r� zIncorrect shift count)r+ r2 r3 r6 r. r rD r� r r r � __lshift__` s � �zIntegerGMP.__lshift__c C sB d| kr dk st d�� t d��t�| j| jtt|��� | S r� )r2 r3 r6 r. r rD r� r r r � __ilshift__i s � �zIntegerGMP.__ilshift__c C sF | dk rt d��|dk rt d��|dkrdS 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 countr� )r2 �boolr3 � mpz_tstbitr. r rD )r �nr r r �get_bitq s �zIntegerGMP.get_bitc C s t �| jd�dkS )Nr r �r3 r� r. rH r r r �is_odd rx zIntegerGMP.is_oddc C s t �| jd�dkS ru r� rH r r r �is_even� rx zIntegerGMP.is_evenc C s | dk rt d��t�| jd�S )z=Return the minimum number of bits that can encode the number.r rP � )r2 r3 Zmpz_sizeinbaser. rH 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 r) )r� rH r r r � size_in_bytes� s zIntegerGMP.size_in_bytesc C s t �| j�dkS ru )r3 Zmpz_perfect_square_pr. rH r r r �is_perfect_square� s z IntegerGMP.is_perfect_squarec C sb t |�r#d| k rdk r n nt�| jt|��r td��dS t|�}t�| j|j�r/td��dS )z3Raise an exception if the small prime is a divisor.r r� zThe value is compositeN)r r3 Zmpz_divisible_ui_pr. r r2 r+ Zmpz_divisible_p)r Z small_primer r r �fail_if_divisible_by� s ���z IntegerGMP.fail_if_divisible_byc C s� t |t�s t|�}t|�rDd| k rdk r&n n t�| j|jt|�� | S d| k r0dk r@n nt�| j|jt| �� | S t|�}t�| j|j|j� | S )z/Increment the number by the product of a and b.r r� r� ) r0 r+ r r3 Z mpz_addmul_uir. r Z mpz_submul_uiZ mpz_addmul)r �a�br r r �multiply_accumulate� s* ���z IntegerGMP.multiply_accumulatec C s& t |t�s t|�}t�| j|j� | S )z'Set the Integer to have the given value)r0 r+ r3 Zmpz_setr. )r �sourcer r r �set� s �zIntegerGMP.setc C sf t |t�s t|�}t�|j| j�}|dkrtd��|dk r!td��t�| j| j|j�}|s1td��| S )z�Compute the inverse of this number in the ring of modulo integers. Raise an exception if no inverse exists. r �Modulus cannot be zeror� z No inverse value can be computed) r0 r+ r3 rA r. rB r� r2 Z mpz_invert)r r� r� ri r r r �inplace_inverse� s ��zIntegerGMP.inplace_inversec C s t | �}|�|� |S r$ )r+ r� r� r r r �inverse� s zIntegerGMP.inversec C sb t d�}t|�r%d| k rdk r!n n t�|j| jt|�� |S t |�}t�|j| j|j� |S )zUCompute the greatest common denominator between this number and another term.r i�� )r+ r r3 Z mpz_gcd_uir. r Zmpz_gcdr� r r r �gcd� s �zIntegerGMP.gcdc C r� )zQCompute the least common multiplier between this number and another term.r )r+ r0 r3 Zmpz_lcmr. r� r r r �lcm� s zIntegerGMP.lcmc C sL t | t�s t| �} t |t�st|�}|dks|�� r td��t�| j|j�S )zCompute the Jacobi symbolr z,n must be positive odd for the Jacobi symbol)r0 r+ r� r2 r3 Z mpz_jacobir. )r� r� r r r � jacobi_symbol� s zIntegerGMP.jacobi_symbolc C s� t | t�s t| �} t |t�st|�}t |t�st|�}|dk r#td��|dkr+td��|d@ dkr5td��| | | }|�|�� �S )Nr r� r� r zOdd modulus is required)r0 r+ r2 r� rj r� )Zterm1Zterm2r� �productr r r �_mult_modulo_bytes s z IntegerGMP._mult_modulo_bytesc C s> z| j d ur| jrt�| j � d | _ W d S ty Y d S w r$ )r. r/ r3 r8 r rH r r r �__del__ s �zIntegerGMP.__del__)r rO )rO r$ )?r r r �__doc__r% rB r3 Zmpz_init_set_uir r@ rE rI rK rM rN rj � staticmethodrm ro rr rt rw ry rz r{ r} �__bool__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� r� r� r� r� r� r� r r r r r+ � sx * < ' r+ )"�sysrc ZCryptodome.Util.py3compatr ZCryptodome.Util._raw_apir r r r r Z _IntegerBaser Zgmp_defs�platform� ImportErrorr �implementation�hasattr�objectr r3 r r r r r! r" r% rV �restyper' �calcsizer` r+ r r r r �<module> s. :
| ver. 1.4 |
Github
|
.
| PHP 8.2.30 | Generation time: 0 |
proxy
|
phpinfo
|
Settings