pܧiSSKJr SSKrSSKrSSKJr SSKJr SSK J r J r SSK J r SSKJr "SS \R"S 9r\r\R)\R*R$5 "S S \R"S 9r\r\R)\R*R,5 \R*R0r\R*R2rSSS jjrSSjrSSjrSSjrSSjrSSjrSSjr Sr!SSjr"g)) annotationsN)gcd)openssl)_serializationhashes)AsymmetricPadding)utilsc.\rSrSr\R S Sj5r\\R S Sj55r\R S Sj5r \R S Sj5r \R SSj5r \R SSj5r Sr g ) RSAPrivateKeycg)z# Decrypts the provided ciphertext. N)self ciphertextpaddings O/usr/lib/python3/dist-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_keyrrcg)z Signs the data. Nr)rdatar algorithms rsignRSAPrivateKey.sign%rrcg)z Returns an RSAPrivateNumbers. Nrrs rprivate_numbersRSAPrivateKey.private_numbers0rrcgz& Returns the key serialized as bytes. Nr)rencodingformatencryption_algorithms r private_bytesRSAPrivateKey.private_bytes6rrrN)rbytesrrreturnr.r/int)r/ RSAPublicKey)r r.rrr!+asym_utils.Prehashed | hashes.HashAlgorithmr/r.)r/RSAPrivateNumbers)r)_serialization.Encodingr*z_serialization.PrivateFormatr+z)_serialization.KeySerializationEncryptionr/r.)__name__ __module__ __qualname____firstlineno__abcabstractmethodrpropertyrrr"r%r,__static_attributes__rrrr r s          # ?          ) - H     rr ) metaclasscf\rSrSr\R S Sj5r\\R S Sj55r\R S Sj5r \R SSj5r \R SSj5r \R SSj5r \R SSj5r S rg )r2Fcg)z Encrypts the given plaintext. Nr)r plaintextrs rencryptRSAPublicKey.encryptGrrcgrrrs rrRSAPublicKey.key_sizeMrrcg)z Returns an RSAPublicNumbers Nrrs rpublic_numbersRSAPublicKey.public_numbersTrrcgr(r)rr)r*s r public_bytesRSAPublicKey.public_bytesZrrcg)z% Verifies the signature of the data. Nr)r signaturer rr!s rverifyRSAPublicKey.verifydrrcg)z0 Recovers the original data from the signature. Nr)rrNrr!s rrecover_data_from_signature(RSAPublicKey.recover_data_from_signatureprrcg)z Checks equality. Nr)rothers r__eq__RSAPublicKey.__eq__{rrrN)rBr.rrr/r.r0)r/RSAPublicNumbers)r)r5r*z_serialization.PublicFormatr/r.) rNr.r r.rrr!r3r/None)rNr.rrr!zhashes.HashAlgorithm | Noner/r.)rUobjectr/bool)r6r7r8r9r:r;rCr<rrHrKrOrRrVr=rrrr2r2Fs0         ) ,            #  ?         # /        rr2cV[X5 [RRX5$N)_verify_rsa_parameters rust_opensslrsagenerate_private_key)public_exponentrbackends rraras# ?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)rbrs rr^r^s6j( ?  $?@@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_modinvrssLFB q a%a| b&[R| b a% 6Mrc[X5$)z> Compute the CRT (q ** -1) % p value from RSA primes p and q. )rs)prps r rsa_crt_iqmprvs 1=rcXS- -$)z[ Compute the CRT private_exponent % (p - 1) value from the RSA private_exponent (d) and p. rhr)private_exponentrus r rsa_crt_dmp1ry 1u %%rcXS- -$)z[ Compute the CRT private_exponent % (q - 1) value from the RSA private_exponent (d) and q. rhr)rxrps r rsa_crt_dmq1r|rzrcTUS- 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. rh)rrs)rjrurplambda_ns rrsa_recover_private_exponentrs5"A!a% CAq1u$55H 1 ricX!-S- nUnUS-S:XaUS-nUS-S:XaMSnSnU(drU[:ahUnXs:aI[XgU5nUS:wa+XS- :wa#[USU5S:Xa[US-U5n SnO US-nXs:aMIUS- nU(d U[:aMhU(d [S5e[ UW 5upU S:Xde[ X4SS9upX4$)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. rhrFTz2Unable to compute factors p and q from exponent d.)reverse)_MAX_RECOVERY_ATTEMPTSpowrrfrisorted) nrjdktottspottedrnkcandrurprqs rrsa_recover_prime_factorsrs 519D A a%1* F a%1*G A!44 hqQrs # FAHI. ckk. b"/ |''5569 S[[9 x!- l&&334 $$66##44 LLLL LA && 0(r