403Webshell
Server IP : 217.160.0.135  /  Your IP : 216.73.217.85
Web Server : Apache
System : Linux www 6.18.52-i1-ampere #1203 SMP Mon Sep 14 18:29:59 CEST 2026 aarch64
User : sws1074145052 ( 1074145052)
PHP Version : 8.3.32
Disable Function : NONE
MySQL : OFF  |  cURL : ON  |  WGET : ON  |  Perl : ON  |  Python : OFF  |  Sudo : OFF  |  Pkexec : OFF
Directory :  /lib/python3/dist-packages/Cryptodome/Math/__pycache__/

Upload File :
current_dir [ Writeable ] document_root [ Writeable ]

 

Command :


[ Back ]     

Current File : /lib/python3/dist-packages/Cryptodome/Math/__pycache__/_IntegerBase.cpython-311.pyc
�

8�tc�(��N�ddlZddlmZmZmZmZddlmZGd�de��ZdS)�N)�
iter_range�bord�bchr�ABC)�Randomc�<�eZdZejd���Zejd���Zejd���Zejd4d���Ze	ejd�����Z
ejd���Zejd���Zejd	���Z
ejd
���Zejd���Zejd���Zejd
���ZeZejd���Zejd���Zejd���Zejd���Zejd���Zejd���Zejd5d���Zejd5d���Zejd���Zejd5d���Zejd���Zejd���Zejd���Zejd���Z ejd���Z!ejd���Z"ejd���Z#ejd ���Z$ejd!���Z%ejd"���Z&ejd#���Z'ejd$���Z(ejd%���Z)ejd&���Z*ejd'���Z+ejd(���Z,ejd)���Z-ejd*���Z.ejd+���Z/ejd,���Z0ejd-���Z1ejd.���Z2ejd/���Z3e	ejd0�����Z4e	d1���Z5e6d2���Z7e6d3���Z8dS)6�IntegerBasec��dS�N���selfs �>/usr/lib/python3/dist-packages/Cryptodome/Math/_IntegerBase.py�__int__zIntegerBase.__int__)�����c��dSrrr
s r�__str__zIntegerBase.__str__-rrc��dSrrr
s r�__repr__zIntegerBase.__repr__1rrrc��dSrr)r�
block_sizes  r�to_byteszIntegerBase.to_bytes5rrc��dSrr)�byte_strings r�
from_byteszIntegerBase.from_bytes9�	��	
�rc��dSrr�r�terms  r�__eq__zIntegerBase.__eq__?rrc��dSrrrs  r�__ne__zIntegerBase.__ne__Crrc��dSrrrs  r�__lt__zIntegerBase.__lt__Grrc��dSrrrs  r�__le__zIntegerBase.__le__Krrc��dSrrrs  r�__gt__zIntegerBase.__gt__Orrc��dSrrrs  r�__ge__zIntegerBase.__ge__Srrc��dSrrr
s r�__nonzero__zIntegerBase.__nonzero__Wrrc��dSrrr
s r�is_negativezIntegerBase.is_negative\rrc��dSrrrs  r�__add__zIntegerBase.__add__arrc��dSrrrs  r�__sub__zIntegerBase.__sub__errc��dSrr)r�factors  r�__mul__zIntegerBase.__mul__irrc��dSrr�r�divisors  r�__floordiv__zIntegerBase.__floordiv__mrrc��dSrrr8s  r�__mod__zIntegerBase.__mod__qrrNc��dSrr�r�exponent�moduluss   r�inplace_powzIntegerBase.inplace_powurrc��dSrrr>s   r�__pow__zIntegerBase.__pow__yrrc��dSrrr
s r�__abs__zIntegerBase.__abs__}rrc��dSrr�rr@s  r�sqrtzIntegerBase.sqrt�rrc��dSrrrs  r�__iadd__zIntegerBase.__iadd__�rrc��dSrrrs  r�__isub__zIntegerBase.__isub__�rrc��dSrrrs  r�__imul__zIntegerBase.__imul__�rrc��dSrrrs  r�__imod__zIntegerBase.__imod__�rrc��dSrrrs  r�__and__zIntegerBase.__and__�rrc��dSrrrs  r�__or__zIntegerBase.__or__�rrc��dSrr�r�poss  r�
__rshift__zIntegerBase.__rshift__�rrc��dSrrrVs  r�__irshift__zIntegerBase.__irshift__�rrc��dSrrrVs  r�
__lshift__zIntegerBase.__lshift__�rrc��dSrrrVs  r�__ilshift__zIntegerBase.__ilshift__�rrc��dSrr)r�ns  r�get_bitzIntegerBase.get_bit�rrc��dSrrr
s r�is_oddzIntegerBase.is_odd�rrc��dSrrr
s r�is_evenzIntegerBase.is_even�rrc��dSrrr
s r�size_in_bitszIntegerBase.size_in_bits�rrc��dSrrr
s r�
size_in_byteszIntegerBase.size_in_bytes�rrc��dSrrr
s r�is_perfect_squarezIntegerBase.is_perfect_square�rrc��dSrr)r�small_primes  r�fail_if_divisible_byz IntegerBase.fail_if_divisible_by�rrc��dSrr)r�a�bs   r�multiply_accumulatezIntegerBase.multiply_accumulate�rrc��dSrr)r�sources  r�setzIntegerBase.set�rrc��dSrrrGs  r�inplace_inversezIntegerBase.inplace_inverse�rrc��dSrrrGs  r�inversezIntegerBase.inverse�rrc��dSrrrs  r�gcdzIntegerBase.gcd�rrc��dSrrrs  r�lcmzIntegerBase.lcm�rrc��dSrr)rpr`s  r�
jacobi_symbolzIntegerBase.jacobi_symbol�rrc�P�|dvr|S|dzdkr=t||dzdz|��}t|d|��|krtd���|Sd}|dz
dz}|dzs|dz
}|dz}|dz�|�d��}	t||dz
dz|��}|dkr|dz
}�$||dz
krntd���|}t|||��}t|||��}	t||dzdz|��}
|	dkr�td|��D]}t|	d|z|��dkrn�||krtd	||fz���t|d||z
dz
z|��}|}|dz|z}|	|dzz|z}	|
|z|z}
|	dk��t|
d|��|krtd���|
S)
a�Tonelli-shanks algorithm for computing the square root
        of n modulo a prime p.

        n must be in the range [0..p-1].
        p must be at least even.

        The return value r is the square root of modulo p. If non-zero,
        another solution will also exist (p-r).

        Note we cannot assume that p is really a prime: if it's not,
        we can either raise an exception or return the correct value.
        )r���r��zCannot compute square rootTrz'Cannot compute square root of %d mod %d)�pow�
ValueError�	__class__r)
r`�p�root�s�q�z�euler�m�c�t�r�irqs
             r�_tonelli_shankszIntegerBase._tonelli_shanks�s(��"
��;�;��H��q�5�A�:�:��q�1�q�5�Q�,��*�*�D��4��A���!�#�#� �!=�>�>�>��K�
��
��U�q�L���q�5�	�
��F�A�
�!�G�A��q�5�	�
�K�K��N�N��	;���A��E�a�<��+�+�E���z�z��Q������A��~�~���9�:�:�:�
����1�a�L�L����1�a�L�L����A��E�a�<��#�#���1�f�f���1�%�%�
�
���q�!�Q�$��?�?�a�'�'��E�(��A�v�v� �!J�a�QR�V�!S�T�T�T��A�q�1�q�5�1�9�~�q�)�)�A��A��1��q��A��Q��T��Q��A��Q��!��A��1�f�f��q�!�Q�<�<�1����9�:�:�:��rc��|�dd��}|�dd��}|�dd��}|�tj��j}|�|�t	d���|�|�t	d���|p|}|dz
dzdz}d|dz|z
z
}t|d��d	��}|�|d|dz
zz}|d|zdz
z}|�t|��||dz
��z��S)
a!Generate a random natural integer of a certain size.

        :Keywords:
          exact_bits : positive integer
            The length in bits of the resulting random Integer number.
            The number is guaranteed to fulfil the relation:

                2^bits > result >= 2^(bits - 1)

          max_bits : positive integer
            The maximum length in bits of the resulting random Integer number.
            The number is guaranteed to fulfil the relation:

                2^bits > result >=0

          randfunc : callable
            A function that returns a random byte string. The length of the
            byte string is passed as parameter. Optional.
            If not provided (or ``None``), randomness is read from the system RNG.

        :Return: a Integer object
        �
