jo SSKJr SSKrSSKrSSKrSSKJr SSKJr SSK J r J r SSK Jr SSKJr "SS \R$S 9r\r\R+\ R,R&5 "S S \R$S 9r\r\R+\ R,R.5 \ R,R2r\ R,R4rSSS jjrSSjrSSjrSSjrSSjrSSjr SSjr!Sr"SSjr#g)) annotationsN)gcd)openssl)_serializationhashes)AsymmetricPadding)utilscV\rSrSr\R S Sj5r\\R S Sj55r\R S Sj5r \R SSj5r \R SSj5r \R SSj5r \R SSj5r S rg ) RSAPrivateKeycg)z# Decrypts the provided ciphertext. N)self ciphertextpaddings c/var/www/website/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_numbers1rrcgz& Returns the key serialized as bytes. Nr)rencodingformatencryption_algorithms r private_bytesRSAPrivateKey.private_bytes7rrcgz Returns a copy. Nrrs r__copy__RSAPrivateKey.__copy__BrrrN)rbytesrrreturnr2r3intr3 RSAPublicKey)r r2rrr!+asym_utils.Prehashed | hashes.HashAlgorithmr3r2)r3RSAPrivateNumbers)r)_serialization.Encodingr*z_serialization.PrivateFormatr+z)_serialization.KeySerializationEncryptionr3r2)r3r )__name__ __module__ __qualname____firstlineno__abcabstractmethodrpropertyrrr"r%r,r0__static_attributes__rrrr r s           # ?          ) - H        rr ) metaclassc\rSrSr\R S Sj5r\\R S Sj55r\R SSj5r \R SSj5r \R SSj5r \R SSj5r \R SSj5r \R SS j5rS rg )r7Mcg)z Encrypts the given plaintext. Nr)r plaintextrs rencryptRSAPublicKey.encryptNrrcgrrrs rrRSAPublicKey.key_sizeTrrcg)z Returns an RSAPublicNumbers Nrrs rpublic_numbersRSAPublicKey.public_numbers[rrcgr(r)rr)r*s r public_bytesRSAPublicKey.public_bytesarrcg)z% Verifies the signature of the data. Nr)r signaturer rr!s rverifyRSAPublicKey.verifykrrcg)z0 Recovers the original data from the signature. Nr)rrSrr!s rrecover_data_from_signature(RSAPublicKey.recover_data_from_signaturewrrcg)z Checks equality. Nr)rothers r__eq__RSAPublicKey.__eq__rrcgr/rrs rr0RSAPublicKey.__copy__rrrN)rGr2rrr3r2r4)r3RSAPublicNumbers)r)r:r*z_serialization.PublicFormatr3r2) rSr2r r2rrr!r8r3None)rSr2rrr!zhashes.HashAlgorithm | Noner3r2)rZobjectr3boolr6)r;r<r=r>r?r@rHrArrMrPrTrWr[r0rBrrrr7r7MsJ         ) ,            #  ?         # /           rr7cV[X5 [RRX5$N)_verify_rsa_parameters rust_opensslrsagenerate_private_key)public_exponentrbackends rrhrhs# ?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)rirs rreres6j( ?  $?@@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_modinvr{sLFB 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. rpValues can't be <= 1)rnr{)prxs 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. rpr}rm)private_exponentr~s 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. rpr}rm)rrxs r rsa_crt_dmq1rrrcUS::d US::dUS::a [S5eUS- US- -[US- US- 5-n[X5$)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. rpr})rnrr{)rrr~rxlambda_ns rrsa_recover_private_exponentrsT" Ava16/00A!a% CAq1u$55H 1 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. rpzd, e can't be <= 1zn, d, e don't matchrFTz2Unable to compute factors p and q from exponent d.)reverse)rnpow_MAX_RECOVERY_ATTEMPTSrandomrandintrrqsorted) nrrdktottspottedtriesrvkcandr~rxrys rrsa_recover_prime_factorsrsM  Ava-.. SQUA .// 519D A a%1* F a%1*G E%"88 NN1a!e $   hqQrs  # FAHI4 ckk4 n"/ |''556? S[[? D!- l&&334 $$66##44 LLLL LA && 2-r