Wwg 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)utilsceZdZejddZeejd dZejd dZej d dZ ejd dZ ej d dZ y) RSAPrivateKeycy)z3 Decrypts the provided ciphertext. N)self ciphertextpaddings d/var/www/horilla/myenv/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_numbers1rrcyz6 Returns the key serialized as bytes. Nr )rencodingformatencryption_algorithms r private_byteszRSAPrivateKey.private_bytes7rrN)rbytesrrreturnr'r(int)r( RSAPublicKey)rr'rrr+asym_utils.Prehashed | hashes.HashAlgorithmr(r')r(RSAPrivateNumbers)r#_serialization.Encodingr$z_serialization.PrivateFormatr%z)_serialization.KeySerializationEncryptionr(r') __name__ __module__ __qualname__abcabstractmethodrpropertyrrrr r&r rrr r s          # ?          ) - H     rr ) metaclasscPeZdZejd dZeejd dZejd dZej d dZ ej d dZ ej ddZ ejddZ y)r+cy)z/ Encrypts the given plaintext. Nr )r plaintextrs rencryptzRSAPublicKey.encryptHrrcyrr rs rrzRSAPublicKey.key_sizeNrrcy)z- Returns an RSAPublicNumbers Nr rs rpublic_numberszRSAPublicKey.public_numbersUrrcyr"r )rr#r$s r public_byteszRSAPublicKey.public_bytes[rrcy)z5 Verifies the signature of the data. Nr )r signaturerrrs rverifyzRSAPublicKey.verifyerrcy)z@ Recovers the original data from the signature. Nr )rr@rrs rrecover_data_from_signaturez(RSAPublicKey.recover_data_from_signatureqrrcy)z" Checks equality. Nr )rothers r__eq__zRSAPublicKey.__eq__|rrN)r8r'rrr(r'r))r(RSAPublicNumbers)r#r.r$z_serialization.PublicFormatr(r') r@r'rr'rrrr,r(None)r@r'rrrzhashes.HashAlgorithm | Noner(r')rEobjectr(bool) r/r0r1r2r3r9r4rr<r>rArCrFr rrr+r+Gs0         ) ,            #  ?         # /        rr+cZt||tjj||SN)_verify_rsa_parameters rust_opensslrsagenerate_private_key)public_exponentrbackends rrPrPs' ?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)rQrs rrMrMs6j( ?  $?@@rcxd\}}||}}|dkDr(t||\}}|||zz }||||f\}}}}|dkDr(||zS)zO Modular Multiplicative Inverse. Returns x such that: (x*e) mod m == 1 )rr)divmod) emx1x2abqrxns r_modinvrbsbFB aqA a%a|1 !b&[!R| 1b" a% 6Mrct||S)zF Compute the CRT (q ** -1) % p value from RSA primes p and q. )rb)pr_s r rsa_crt_iqmpres 1a=rc||dz zS)zg Compute the CRT private_exponent % (p - 1) value from the RSA private_exponent (d) and p. rWr )private_exponentrds r rsa_crt_dmp1rh q1u %%rc||dz zS)zg Compute the CRT private_exponent % (q - 1) value from the RSA private_exponent (d) and q. rWr )rgr_s r rsa_crt_dmq1rkrircV|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. rW)rrb)rYrdr_lambda_ns rrsa_recover_private_exponentrns7"A!a% CAq1u$55H 1h ricdtd||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 tdt | \} } | 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. zn, d, e don't matchrWrFTz2Unable to compute factors p and q from exponent d.)reverse)powrU_MAX_RECOVERY_ATTEMPTSrandomrandintrrXsorted) nrYdktottspottedtriesr]kcandrdr_r`s rrsa_recover_prime_factorsrsH  SQUA .// q519D A a%1* F a%1*G E%"88 NN1a!e $   $hq!Qrs  # FAHI. ckk. b"/ |''5569 S[[9 x!- l&&334 $$66##44 LLLL LA && .+r