exact_bitsN�max_bits�randfuncz3Either 'exact_bits' or 'max_bits' must be specifiedz2'exact_bits' and 'max_bits' are mutually exclusiver��r)�popr�new�readr�rrr)	�cls�kwargsr�r�r��bits�bytes_needed�significant_bits_msb�msbs	         r�randomzIntegerBase.random)s+��2�Z�Z��d�3�3�
��:�:�j�$�/�/���:�:�j�$�/�/�����z�|�|�(�H���(�"2��R�S�S�S��!�h�&:��Q�R�R�R��%�X�����a��1�,�� �L�1�$4�t�$;�<���8�8�A�;�;�q�>�"�"���!��1�-��1�2�2�C���)�)�Q�.�.���~�~�d�3�i�i�(�(�<�!�3C�*D�*D�D�E�E�Erc�R�|�dd��}|�dd��}|�dd��}|�dd��}|r$tdt|j��z���d||fvrtd���|�|dz
}d||fvrtd	���|�t	j��j}||z
}||�����}d
}d|cxkr|ks)n|�||���}d|cxkr|k�$n�'||zS)
a�Generate a random integer within a given internal.

        :Keywords:
          min_inclusive : integer
            The lower end of the interval (inclusive).
          max_inclusive : integer
            The higher end of the interval (inclusive).
          max_exclusive : integer
            The higher end of the interval (exclusive).
          randfunc : callable
            A function that returns a random byte string. The length of the
            byte string is passed as parameter. Optional.
            If not provided (or ``None``), randomness is read from the system RNG.
        :Returns:
            An Integer randomly taken in the given interval.
        �
