Файловый менеджер - Редактировать - /opt/imh-python/lib/python3.9/site-packages/Crypto/Math/__pycache__/_IntegerBase.cpython-39.pyc
Ðазад
a c�h�( � @ 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� �Zejdedd ��Ze ejd d � ��Z ejd d � �Z ejdd� �Z ejdd� �Z ejdd� �Zejdd� �Zejdd� �Zejdd� �ZeZejdd� �Zejd d � �Zejd d � �Zejd d!� �Zejd"d#� �Zejd$d%� �Zejdfd'd(��Zejdgd)d*��Zejd+d,� �Zejdhd-d.��Z ejd/d0� �Z ejd1d2� �Z ejd3d4� �Z ejd5d6� �Z ejd7d8� �Z!ejd9d:� �Z"ejd;d<� �Z#ejd=d>� �Z$ejd?d@� �Z%ejdAdB� �Z&ejdCdD� �Z'ejdEdF� �Z(ejdGdH� �Z)ejdIdJ� �Z*ejdKdL� �Z+ejdMdN� �Z,ejdOdP� �Z-ejdQdR� �Z.ejdSdT� �Z/ejdUdV� �Z0ejdWdX� �Z1ejdYdZ� �Z2ejd[d\� �Z3e ejd]d^� ��Z4e d_d`� �Z5e6dadb� �Z7e6dcdd� �Z8d&S )i� IntegerBasec C s d S �N� ��selfr r ��/root/rpmbuild/BUILDROOT/imh-python39-modules-3.9.7-92.el8.x86_64/opt/imh-python/lib/python3.9/site-packages/Crypto/Math/_IntegerBase.py�__int__) s zIntegerBase.__int__c C s d S r r r r r r �__str__- s zIntegerBase.__str__c C s d S r r r r r r �__repr__1 s zIntegerBase.__repr__r c C s d S r r )r � block_sizer r r �to_bytes5 s zIntegerBase.to_bytesc C s d S r r )Z byte_stringr r r � from_bytes9 s zIntegerBase.from_bytesc C s d S r r �r �termr r r �__eq__? s zIntegerBase.__eq__c C s d S r r r r r r �__ne__C s zIntegerBase.__ne__c C s d S r r r r r r �__lt__G s zIntegerBase.__lt__c C s d S r r r r r r �__le__K s zIntegerBase.__le__c C s d S r r r r r r �__gt__O s zIntegerBase.__gt__c C s d S r r r r r r �__ge__S s zIntegerBase.__ge__c C s d S r r r r r r � __nonzero__W s zIntegerBase.__nonzero__c C s d S r r r r r r � is_negative\ s zIntegerBase.is_negativec C s d S r r r r r r �__add__a s zIntegerBase.__add__c C s d S r r r r r r �__sub__e s zIntegerBase.__sub__c C s d S r r )r �factorr r r �__mul__i s zIntegerBase.__mul__c C s d S r r �r Zdivisorr r r � __floordiv__m s zIntegerBase.__floordiv__c C s d S r r r! r r r �__mod__q s zIntegerBase.__mod__Nc C s d S r r �r �exponent�modulusr r r � inplace_powu s zIntegerBase.inplace_powc C s d S r r r$ r r r �__pow__y s zIntegerBase.__pow__c C s d S r r r r r r �__abs__} s zIntegerBase.__abs__c C s d S r r �r r& r r r �sqrt� s zIntegerBase.sqrtc C s d S r r r r r r �__iadd__� s zIntegerBase.__iadd__c C s d S r r r r r r �__isub__� s zIntegerBase.__isub__c C s d S r r r r r r �__imul__� s zIntegerBase.__imul__c C s d S r r r r r r �__imod__� s zIntegerBase.__imod__c C s d S r r r r r r �__and__� s zIntegerBase.__and__c C s d S r r r r r r �__or__� s zIntegerBase.__or__c C s d S r r �r �posr r r � __rshift__� s zIntegerBase.__rshift__c C s d S r r r2 r r r � __irshift__� s zIntegerBase.__irshift__c C s d S r r r2 r r r � __lshift__� s zIntegerBase.__lshift__c C s d S r r r2 r r r � __ilshift__� s zIntegerBase.__ilshift__c C s d S r r )r �nr r r �get_bit� s zIntegerBase.get_bitc C s d S r r r r r r �is_odd� s zIntegerBase.is_oddc C s d S r r r r r r �is_even� s zIntegerBase.is_evenc C s d S r r r r r r � size_in_bits� s zIntegerBase.size_in_bitsc C s d S r r r r r r � size_in_bytes� s zIntegerBase.size_in_bytesc C s d S r r r r r r �is_perfect_square� s z IntegerBase.is_perfect_squarec C s d S r r )r Z small_primer r r �fail_if_divisible_by� s z IntegerBase.fail_if_divisible_byc C s d S r r )r �a�br r r �multiply_accumulate� s z IntegerBase.multiply_accumulatec C s d S r r )r �sourcer r r �set� s zIntegerBase.setc C s d S r r r* r r r �inplace_inverse� s zIntegerBase.inplace_inversec C s d S r r r* r r r �inverse� s zIntegerBase.inversec C s d S r r r r r r �gcd� s zIntegerBase.gcdc C s d S r r r r r r �lcm� s zIntegerBase.lcmc C s d S r r )r@ r8 r r r � jacobi_symbol� s zIntegerBase.jacobi_symbolc C s� | dv r | S |d dkrHt | |d d |�}t |d|�| krDtd��|S d}|d d }|d@ sr|d7 }|dL }qX| �d�}t ||d d |�}|dkr�|d7 }q|||d kr�q�td��q||}t |||�}t | ||�} t | |d d |�} | dk�r~td|�D ] } t | d| |�dkr� �q q�| |k�r8td| |f ��t |d|| d |�} | }| d | }| | d | } | | | } q�t | d|�| k�r�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 � � � rJ � zCannot compute square rootr z'Cannot compute square root of %d mod %d)�pow� ValueError� __class__r ) r8 �p�root�s�q�zZeuler�m�c�t�r�irA r r r �_tonelli_shanks� sL zIntegerBase._tonelli_shanksc K s� |� dd�}|� dd�}|� dd�}|du r6t�� j}|du rN|du rNtd��|durf|durftd��|pl|}|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 exclusiverJ � r )�popr �new�readrO r r r ) �cls�kwargsr\ r] r^ �bitsZ bytes_neededZsignificant_bits_msbZmsbr r r �random) s" zIntegerBase.randomc K s� |� dd�}|� dd�}|� dd�}|� dd�}|rFtdt|j� ��d||fvrZtd��|durj|d }d||fv r~td ��|du r�t�� j}|| }| |��� }d }d | kr�|ks�n | j||d �}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 specifiedrJ z(Missing keyword to identify the interval���r )r] r^ ) r` rO �str�keysr ra rb r< rf ) rc rd rg rh ri r^ Z norm_maximumZ bits_neededZnorm_candidater r r � random_rangeY s. �zIntegerBase.random_range)r )N)N)N)9�__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- r. r/ r0 r1 r4 r5 r6 r7 r9 r: r; r< r= r> r? rB rD rE rF rG rH rI r[ � classmethodrf rm r r r r r & s� @ /r ) rq ZCrypto.Util.py3compatr r r r ZCryptor r r r r r �<module> s
| ver. 1.1 | |
.
| PHP 8.3.30 | Ð“ÐµÐ½ÐµÑ€Ð°Ñ†Ð¸Ñ Ñтраницы: 0 |
proxy
|
phpinfo
|
ÐаÑтройка