Mj,!SSKJr SSKrSSKrSSKrSSKJrJr SSKJ r SSK J r J r SSKJr SSKJr "SS \R&S 9r\r\R-\ R.R(5 "S S \R&S 9r\r\R-\ R.R05 \ R.R4r\ R.R6rSSS jjrSSjrSSjrSSjrSSjr SSjr!SSjr"Sr#SSjr$g)) annotationsN)gcdlcm)openssl)_serializationhashes)AsymmetricPadding)utilsc~\rSrSr\R S Sj5r\\R S Sj55r\R SSj5r \R SSj5r \R SSj5r \R SSj5r \R SSj5r \R SS j5rS rg ) RSAPrivateKeycg)z# Decrypts the provided ciphertext. N)self ciphertextpaddings ~/root/GenerationalWealth/GenerationalWealth/venv/lib/python3.13/site-packages/cryptography/hazmat/primitives/asymmetric/rsa.pydecryptRSAPrivateKey.decryptcgz' The bit length of the public modulus. Nrrs rkey_sizeRSAPrivateKey.key_sizerrcg)z4 The RSAPublicKey associated with this private key. Nrrs r public_keyRSAPrivateKey.public_key rrcg)z Signs the data. Nr)rdatar algorithms rsignRSAPrivateKey.sign&rrcg)z Returns an RSAPrivateNumbers. Nrrs rprivate_numbersRSAPrivateKey.private_numbers3rrcgz& Returns the key serialized as bytes. Nr)rencodingformatencryption_algorithms r private_bytesRSAPrivateKey.private_bytes9rrcgz Returns a copy. Nrrs r__copy__RSAPrivateKey.__copy__Drrcgz Returns a deep copy. Nrrmemos r __deepcopy__RSAPrivateKey.__deepcopy__JrrrN)rbytesrr returnr9r:intr: RSAPublicKey)r!r9rr r"zEasym_utils.Prehashed | hashes.HashAlgorithm | asym_utils.NoDigestInfor:r9)r:RSAPrivateNumbers)r*_serialization.Encodingr+z_serialization.PrivateFormatr,z)_serialization.KeySerializationEncryptionr:r9)r:r )r6dictr:r )__name__ __module__ __qualname____firstlineno__abcabstractmethodrpropertyrrr#r&r-r1r7__static_attributes__rrrr r s%            #  "            ) - H           rr ) metaclassc\rSrSr\R S Sj5r\\R SSj55r\R SSj5r \R SSj5r \R SSj5r \R SSj5r \R SSj5r \R SS j5r\R SS j5rS rg )r>Ucg)z Encrypts the given plaintext. Nr)r plaintextrs rencryptRSAPublicKey.encryptVrrcgrrrs rrRSAPublicKey.key_size\rrcg)z Returns an RSAPublicNumbers Nrrs rpublic_numbersRSAPublicKey.public_numberscrrcgr)r)rr*r+s r public_bytesRSAPublicKey.public_bytesirrcg)z% Verifies the signature of the data. Nr)r signaturer!rr"s rverifyRSAPublicKey.verifysrrcg)z0 Recovers the original data from the signature. Nr)rrZrr"s rrecover_data_from_signature(RSAPublicKey.recover_data_from_signaturerrcg)z Checks equality. Nr)rothers r__eq__RSAPublicKey.__eq__rrcgr0rrs rr1RSAPublicKey.__copy__rrcgr4rr5s rr7RSAPublicKey.__deepcopy__rrrN)rNr9rr r:r9r;)r:RSAPublicNumbers)r*r@r+z_serialization.PublicFormatr:r9) rZr9r!r9rr r"z+asym_utils.Prehashed | hashes.HashAlgorithmr:None)rZr9rr r"z5hashes.HashAlgorithm | asym_utils.NoDigestInfo | Noner:r9)raobjectr:boolr=)r6rAr:r>)rBrCrDrErFrGrOrHrrTrWr[r^rbr1r7rIrrrr>r>Use         ) ,            #  ?         # I              rr>cV[X5 [RRX5$N)_verify_rsa_parameters rust_opensslrsagenerate_private_key)public_exponentrbackends rrqrqs# ?5    0 0 KKrcHUS;a [S5eUS:a [S5eg)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)rrrs rrnrns6j( ?  $?@@rchSup#XpTUS:a#[XE5upgX&U-- nXWX84upEp#US:aM#X!-$)zG Modular Multiplicative Inverse. Returns x such that: (x*e) mod m == 1 )rr)divmod) emx1x2abqrxns r_modinvrsLFB q a%a| b&[R| b a% 6MrcFUS::dUS::a [S5e[X5$)z> Compute the CRT (q ** -1) % p value from RSA primes p and q. ryValues can't be <= 1)rwr)prs r rsa_crt_iqmprs' Ava/00 1=rc>US::dUS::a [S5eXS- -$)z[ Compute the CRT private_exponent % (p - 1) value from the RSA private_exponent (d) and p. ryrrv)private_exponentrs r rsa_crt_dmp1r+ 1Q/00 1u %%rc>US::dUS::a [S5eXS- -$)z[ Compute the CRT private_exponent % (q - 1) value from the RSA private_exponent (d) and q. ryrrv)rrs r rsa_crt_dmq1rrrctUS::d US::dUS::a [S5e[U[US- US- 55$)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. ryr)rwrr)r{rrs rrsa_recover_private_exponentrs? Ava16/00 1c!a%Q' ((ricNUS::dUS::a [S5eS[SX-U5:wa [S5eX!-S- nUnUS-S:XaUS-nUS-S:XaMSnSnU(dU[:a[R"SUS- 5nUS- nUnX:aI[XxU5n U S:wa+XS- :wa#[U SU5S:Xa[ U S-U5n SnO US-nX:aMIU(d U[:aMU(d [S 5e[ UW 5upU S:Xde[X4SS 9upX4$) 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. ryzd, e can't be <= 1zn, d, e don't matchrFTz2Unable to compute factors p and q from exponent d.)reverse)rwpow_MAX_RECOVERY_ATTEMPTSrandomrandintrrzsorted) nr{dktottspottedtriesrkcandrrrs rrsa_recover_prime_factorsrsM  Ava-.. SQUA .// 519D A a%1* F a%1*G E%"88 NN1a!e $   hqQRSAPublicKeyWithSerializationr?rhrqrnrrrrrrrrrrrs  # FAHI< ckk< ~"/ |''556E S[[E P!- l&&334 $$66##44 LLLL LA &&)*-r