~ d dl Z d dlmZmZ d dlmZmZmZmZm Z m
Z
m Z m Z m
Z
ddlmZ dZe j dk r ed ed e Zd ed
Z eed r ed ed
dk r d dlmZmZmZmZ G d de Zd Z n d dlm Z d Z G d de Z e Z G d de Z!dS ) N)tobytes
is_native_int) backendload_libget_raw_buffer get_c_string null_pointercreate_string_bufferc_ulongc_size_t c_uint8_ptr ) IntegerBaseaY 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);
win32zNot using GMP on Windowsgmp)libraryapi__mpir_versionzMPIR library detectedr ctypes) Structurec_intc_void_pbyrefc $ e Zd ZdefdefdefgZdS )_MPZ _mp_alloc_mp_size_mp_dN)__name__
__module__ __qualname__r r _fields_ y/builddir/build/BUILD/imunify360-venv-2.6.2/opt/imunify360/venv/lib64/python3.11/site-packages/Crypto/Math/_IntegerGMP.pyr r p s- %( ' h')r$ r c 8 t t S N)r r r# r$ r% new_mpzr( u s TVV}} r$ )ffic * t j d S )NzMPZ*)r) newr# r$ r% r( r( | s wv r$ c e Zd Zd ZdS )_GMPc | d rd|dd z }n5| d rd|dd z }nt d|z t t | }t | || |S )Nmpz___gmpz_ gmp___gmp_zAttribute %s is invalid)
startswithAttributeErrorgetattrlibsetattr)selfname func_namefuncs r% __getattr__z_GMP.__getattr__ s ??6 " " C!DH,II
__V
$
$ C 48+II !:T!ABB BsI&&dD!!! r$ N)r r r! r= r# r$ r% r- r- s# r$ r- c e Zd ZdZ e Ze e ed d Z d Z
d Z d Z d Z
d Zd8d
Zed9d Zd Zd
Zd Zd Zd Zd Zd Zd ZeZd Zd Z d Z d Z d Z d Z d:dZ!d:d Z"d Z#d:d Z$d Z%d Z&d! Z'd" Z(d# Z)d$ Z*d% Z+d& Z,d' Z-d( Z.d) Z/d* Z0d+ Z1d, Z2d- Z3d. Z4d/ Z5d0 Z6d1 Z7d2 Z8d3 Z9d4 Z:d5 Z;ed6 Z>r$ c t |t st | sdS | t j | dk S )NTr r r s r% __ne__zIntegerGMP.__ne__A sE 4,,
d0C0C 4%%dlD99Q>>r$ c J | t j | dk S Nr r rH rZ r s r% __lt__zIntegerGMP.__lt__F %%dlD99A==r$ c J | t j | dk S r r r s r% __le__zIntegerGMP.__le__I %%dlD99Q>>r$ c J | t j | dk S r r r s r% __gt__zIntegerGMP.__gt__L r r$ c J | t j | dk S r r r s r% __ge__zIntegerGMP.__ge__O r r$ c T t | j | j dk S r rH rZ rC r[ rd s r% __nonzero__zIntegerGMP.__nonzero__R s ||DK)9::a??r$ c T t | j | j dk S r r rd s r% is_negativezIntegerGMP.is_negativeV s ||DK)9::Q>>r$ c t d }t |t s( t | }n# t $ r
t cY S w xY wt |j | j |j |S r )r? rE rR NotImplementedrH rN rC r9 r r s r% __add__zIntegerGMP.__add__Z A $
++ &
&!$''&
&
&
&%%%%
& V][[ " " "
6 A
A
c t d }t |t s( t | }n# t $ r
t cY S w xY wt |j | j |j |S r )r? rE rR r rH mpz_subrC r s r% __sub__zIntegerGMP.__sub__f r r c t d }t |t s( t | }n# t $ r
t cY S w xY wt |j | j |j |S r )r? rE rR r rH mpz_mulrC r s r% __mul__zIntegerGMP.__mul__r r r c 2 t |t st | }t |j | j dk rt
d t d }t |j | j |j |S )Nr Division by zero)rE r? rH rZ rC r[ ZeroDivisionError
mpz_fdiv_q)r9 divisorr s r% __floordiv__zIntegerGMP.__floordiv__~ s ':.. * ))G << ( * *-. / /#$677 7A
( ( (
r$ c ` t |t st | }t |j | j }|dk rt
d |dk rt d t d }t |j | j |j |S Nr r Modulus must be positive rE r? rH rZ rC r[ r rG mpz_mod)r9 r compr s r% __mod__zIntegerGMP.__mod__ s ':.. * ))G||GN ,. . 199#$677 7 !88 788 8A V][ ^ % % %
r$ Nc $ |l|dk rt d |dk rt d t | j | j t t | n!t
|t st | }|st d | rt d t | rf|dk rt d |dk r;t | j | j t | |j | S t | }n#| rt d t | j | j |j |j | S )Nr z Exponent must not be negative zExponent is too bigr r )
rG rH
mpz_pow_uirC r r^ rE r? r r r mpz_powm_uimpz_powm)r9 exponentmoduluss r% inplace_powzIntegerGMP.inplace_pow s ?!|| !@AAA #~~ !6777 OODK K #CMM 2 2
gz22
.$W--
<'(:;;;""$$
= !;<<< X&&
Ba<<$%DEEEe##$$T[%)[%,X%6%6%,^5 5 5 K%h//%%''
B !@AAA MM$+ +"/!.
*
*
* r$ c L t | }| || S r' )r? r )r9 r r r s r% __pow__zIntegerGMP.__pow__ s% D!!!!(G444r$ c n t d }t |j | j |S r )r? rH mpz_absrC )r9 r s r% __abs__zIntegerGMP.__abs__ s* A V]DK000
r$ c L |J| dk rt d t d }t |j | j nW|dk rt d t | }t | t | |z | }|S )zGReturn the largest Integer that does not
exceed the square rootNr z Square root of negative valuer )rG r? rH mpz_sqrtrC r^ _tonelli_shanksr9 r r s r% sqrtzIntegerGMP.sqrt s ?axx !@AAA ]]F MM&- +
'
'
'
' !|| !;<<<'llG 4 4SYY5H' R RSSF
r$ c t | rd|cxk rdk r8n n5t | j | j t | | S d|cxk rdk r9n n6t | j | j t | | S t
| }t | j | j |j | S Nr r )r rH
mpz_add_uirC r
mpz_sub_uir? rN r s r% __iadd__zIntegerGMP.__iadd__ $D 5 $ '
/ / / q $ '0 0 0 d##D T[[[ " " " r$ c t | rd|cxk rdk r8n n5t | j | j t | | S d|cxk rdk r9n n6t | j | j t | | S t
| }t | j | j |j | S r )r rH r rC r r r? r r s r% __isub__zIntegerGMP.__isub__ r r$ c t | rd|cxk rdk r8n n5t | j | j t | | S d|cxk rdk r^n n[t | j | j t | t | j | j | S t
| }t | j | j |j | S r )r rH
mpz_mul_uirC r rP r? r r s r% __imul__zIntegerGMP.__imul__ s $D 5 $ '
/ / / q $ '0 0 0 T[$+666 d##D T[[[ " " " r$ c B t |t st | }t |j |j }|dk rt
d |dk rt d t | j | j |j | S r r )r9 r r s r% __imod__zIntegerGMP.__imod__ s ':.. * ))G||GN # /1 1 199#$677 7 !88 788 8 T[[ ^ % % % r$ c t d }t |t st | }t |j | j |j |S r )r? rE rH mpz_andrC r s r% __and__zIntegerGMP.__and__! W A $
++ $ d##D V][[ " " "
r$ c t d }t |t st | }t |j | j |j |S r )r? rE rH mpz_iorrC r s r% __or__zIntegerGMP.__or__* r r$ c t d }|dk rt d |dk r
| dk rdS dS t |j | j t t
| |S Nr znegative shift countr )r? rG rH r] rC r r^ r9 posr s r%
__rshift__zIntegerGMP.__rshift__3 sz A 77 344 4 ;;axxrq V] ![ $SXX . . 0 0 0
r$ c |dk rt d |dk r
| dk rdS dS t | j | j t t | | S r )rG rH r] rC r r^ r9 r s r% __irshift__zIntegerGMP.__irshift__A so 77 344 4 ;;axxrq T[ ![ $SXX . . 0 0 0 r$ c t d }d|cxk rdk sn t d t |j | j t t
| |S Nr r zIncorrect shift count)r? rG rH rM rC r r^ r s r%
__lshift__zIntegerGMP.__lshift__N st A C % 455 5 &- +!#c((++ - - -
r$ c d|cxk rdk sn t d t | j | j t t | | S r )rG rH rM rC r r^ r s r% __ilshift__zIntegerGMP.__ilshift__W si C % 455 5 $+ +!#c((++ - - - r$ c
| dk rt d |dk rt d |dk rdS t t | j t t
| 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 )rG boolrH
mpz_tstbitrC r r^ )r9 ns r% get_bitzIntegerGMP.get_bit_ sw !88 HII I q55 122 2 u991DOODK$+CFFOO5 5 6 6 6r$ c J t | j d dk S )Nr r rH r rC rd s r% is_oddzIntegerGMP.is_oddm t{A..!33r$ c J t | j d dk S r r rd s r% is_evenzIntegerGMP.is_evenp r r$ c l | dk rt d t | j d S )z=Return the minimum number of bits that can encode the number.r rp rq )rG rH rw rC rd s r% size_in_bitszIntegerGMP.size_in_bitss s4 !88 MNN N""4;222r$ c < | dz
dz dz S )z>Return the minimum number of bytes that can encode the number.r rs )r rd s r%
size_in_byteszIntegerGMP.size_in_bytesz s# !!##a'A-11r$ c H t | j dk S r )rH mpz_perfect_square_prC rd s r% is_perfect_squarez IntegerGMP.is_perfect_square~ s ((55::r$ c F t | r]d|cxk rdk rAn n>t | j t | rt d dS t
| }t | j |j rt d dS )z3Raise an exception if the small prime is a divisor.r r zThe value is compositeN)r rH mpz_divisible_ui_prC r rG r? mpz_divisible_p)r9 small_primes r% fail_if_divisible_byz IntegerGMP.fail_if_divisible_by s % % 2;&&&&&&&&&**4;+2;+?+?A A ?$%=>>>$[11K + 2 4 4 7 566 6 7 7r$ c t |t st | }t | rd|cxk rdk r8n n5t | j |j t
| | S d|cxk rdk r9n n6t | j |j t
| | S t | }t | j |j |j | S )z/Increment the number by the product of a and b.r r r ) rE r? r rH
mpz_addmul_uirC r
mpz_submul_ui
mpz_addmul)r9 abs r% multiply_accumulatez IntegerGMP.multiply_accumulate s !Z(( 1
A 1}}}}u}}}}}""4;#$8#*1::/ / / ~~~~A~~~~~""4;#$8#*A2;;0 0 0 1
A " " " r$ c t |t st | }t | j |j | S )z'Set the Integer to have the given value)rE r? rH mpz_setrC )r9 sources r% setzIntegerGMP.set sG &*-- ( ''F T[] $ $ $ r$ c d t |t st | }t |j | j }|dk rt
d |dk rt d t | j | j |j }|st d | S )zCompute the inverse of this number in the ring of
modulo integers.
Raise an exception if no inverse exists.
r zModulus cannot be zeror z No inverse value can be computed) rE r? rH rZ rC r[ r rG
mpz_invert)r9 r r r s r% inplace_inversezIntegerGMP.inplace_inverse s ':.. * ))G||GN ,. . 199#$<== = !88 788 8 !%!( 1 1 A ?@@ @ r$ c N t | }| | |S r' )r? r r s r% inversezIntegerGMP.inverse s( D!! w'''
r$ c @ t d }t | rTd|cxk rdk r8n n5t |j | j t | |S t | }t |j | j |j |S )zUCompute the greatest common denominator between this
number and another term.r i )r? r rH
mpz_gcd_uirC r mpz_gcdr s r% gcdzIntegerGMP.gcd s A $4 %
$ '
/ / /
d##D V]DK===
r$ c t d }t |t st | }t |j | j |j |S )zQCompute the least common multiplier between this
number and another term.r )r? rE rH mpz_lcmrC r s r% lcmzIntegerGMP.lcm sO A $
++ $ d##D V]DK===
r$ c . t | t st | } t |t st | }|dk s| rt d t | j |j S )zCompute the Jacobi symbolr z,n must be positive odd for the Jacobi symbol)rE r? r rG rH
mpz_jacobirC )r r s r%
jacobi_symbolzIntegerGMP.jacobi_symbol sz !Z(( 1
A!Z(( 1
A 66QYY[[6 KLL Lqx222r$ c | j &| j r t | j d | _ d S # t $ r Y d S w xY wr' )rC rD rH rO r5 rd s r% __del__zIntegerGMP.__del__ s[ {&$ 0NN4;/// DKKK DD s 48
AA)r rn )rn r' )>r r r! __doc__r( r[ rH mpz_init_set_uir rX ra re rh rk rm r staticmethodr r r r r r r 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? s} --'))Kggajj111'& '& '&V & ) ) ) 0 0 0 0d \ @. . .
? ? ?
? ? ?
> > >? ? ?> > >? ? ?@ @ @H? ? ?
% % % %N5 5 5 5
$ $ $ & 6 6 6 4 4 44 4 43 3 32 2 2; ; ; 7 7 7 , 0
3 3 \ 3 r$ r? )"sysCrypto.Util.py3compatr r Crypto.Util._raw_apir r r r r r
r r r
_IntegerBaser gmp_defsplatform ImportErrorr7 implementationhasattrr r r r r r r( r) objectr- rH r? r# r$ r% r2 s8 >
8 8 8 8 8 8 8 8B B B B B B B B B B B B B B B B B B B B B B
& % % % % %5 n <7
+0
1
11huh "733
73 !! /
+-
.
..
%H$$888888888888) ) ) ) )y ) ) )
)(((((
6 tvvh h h h h h h h h h r$