min_inclusiveN�
max_inclusive�
max_exclusiver�zUnknown keywords: z8max_inclusive and max_exclusive cannot be both specifiedr�z(Missing keyword to identify the interval���r)r�r�)	r�r��str�keysrr�r�rgr�)	r�r�r�r�r�r��norm_maximum�bits_needed�norm_candidates	         r�random_rangezIntegerBase.random_rangeYsy��&�
�
�?�D�9�9�
��
�
�?�D�9�9�
��
�
�?�D�9�9�
��:�:�j�$�/�/���	F��1�C���4D�4D�D�E�E�E��
�}�5�5�5��&�'�'�
'��$�)�A�-�M��M�=�1�1�1��G�H�H�H����z�|�|�(�H�$�}�4���c�,�'�'�4�4�6�6�����~�5�5�5�5��5�5�5�5� �Z�Z�-8�-5�(�&�&�N��~�5�5�5�5��5�5�5�5�5�
�
�-�-r)rr)9�__name__�
__module__�__qualname__�abc�abstractmethodrrrr�staticmethodrr!r#r%r'r)r+r-�__bool__r/r1r3r6r:r<rArCrErHrJrLrNrPrRrTrXrZr\r^rarcrergrirkrnrrrurwryr{r}rr��classmethodr�r�rrrr	r	&s'������	��
�
���
�	��
�
���
�	��
�
���
�	��
�
�
���
����
�
����\�
�	��
�
���
�	��
�
���
�	��
�
���
�	��
�
���
�	��
�
���
�	��
�
���
�	��
�
���
��H���
�
���
�	��
�
���
�	��
�
���
�	��
�
���
�	��
�
���
�	��
�
���
�	��
�
�
���
�	��
�
�
���
�	��
�
���
�	��
�
�
���
�	��
�
���
�	��
�
���
�	��
�
���
�	��
�
���
�	��
�
���
�	��
�
���
�	��
�
���
�	��
�
���
�	��
�
���
�	��
�
���
�	��
�
���
�	��
�
���
�	��
�
���
�	��
�
���
�	��
�
���
�	��
�
���
�	��
�
���
�	��
�
���
�	��
�
���
�	��
�
���
�	��
�
���
�	��
�
���
�	��
�
���
����
�
����\�
��>�>��\�>�@�-F�-F��[�-F�^�-.�-.��[�-.�-.�-.rr	)	r��Cryptodome.Util.py3compatrrrr�
Cryptodomerr	rrr�<module>r�s���>�
�
�
�A�A�A�A�A�A�A�A�A�A�A�A�������a.�a.�a.�a.�a.�#�a.�a.�a.�a.�a.r

Youez - 2016 - github.com/yon3zu
LinuXploit