2i! ddlmZddlZddlZddlZddlmZddlmZ ddl m Z m Z ddl mZddlmZGdd ej$ ZeZej+e j,j&Gd d ej$ ZeZej+e j,j.e j,j2Ze j,j4Z d dd ZddZddZddZddZddZ ddZ!dZ"ddZ#y)) annotationsN)gcd)openssl)_serializationhashes)AsymmetricPadding)utilscfeZdZejd dZeejd dZejd dZej d dZ ejddZ ej ddZ ejddZ ejddZ y ) RSAPrivateKeycy)z3 Decrypts the provided ciphertext. N)self ciphertextpaddings c/var/www/html/qr/venv/lib/python3.12/site-packages/cryptography/hazmat/primitives/asymmetric/rsa.pydecryptzRSAPrivateKey.decryptcyz7 The bit length of the public modulus. Nr rs rkey_sizezRSAPrivateKey.key_sizerrcy)zD The RSAPublicKey associated with this private key. Nr rs r public_keyzRSAPrivateKey.public_key rrcy)z! Signs the data. Nr )rdatar algorithms rsignzRSAPrivateKey.sign&rrcy)z/ Returns an RSAPrivateNumbers. Nr rs rprivate_numberszRSAPrivateKey.private_numbers3rrcyz6 Returns the key serialized as bytes. Nr )rencodingformatencryption_algorithms r private_byteszRSAPrivateKey.private_bytes9rrcyz! Returns a copy. Nr rs r__copy__zRSAPrivateKey.__copy__Drrcyz& Returns a deep copy. Nr rmemos r __deepcopy__zRSAPrivateKey.__deepcopy__JrrN)rbytesrrreturnr/r0intr0 RSAPublicKey)rr/rrrzEasym_utils.Prehashed | hashes.HashAlgorithm | asym_utils.NoDigestInfor0r/)r0RSAPrivateNumbers)r#_serialization.Encodingr$z_serialization.PrivateFormatr%z)_serialization.KeySerializationEncryptionr0r/)r0r )r-dictr0r )__name__ __module__ __qualname__abcabstractmethodrpropertyrrrr r&r)r.r rrr r s%            #  "            ) - H           rr ) metaclassceZdZejd dZeejd dZejd dZej ddZ ej ddZ ej ddZ ejddZ ejddZ ejdd Zy )r4cy)z/ Encrypts the given plaintext. Nr )r plaintextrs rencryptzRSAPublicKey.encryptVrrcyrr rs rrzRSAPublicKey.key_size\rrcy)z- Returns an RSAPublicNumbers Nr rs rpublic_numberszRSAPublicKey.public_numberscrrcyr"r )rr#r$s r public_byteszRSAPublicKey.public_bytesirrcy)z5 Verifies the signature of the data. Nr )r signaturerrrs rverifyzRSAPublicKey.verifysrrcy)z@ Recovers the original data from the signature. Nr )rrIrrs rrecover_data_from_signaturez(RSAPublicKey.recover_data_from_signaturerrcy)z" Checks equality. Nr )rothers r__eq__zRSAPublicKey.__eq__rrcyr(r rs rr)zRSAPublicKey.__copy__rrcyr+r r,s rr.zRSAPublicKey.__deepcopy__rrN)rAr/rrr0r/r1)r0RSAPublicNumbers)r#r6r$z_serialization.PublicFormatr0r/) rIr/rr/rrrz+asym_utils.Prehashed | hashes.HashAlgorithmr0None)rIr/rrrz5hashes.HashAlgorithm | asym_utils.NoDigestInfo | Noner0r/)rNobjectr0boolr3)r-r7r0r4)r8r9r:r;r<rBr=rrErGrJrLrOr)r.r rrr4r4Use         ) ,            #  ?         # I              rr4cZt||tjj||SN)_verify_rsa_parameters rust_opensslrsagenerate_private_key)public_exponentrbackends rr[r[s' ?H5    0 0( KKrcB|dvr td|dkr tdy)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 rrXrXs6j( ?  $?@@rcxd\}}||}}|dkDr(t||\}}|||zz }||||f\}}}}|dkDr(||zS)zO Modular Multiplicative Inverse. Returns x such that: (x*e) mod m == 1 )rr)divmod) emx1x2abqrxns r_modinvrnsbFB aqA a%a|1 !b&[!R| 1b" a% 6MrcD|dks|dkr tdt||S)zF Compute the CRT (q ** -1) % p value from RSA primes p and q. rcValues can't be <= 1)rarn)prks r rsa_crt_iqmprrs) Ava/00 1a=rc<|dks|dkr td||dz zS)zg Compute the CRT private_exponent % (p - 1) value from the RSA private_exponent (d) and p. rcrpr`)private_exponentrqs r rsa_crt_dmp1ru- 1Q/00 q1u %%rc<|dks|dkr td||dz zS)zg Compute the CRT private_exponent % (q - 1) value from the RSA private_exponent (d) and q. rcrpr`)rtrks r rsa_crt_dmq1rxrvrc|dks |dks|dkr td|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. rcrp)rarrn)rerqrklambda_ns rrsa_recover_private_exponentr{sV" Ava16/00A!a% CAq1u$55H 1h ric(|dks|dkr tddtd||z|k7r td||zdz }|}|dzdk(r|dz}|dzdk(rd}d}|s|tkrxtjd|dz }|dz }|}||krGt|||} | dk7r*| |dz k7r"t| d|dk(rt | dz|} d}n |dz}||krG|s |tkrx|s td t | \} } | dk(sJt| | 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)rapow_MAX_RECOVERY_ATTEMPTSrandomrandintrrdsorted) nredktottspottedtriesrikcandrqrkrls rrsa_recover_prime_factorsrsa  Ava-.. SQUA .// q519D A a%1* F a%1*G E%"88 NN1a!e $   $hq!Qrs  # FAHI< ckk< ~"/ |''556E S[[E P!- l&&334 $$66##44 LLLL LA && 2-r