Ë
|
¬`i¡- ã óF d dl Z d dlmZmZmZmZ d dlmZ G d de« Zy)é N)Ú
|
iter_rangeÚbordÚbchrÚABC)ÚRandomc ó e Zd Zej d « Zej d « Zej d « Zej d4d« Ze ej d5d« « Z
|
ej d « Z ej d « Z ej d « Z ej d « Zej d
|
« Zej d « Zej d « ZeZej d « Zej d « Zej d « Zej d « Zej d « Zej d « Zej d6d« Zej d6d« Zej d « Zej d6d« Z ej d « Z ej d « Z ej d « Z ej d « Z ej d « Z!ej d « Z"ej d « Z#ej d « Z$ej d « Z%ej d! « Z&ej d" « Z'ej d# « Z(ej d$ « Z)ej d% « Z*ej d& « Z+ej d' « Z,ej d( « Z-ej d) « Z.ej d* « Z/ej d+ « Z0ej d, « Z1ej d- « Z2ej d. « Z3e ej d/ « « Z4e d0 « Z5e6d1 « Z7e6d2 « Z8e ej d3 « « Z9y)7Ú IntegerBasec ó y ©N© ©Úselfs õk H:\项ç®\archive\æµè¯ç»\èæ¬\Change_password\venv_build\Lib\site-packages\Crypto/Math/_IntegerBase.pyÚ__int__zIntegerBase.__int__) ó à ó c ó y r r r s r Ú__str__zIntegerBase.__str__- r r c ó y r r r s r Ú__repr__zIntegerBase.__repr__1 r r c ó y r r )r Ú
|
block_sizeÚ byteorders r Úto_byteszIntegerBase.to_bytes5 r r c ó y r r )Ú byte_stringr s r Ú
|
from_byteszIntegerBase.from_bytes9 ó ð r c ó y r r ©r Úterms r Ú__eq__zIntegerBase.__eq__? r r c ó y r r r s r Ú__ne__zIntegerBase.__ne__C r r c ó y r r r s r Ú__lt__zIntegerBase.__lt__G r r c ó y r r r s r Ú__le__zIntegerBase.__le__K r r c ó y r r r s r Ú__gt__zIntegerBase.__gt__O r r c ó y r r r s r Ú__ge__zIntegerBase.__ge__S r r c ó y r r r s r Ú __nonzero__zIntegerBase.__nonzero__W r r c ó y r r r s r Ú is_negativezIntegerBase.is_negative\ r r c ó y r r r s r Ú__add__zIntegerBase.__add__a r r c ó y r r r s r Ú__sub__zIntegerBase.__sub__e r r c ó y r r )r Úfactors r Ú__mul__zIntegerBase.__mul__i r r c ó y r r ©r Údivisors r Ú __floordiv__zIntegerBase.__floordiv__m r r c ó y r r r9 s r Ú__mod__zIntegerBase.__mod__q r r Nc ó y r r ©r ÚexponentÚmoduluss r Ú inplace_powzIntegerBase.inplace_powu r r c ó y r r r? s r Ú__pow__zIntegerBase.__pow__y r r c ó y r r r s r Ú__abs__zIntegerBase.__abs__} r r c ó y r r ©r rA s r ÚsqrtzIntegerBase.sqrt r r c ó y r r r s r Ú__iadd__zIntegerBase.__iadd__
r r c ó y r r r s r Ú__isub__zIntegerBase.__isub__ r r c ó y r r r s r Ú__imul__zIntegerBase.__imul__ r r c ó y r r r s r Ú__imod__zIntegerBase.__imod__ r r c ó y r r r s r Ú__and__zIntegerBase.__and__ r r c ó y r r r s r Ú__or__zIntegerBase.__or__ r r c ó y r r ©r Úposs r Ú
|
__rshift__zIntegerBase.__rshift__ r r c ó y r r rW s r Ú __irshift__zIntegerBase.__irshift__¢ r r c ó y r r rW s r Ú
|
__lshift__zIntegerBase.__lshift__¦ r r c ó y r r rW s r Ú __ilshift__zIntegerBase.__ilshift__ª r r c ó y r r )r Úns r Úget_bitzIntegerBase.get_bit® r r c ó y r r r s r Úis_oddzIntegerBase.is_odd³ r r c ó y r r r s r Úis_evenzIntegerBase.is_even· r r c ó y r r r s r Ú size_in_bitszIntegerBase.size_in_bits» r r c ó y r r r s r Ú size_in_byteszIntegerBase.size_in_bytes¿ r r c ó y r r r s r Úis_perfect_squarez IntegerBase.is_perfect_squareà r r c ó y r r )r Ú small_primes r Úfail_if_divisible_byz IntegerBase.fail_if_divisible_byÇ r r c ó y r r )r ÚaÚbs r Úmultiply_accumulatez IntegerBase.multiply_accumulateË r r c ó y r r )r Úsources r ÚsetzIntegerBase.setÏ r r c ó y r r rH s r Úinplace_inversezIntegerBase.inplace_inverseÓ r r c ó y r r rH s r ÚinversezIntegerBase.inverse× r r c ó y r r r s r ÚgcdzIntegerBase.gcdÛ r r c ó y r r r s r ÚlcmzIntegerBase.lcmß r r c ó y r r )rq ra s r Ú jacobi_symbolzIntegerBase.jacobi_symbolã r r c óÎ | dv r| S |dz dk( r0t | |dz dz |« }t |d|« | k7 r t d« |S d}|dz
|
dz }|dz s|dz }|dz }|dz s| j d« } t ||dz
|
dz |« }|dk( r|dz } ||dz
|
k( rn t d« |}t |||« }t | ||« } t | |dz dz |« }
|
| dk7 rtt d|« D ] } t | d| z |« dk( s n |k( rt d| |fz « t |d|| z
|
dz
|
z |« } | }| dz |z }| | dz z |z } |
|
| z |z }
|
| dk7 rtt |
|
d|« | k7 r t d« |
|
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 rootr z'Cannot compute square root of %d mod %d)ÚpowÚ
|
ValueErrorÚ __class__r ) ra ÚpÚrootÚsÚqÚzÚeulerÚmÚcÚtÚrÚirr s r Ú_tonelli_shankszIntegerBase._tonelli_shanksè sÙ ð" ;ØHà q5A:Üq1q5 Q,¨Ó*DÜ4A !Ò#Ü Ð!=Ó>Ð>ØKà Ø UqLØq5Ø FAØ !GAð q5ð KKNØÜA E a<¨Ó+EØzØQØØA~Øä Ð 9Ó:Ð :à Ü 1aLÜ 1aLÜ AEa< Ó #à1fÜ 1Ó%ò Üq!Q$ ? aÓ'Ùð ð AvÜ Ð!JÈaÐQRÈVÑ!SÓTÐTÜAq1q5 19~ qÓ)AØAØ1qAØQTQAØQ! Að 1fô q!Q<1Ò Ü Ð 9Ó:Ð :àr c óÆ |j dd« }|j dd« }|j dd« }| t j « j }| | t d« | | t d« |xs |}|dz
|
dz dz }d|dz |z
|
z
|
}t |d« d « }| |d|dz
|
z z }|d|z dz
|
z }| j 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 r r r ) ÚclsÚkwargsr r r ÚbitsÚ bytes_neededÚsignificant_bits_msbÚmsbs r ÚrandomzIntegerBase.random) s ð2 ZZ ¨dÓ3
|
Ø::j¨$Ó/Ø::j¨$Ó/à Ð Ü zz|×(Ñ(Hà Ð (Ð"2Ü Ð RÓSÐ Sà Ð ! hÐ&:Ü Ð QÓRÐ RàÒ%XØ a¨1Ñ, Ø L°1Ñ$4°tÑ$;Ñ <Ð Ü8A;q>Ó"Ø Ð !Ø 1Ð-°Ñ1Ñ2Ñ 2CØ Ð)Ñ)¨QÑ.Ñ.à~~d 3i©(°<À!Ñ3CÓ*DÑ DÓEÐEr c ó |j dd« }|j dd« }|j dd« }|j dd« }|r!t dt |j « z « d||fvr t d« ||dz
|
}d||fv r t d « | t j
|
« j }||z
|
} | |« j « }d
|
}d |cxk r|k s(n | j ||¬ « }d |cxk r
|
|k s ||z S &||z 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 specifiedr z(Missing keyword to identify the intervaléÿÿÿÿr )r r ) r r ÚstrÚkeysr r r rh r£ ) r r r¥ r¦ r§ r Ú norm_maximumÚ bits_neededÚnorm_candidates r Ú random_rangezIntegerBase.random_rangeY s6 ð&
|
|
?°DÓ9 Ø
|
|
?°DÓ9 Ø
|
|
?°DÓ9 Ø::j¨$Ó/á Ü Ð 1´C¸¿ ¹ Ó4DÑ DÓEÐ EØ }Ð5Ñ 5Ü ð &ó 'ð 'à Ð $Ø )¨AÑ -MØ M =Ð1Ñ 1Ü Ð GÓHÐ Hà Ð Ü zz|×(Ñ(Hà$ }Ñ4 Ù,Ó'×4Ñ4Ó6 àØ~Ô5¨ Ô5Ø ZZØ-8Ø-5ð (ó &Nð ~Ô5¨ Ó5ð
|
Ñ-Ð-ñ 6ð
|
Ñ-Ð-r c ó y)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 )Úterm1Úterm2rA s r Ú_mult_modulo_bytesz IntegerBase._mult_modulo_bytes s ð& r )r Úbig)r³ r ):Ú__name__Ú
|
__module__Ú __qualname__ÚabcÚabstractmethodr r r r Ú staticmethodr r" r$ r& r( r* r, r. Ú__bool__r0 r2 r4 r7 r; r= rB rD rF rI rK rM rO rQ rS rU rY r[ r] r_ rb rd rf rh rj rl ro rs rv rx rz r| r~ r r Ú classmethodr£ r® r² r r r r r & s$ ð ×Ññ ó ð ð ×Ññ ó ð ð ×Ññ ó ð ð ×Ñò ó ð ð Ø×Ñò ó ó ð ð ×Ññ ó ð ð ×Ññ ó ð ð ×Ññ ó ð ð ×Ññ ó ð ð ×Ññ ó ð ð ×Ññ ó ð ð ×Ññ ó ð àHà×Ññ ó ð ð ×Ññ ó ð ð ×Ññ ó ð ð ×Ññ ó ð ð ×Ññ ó ð ð ×Ññ ó ð ð ×Ñò ó ð ð ×Ñò ó ð ð ×Ññ ó ð ð ×Ñò ó ð ð ×Ññ ó ð ð ×Ññ ó ð ð ×Ññ ó ð ð ×Ññ ó ð ð ×Ññ ó ð ð ×Ññ ó ð ð ×Ññ ó ð ð ×Ññ ó ð ð ×Ññ ó ð ð ×Ññ ó ð ð ×Ññ ó ð ð ×Ññ ó ð ð ×Ññ ó ð ð ×Ññ ó ð ð ×Ññ ó ð ð ×Ññ ó ð ð ×Ññ ó ð ð ×Ññ ó ð ð ×Ññ ó ð ð ×Ññ ó ð ð ×Ññ ó ð ð ×Ññ ó ð ð ×Ññ ó ð ð Ø×Ññ ó ó ð ð ñ>ó ð>ð@ ñ-Fó ð-Fð^ ñ-.ó ð-.ð^ Ø×Ññ ó ó ñ r r ) r· ÚCrypto.Util.py3compatr r r r ÚCryptor r r r r ú<module>r¾ s! ðó> ç =Ó =å ôv #õ v r
|
