.PhddlmZddlZddlZddlZddlmZddlmZ ddl m Z m Z ddl mZddlmZGdd ej ZeZee jjGd d ej ZeZee jje jjZe jjZ d%d&dZd'dZd(dZd)dZd*dZd+dZ d,dZ!d Z"d-d$Z#dS).) annotationsN)gcd)openssl)_serializationhashes)AsymmetricPadding)utilsc eZdZejddZeejddZejdd ZejddZ ejddZ ejddZ ejd dZ dS)! RSAPrivateKey ciphertextbytespaddingrreturncdS)z3 Decrypts the provided ciphertext. N)selfr rs m/var/www/html/test/jupyter/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 algorithm+asym_utils.Prehashed | hashes.HashAlgorithmcdS)z! Signs the data. Nr)rrrr s rsignzRSAPrivateKey.sign&rrRSAPrivateNumberscdS)z/ Returns an RSAPrivateNumbers. Nrrs rprivate_numberszRSAPrivateKey.private_numbers1rrencoding_serialization.Encodingformat_serialization.PrivateFormatencryption_algorithm)_serialization.KeySerializationEncryptioncdSz6 Returns the key serialized as bytes. Nr)rr'r)r+s r private_byteszRSAPrivateKey.private_bytes7rrcdSz! Returns a copy. Nrrs r__copy__zRSAPrivateKey.__copy__BrrN)r r rrrr rrrr)rr rrr r!rr )rr$)r'r(r)r*r+r,rr )rr ) __name__ __module__ __qualname__abcabstractmethodrpropertyrrr#r&r/r2rrrr r s       X                            rr ) metaclassc.eZdZejddZeejddZejd d Zejd!dZ ejd"dZ ejd#dZ ejd$dZ ejd%dZ dS)&r plaintextr rrrcdS)z/ Encrypts the given plaintext. Nr)rr=rs rencryptzRSAPublicKey.encryptNrrrcdSrrrs rrzRSAPublicKey.key_sizeTrrRSAPublicNumberscdS)z- Returns an RSAPublicNumbers Nrrs rpublic_numberszRSAPublicKey.public_numbers[rrr'r(r)_serialization.PublicFormatcdSr.r)rr'r)s r public_byteszRSAPublicKey.public_bytesarr signaturerr r!NonecdS)z5 Verifies the signature of the data. Nr)rrGrrr s rverifyzRSAPublicKey.verifykrrhashes.HashAlgorithm | NonecdS)z@ Recovers the original data from the signature. Nr)rrGrr s rrecover_data_from_signaturez(RSAPublicKey.recover_data_from_signaturewrrotherobjectboolcdS)z" Checks equality. Nr)rrNs r__eq__zRSAPublicKey.__eq__rrcdSr1rrs rr2zRSAPublicKey.__copy__rrN)r=r rrrr r3)rrA)r'r(r)rDrr ) rGr rr rrr r!rrH)rGr rrr rKrr )rNrOrrPr4)r5r6r7r8r9r?r:rrCrFrJrMrRr2rrrrrMs<       X                                   rrpublic_exponentrrbackend typing.Anyrcbt||tj||SN)_verify_rsa_parameters rust_opensslrsagenerate_private_key)rTrrUs rr\r\s- ?H555   0 0( K KKrrHcV|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)rTrs rrYrYsEj(( ?   $?@@@remcd\}}||}}|dkr,t||\}}|||zz }||||f\}}}}|dk,||zS)zO Modular Multiplicative Inverse. Returns x such that: (x*e) mod m == 1 )rr)divmod) r`rax1x2abqrxns r_modinvrlshFB aqA a%%a||1 !b&[!R| 1b" a%% 6Mrpric"t||S)zF Compute the CRT (q ** -1) % p value from RSA primes p and q. )rl)rmris r rsa_crt_iqmpros 1a==rprivate_exponentc||dz zS)zg Compute the CRT private_exponent % (p - 1) value from the RSA private_exponent (d) and p. rcr)rprms r rsa_crt_dmp1rr q1u %%rc||dz zS)zg Compute the CRT private_exponent % (q - 1) value from the RSA private_exponent (d) and q. rcr)rpris r rsa_crt_dmq1rursrcf|dz |dz zt|dz |dz z}t||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. rc)rrl)r`rmrilambda_ns rrsa_recover_private_exponentrxs="A!a% CAq1u$5$55H 1h  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. rczd, e can't be <= 1zn, d, e don't matchrFTz2Unable to compute factors p and q from exponent d.)reverse)r_pow_MAX_RECOVERY_ATTEMPTSrandomrandintrrdsorted) ryr`rzktottspottedtriesrgkcandrmrirjs rrsa_recover_prime_factorsrs  Avva-... SQUA  ./// q519D A a%1** F a%1**G E%"888 N1a!e $ $   $hhq!Q<rs #""""" FFFFFFAAAAAAAAHHHHHHIIIIII4 4 4 4 4 ck4 4 4 4 n"/ |'5666? ? ? ? ? S[? ? ? ? D!- l&3444 $6#4 LLLLLAAAA    &&&&&&&&    .------r