j,!ddlmZddlZddlZddlZddlmZmZddlm Z ddl m Z m Z ddlmZddlmZGdd ej ZeZee jjGd d ej ZeZee jje jjZe jjZ d%d&dZd'dZd(dZd)dZd*dZ d+dZ!d,dZ"d Z#d-d$Z$dS).) annotationsN)gcdlcm)openssl)_serializationhashes)AsymmetricPadding)utilsc.eZdZejddZeejddZejdd Zejd dZ ejd!dZ ejd"dZ ejd#dZ ejd$dZ dS)% RSAPrivateKey ciphertextbytespaddingr returncdS)z3 Decrypts the provided ciphertext. N)selfr rs |/var/www/finuniver-perm.ru/html/portfolio/venv/lib/python3.11/site-packages/cryptography/hazmat/primitives/asymmetric/rsa.pydecryptzRSAPrivateKey.decryptintcdSz7 The bit length of the public modulus. Nrrs rkey_sizezRSAPrivateKey.key_sizerr RSAPublicKeycdS)zD The RSAPublicKey associated with this private key. Nrrs r public_keyzRSAPrivateKey.public_key rrdata algorithmEasym_utils.Prehashed | hashes.HashAlgorithm | asym_utils.NoDigestInfocdS)z! Signs the data. Nr)rr rr!s rsignzRSAPrivateKey.sign&rrRSAPrivateNumberscdS)z/ Returns an RSAPrivateNumbers. Nrrs rprivate_numberszRSAPrivateKey.private_numbers3rrencoding_serialization.Encodingformat_serialization.PrivateFormatencryption_algorithm)_serialization.KeySerializationEncryptioncdSz6 Returns the key serialized as bytes. Nr)rr(r*r,s r private_byteszRSAPrivateKey.private_bytes9rrcdSz! Returns a copy. Nrrs r__copy__zRSAPrivateKey.__copy__DrrmemodictcdSz& Returns a deep copy. Nrrr4s r __deepcopy__zRSAPrivateKey.__deepcopy__JrrN)r rrr rrrrrr)r rrr r!r"rr)rr%)r(r)r*r+r,r-rr)rr )r4r5rr )__name__ __module__ __qualname__abcabstractmethodrpropertyrrr$r'r0r3r9rrrr r s<       X                                   rr ) metaclasscPeZdZejd!dZeejd"dZejd#d Zejd$dZ ejd%dZ ejd&dZ ejd'dZ ejd(dZ ejd)dZd S)*r plaintextrrr rcdS)z/ Encrypts the given plaintext. Nr)rrDrs rencryptzRSAPublicKey.encryptVrrrcdSrrrs rrzRSAPublicKey.key_size\rrRSAPublicNumberscdS)z- Returns an RSAPublicNumbers Nrrs rpublic_numberszRSAPublicKey.public_numberscrrr(r)r*_serialization.PublicFormatcdSr/r)rr(r*s r public_byteszRSAPublicKey.public_bytesirr signaturer r!+asym_utils.Prehashed | hashes.HashAlgorithmNonecdS)z5 Verifies the signature of the data. Nr)rrNr rr!s rverifyzRSAPublicKey.verifysrr5hashes.HashAlgorithm | asym_utils.NoDigestInfo | NonecdS)z@ Recovers the original data from the signature. Nr)rrNrr!s rrecover_data_from_signaturez(RSAPublicKey.recover_data_from_signaturerrotherobjectboolcdS)z" Checks equality. Nr)rrVs r__eq__zRSAPublicKey.__eq__rrcdSr2rrs rr3zRSAPublicKey.__copy__rrr4r5cdSr7rr8s rr9zRSAPublicKey.__deepcopy__rrN)rDrrr rrr:)rrH)r(r)r*rKrr) rNrr rrr r!rOrrP)rNrrr r!rSrr)rVrWrrXr;)r4r5rr)r<r=r>r?r@rFrArrJrMrRrUrZr3r9rrrrrUs`       X                                        rrpublic_exponentrrbackend typing.Anyrcbt||tj||SN)_verify_rsa_parameters rust_opensslrsagenerate_private_key)r]rr^s rreres- ?H555   0 0( K KKrrPcV|dvrtd|dkrtddS)N)izopublic_exponent must be either 3 (for legacy compatibility) or 65537. Almost everyone should choose 65537 here!iz$key_size must be at least 1024-bits. ValueError)r]rs rrbrbsEj(( ?   $?@@@remcd\}}||}}|dkr,t||\}}|||zz }||||f\}}}}|dk,||zS)zO Modular Multiplicative Inverse. Returns x such that: (x*e) mod m == 1 )rr)divmod) rjrkx1x2abqrxns r_modinvrvshFB aqA a%%a||1 !b&[!R| 1b" a%% 6MrprscX|dks|dkrtdt||S)zF Compute the CRT (q ** -1) % p value from RSA primes p and q. rmValues can't be <= 1)rirv)rwrss r rsa_crt_iqmprzs2 Avva/000 1a==rprivate_exponentcH|dks|dkrtd||dz zS)zg Compute the CRT private_exponent % (p - 1) value from the RSA private_exponent (d) and p. rmryrh)r{rws r rsa_crt_dmp1r}5 1Q/000 q1u %%rcH|dks|dkrtd||dz zS)zg Compute the CRT private_exponent % (q - 1) value from the RSA private_exponent (d) and q. rmryrh)r{rss r rsa_crt_dmq1rr~rc|dks |dks|dkrtdt|t|dz |dz S)z Compute the RSA private_exponent (d) given the public exponent (e) and the RSA primes p and q. This uses the Carmichael totient function to generate the smallest possible working value of the private exponent. rmry)rirvr)rjrwrss rrsa_recover_private_exponentrsN Avva166/000 1c!a%Q'' ( ((rindtuple[int, int]c|dks|dkrtddtd||z|krtd||zdz }|}|dzdkr|dz}|dzdkd}d}|s|tkrtjd|dz }|dz }|}||krVt|||} | dkr4| |dz kr+t| d|dkrt | dz|} d}n |dz}||kV|s |tk|std t || \} } | dksJt| | fd \} } | | fS) z Compute factors p and q from the private exponent d. We assume that n has no more than two factors. This function is adapted from code in PyCrypto. rmzd, e can't be <= 1zn, d, e don't matchrFTz2Unable to compute factors p and q from exponent d.)reverse)ripow_MAX_RECOVERY_ATTEMPTSrandomrandintrrnsorted) rrjrktottspottedtriesrqkcandrwrsrts rrsa_recover_prime_factorsrs  Avva-... SQUA  ./// q519D A a%1** F a%1**G E%"888 N1a!e $ $   $hhq!Q<rs( #""""" FFFFFFAAAAAAAAHHHHHHIIIIII< < < < < ck< < < < ~"/ |'5666E E E E E S[E E E E P!- l&3444 $6#4 LLLLLAAAA    &&&&&&&&))))*------r