File manager - Edit - /opt/saltstack/salt/lib/python3.10/site-packages/Cryptodome/Math/__pycache__/_IntegerBase.cpython-310.pyc
Back
o ;j , � @ s@ d dl Z d dlmZmZmZmZ d dlmZ G dd� de�ZdS )� N)� iter_range�bord�bchr�ABC)�Randomc @ s� e Zd Zejdd� �Zejdd� �Zejdd� �Zejdhd d ��Ze ejdid d ���Z ejd d� �Z ejdd� �Z ejdd� �Z ejdd� �Zejdd� �Zejdd� �Zejdd� �ZeZejdd � �Zejd d � �Zejd d � �Zejd!d"� �Zejd#d$� �Zejd%d&� �Zejdjd(d)��Zejdjd*d+��Zejd,d-� �Zejdjd.d/��Z ejd0d1� �Z ejd2d3� �Z ejd4d5� �Z ejd6d7� �Z ejd8d9� �Z!ejd:d;� �Z"ejd<d=� �Z#ejd>d?� �Z$ejd@dA� �Z%ejdBdC� �Z&ejdDdE� �Z'ejdFdG� �Z(ejdHdI� �Z)ejdJdK� �Z*ejdLdM� �Z+ejdNdO� �Z,ejdPdQ� �Z-ejdRdS� �Z.ejdTdU� �Z/ejdVdW� �Z0ejdXdY� �Z1ejdZd[� �Z2ejd\d]� �Z3e ejd^d_� ��Z4e d`da� �Z5e6dbdc� �Z7e6ddde� �Z8e ejdfdg� ��Z9d'S )k� IntegerBasec C � d S �N� ��selfr r �P/opt/saltstack/salt/lib/python3.10/site-packages/Cryptodome/Math/_IntegerBase.py�__int__) � zIntegerBase.__int__c C r r r r r r r �__str__- r zIntegerBase.__str__c C r r r r r r r �__repr__1 r zIntegerBase.__repr__r �bigc C r r r )r � block_size� byteorderr r r �to_bytes5 r zIntegerBase.to_bytesc C r r r )Z byte_stringr r r r � from_bytes9 � zIntegerBase.from_bytesc C r r r �r Ztermr r r �__eq__? r zIntegerBase.__eq__c C r r r r r r r �__ne__C r zIntegerBase.__ne__c C r r r r r r r �__lt__G r zIntegerBase.__lt__c C r r r r r r r �__le__K r zIntegerBase.__le__c C r r r r r r r �__gt__O r zIntegerBase.__gt__c C r r r r r r r �__ge__S r zIntegerBase.__ge__c C r r r r r r r � __nonzero__W r zIntegerBase.__nonzero__c C r r r r r r r � is_negative\ r zIntegerBase.is_negativec C r r r r r r r �__add__a r zIntegerBase.__add__c C r r r r r r r �__sub__e r zIntegerBase.__sub__c C r r r )r Zfactorr r r �__mul__i r zIntegerBase.__mul__c C r r r �r Zdivisorr r r � __floordiv__m r zIntegerBase.__floordiv__c C r r r r$ r r r �__mod__q r zIntegerBase.__mod__Nc C r r r �r Zexponent�modulusr r r � inplace_powu r zIntegerBase.inplace_powc C r r r r' r r r �__pow__y r zIntegerBase.__pow__c C r r r r r r r �__abs__} r zIntegerBase.__abs__c C r r r �r r( r r r �sqrt� r zIntegerBase.sqrtc C r r r r r r r �__iadd__� r zIntegerBase.__iadd__c C r r r r r r r �__isub__� r zIntegerBase.__isub__c C r r r r r r r �__imul__� r zIntegerBase.__imul__c C r r r r r r r �__imod__� r zIntegerBase.__imod__c C r r r r r r r �__and__� r zIntegerBase.__and__c C r r r r r r r �__or__� r zIntegerBase.__or__c C r r r �r �posr r r � __rshift__� r zIntegerBase.__rshift__c C r r r r4 r r r � __irshift__� r zIntegerBase.__irshift__c C r r r r4 r r r � __lshift__� r zIntegerBase.__lshift__c C r r r r4 r r r � __ilshift__� r zIntegerBase.__ilshift__c C r r r )r �nr r r �get_bit� r zIntegerBase.get_bitc C r r r r r r r �is_odd� r zIntegerBase.is_oddc C r r r r r r r �is_even� r zIntegerBase.is_evenc C r r r r r r r � size_in_bits� r zIntegerBase.size_in_bitsc C r r r r r r r � size_in_bytes� r zIntegerBase.size_in_bytesc C r r r r r r r �is_perfect_square� r z IntegerBase.is_perfect_squarec C r r r )r Z small_primer r r �fail_if_divisible_by� r z IntegerBase.fail_if_divisible_byc C r r r )r �a�br r r �multiply_accumulate� r z IntegerBase.multiply_accumulatec C r r r )r �sourcer r r �set� r zIntegerBase.setc C r r r r, r r r �inplace_inverse� r zIntegerBase.inplace_inversec C r r r r, r r r �inverse� r zIntegerBase.inversec C r r r r r r r �gcd� r zIntegerBase.gcdc C r r r r r r r �lcm� r zIntegerBase.lcmc C r r r )rB r: r r r � jacobi_symbol� r zIntegerBase.jacobi_symbolc C s� | dv r| S |d dkr$t | |d d |�}t |d|�| kr"td��|S d}|d d }|d@ s<|d7 }|dL }|d@ r0| �d�} t ||d d |�}|dkrU|d7 }qA||d kr\ntd��|}t |||�}t | ||�} t | |d d |�} | dkr�td|�D ]} t | d| |�dkr� nq�| |kr�td | |f ��t |d|| d |�} | }| d | }| | d | } | | | } | dks|t | d|�| kr�td��| 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 � � � rL � zCannot compute square rootTr z'Cannot compute square root of %d mod %d)�pow� ValueError� __class__r ) r: �p�root�s�q�zZeuler�m�c�t�r�irC r r r �_tonelli_shanks� sT � � � zIntegerBase._tonelli_shanksc K s� |� dd�}|� dd�}|� dd�}|du rt�� j}|du r'|du r'td��|dur3|dur3td��|p6|}|d d d }d|d | }t|d�d �}|dur[|d|d > O }|d|> d M }| �t|�||d � �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 exclusiverL � r )�popr �new�readrQ r r r ) �cls�kwargsr^ r_ r` �bitsZ bytes_neededZsignificant_bits_msbZmsbr r r �random) s" zIntegerBase.randomc K s� |� dd�}|� dd�}|� dd�}|� dd�}|r#tdt|j� ��d||fvr-td��|dur5|d }d||fv r?td ��|du rHt�� j}|| }| |��� }d }d | kr^|ksun | j||d �}d | krs|kr_|| S q_|| S ) 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 specifiedrL z(Missing keyword to identify the interval���r )r_ r` ) rb rQ �str�keysr rc rd r> rh ) re rf ri rj rk r` Z norm_maximumZ bits_neededZnorm_candidater r r � random_rangeY s4 ���zIntegerBase.random_rangec C s dS )a� Multiply two integers, take the modulo, and encode as big endian. This specialized method is used for RSA decryption. Args: term1 : integer The first term of the multiplication, non-negative. term2 : integer The second term of the multiplication, non-negative. modulus: integer The modulus, a positive odd number. :Returns: A byte string, with the result of the modular multiplication encoded in big endian mode. It is as long as the modulus would be, with zero padding on the left if needed. Nr )Zterm1Zterm2r( r r r �_mult_modulo_bytes� s z IntegerBase._mult_modulo_bytes)r r )r r ):�__name__� __module__� __qualname__�abc�abstractmethodr r r r � staticmethodr r r r r r r r �__bool__r r! r" r# r% r& r) r* r+ r- r. r/ r0 r1 r2 r3 r6 r7 r8 r9 r; r< r= r> r? r@ rA rD rF rG rH rI rJ rK r] � classmethodrh ro rp r r r r r & s� @ / /r ) rt ZCryptodome.Util.py3compatr r r r Z Cryptodomer r r r r r �<module> s
| ver. 1.4 |
Github
|
.
| PHP 8.2.30 | Generation time: 0 |
proxy
|
phpinfo
|
Settings