+ io cs^RIHt^RIt^RIt^RIt^RIHt^RIHt ^RI H t H t ^RI Ht^RIHt!RR ]P$R 7t]t]P+] P,P&4!R R ]P$R 7t]t]P+] P,P.4] P,P2t] P,P4tRR RlltRRltRRltRRltRRltRRlt RRlt!Rt"RRlt#R#)i) annotationsN)gcd)openssl)_serializationhashes)AsymmetricPadding)utilscsF]tRt^t]P RRl4t]]P RRl44t]P RRl4t ]P RRl4t ]P R R l4t ]P R R l4t ]P R Rl4t RtR#) RSAPrivateKeyc$V^8dQhRRRRRR/#) ciphertextbytespaddingrreturnformat"T/usr/lib64/python3.14/site-packages/cryptography/hazmat/primitives/asymmetric/rsa.py __annotate__RSAPrivateKey.__annotate__s"  % 2C  c R#)z# Decrypts the provided ciphertext. Nr)selfr r &&&rdecryptZRSAPrivateKey.decryptrcV^8dQhRR/#r r intrrrrrr  # rc rz' The bit length of the public modulus. Nrr&rkey_sizeZRSAPrivateKey.key_sizerrcrr r RSAPublicKeyrrrrrr!s  L rc r)z4 The RSAPublicKey associated with this private key. Nrr r!r public_keyZRSAPrivateKey.public_key rrc(V^8dQhRRRRRRRR/#)r datar r r algorithm+asym_utils.Prehashed | hashes.HashAlgorithmr rrrrrr's2   # ?    rc r)z Signs the data. Nr)rr'r r(&&&&rsignZRSAPrivateKey.sign&rrcr)r r RSAPrivateNumbersrrrrrr2s  !2 rc r)z Returns an RSAPrivateNumbers. Nrr r!rprivate_numbersZRSAPrivateKey.private_numbers1rrcs(V^8dQhRRRRRRRR/#) r encoding_serialization.Encodingrz_serialization.PrivateFormatencryption_algorithmz)_serialization.KeySerializationEncryptionr r rrrrrr8s3  ) - H    rc rz& Returns the key serialized as bytes. Nr)rr.rr0r*r private_bytesZRSAPrivateKey.private_bytes7rrcr)r r rrrrrrrCs  - rc rz Returns a copy. Nrr r!r__copy__ZRSAPrivateKey.__copy__BrrrN)__name__ __module__ __qualname____firstlineno__abcabstractmethodrpropertyr"r%r+r-r2r4__static_attributes__rrrrrs                   rr)Z metaclasscsp]tRt^Mt]P RRl4t]]P RRl44t]P RRl4t ]P RRl4t ]P R R l4t ]P R R l4t ]P R Rl4t ]P RRl4tRtR#)r$cr)r plaintextr r rr rrrrrRSAPublicKey.__annotate__Os"   1B u rc r)z Encrypts the given plaintext. Nr)rr=r rrencryptZRSAPublicKey.encryptNrrcrrrrrrrr>Vrrc rrrr r!rr"ZRSAPublicKey.key_sizeTrrcr)r r RSAPublicNumbersrrrrrr>\s  0 rc r)z Returns an RSAPublicNumbers Nrr r!rpublic_numbersZRSAPublicKey.public_numbers[rrcs$V^8dQhRRRRRR/#)r r.r/rz_serialization.PublicFormatr r rrrrrr>bs(  ) ,    rc rr1r)rr.rrr public_bytesZRSAPublicKey.public_bytesarrc s,V^8dQhRRRRRRRRRR /#) r signaturer r'r rr(r)r Nonerrrrrr>ls<       #  ?    rc r)z% Verifies the signature of the data. Nr)rrCr'r r(s&&&&&rverifyZRSAPublicKey.verifykrrcr&)r rCr r rr(zhashes.HashAlgorithm | Noner rrrrrr>xs2   # /    rc r)z0 Recovers the original data from the signature. Nr)rrCr r(r*rrecover_data_from_signatureZ(RSAPublicKey.recover_data_from_signaturewrrcs V^8dQhRRRR/#)r otherZobjectr Zboolrrrrrr>s  F t rc r)z Checks equality. Nr)rrG&&r__eq__ZRSAPublicKey.__eq__rrcrr#rrrrrr>s  , rc rr3rr r!rr4ZRSAPublicKey.__copy__rrrN)r5r6r7r8r9r:r?r;r"rArBrErFrIr4r<rrrr$r$Ms                        rr$cs(V^8dQhRRRRRRRR/#)r public_exponentrr"backendz typing.Anyr rrrrrrrs6LLLLL LrcsV\W4\PPW4#N)_verify_rsa_parameters rust_opensslrsagenerate_private_key)rJr"rKrrrPrPs# ?5    0 0 KKrcs$V^8dQhRRRRRR/#)r rJrr"r rDrrrrrrs&AACA3A4ArcsNVR9d \R4hVR8d \R4hR#)zopublic_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.N)rQi ValueError)rJr"rHrrMrMs6j( ?  $?@@rc$V^8dQhRRRRRR/#)r ermr rrrrrrs!  s s s rcst^^r2YrTV^8d&\WE4wrgW&V,, pWWW83wrEr#K,W!,#)zG Modular Multiplicative Inverse. Returns x such that: (x*e) mod m == 1 )divmod) rUrVZx1Zx2aZbqrZxns && r_modinvr[sC q a%a| b&[R| b" 6MrcrT)r prrYr rrrrrrs!CCCrcsJV^8:gV^8:d \R4h\W4#)z> Compute the CRT (q ** -1) % p value from RSA primes p and q. Values can't be <= 1)rSr[)r\rYrHr rsa_crt_iqmpr^s' Ava/00 1=rcrT)r private_exponentrr\r rrrrrr!&&3&3&3&rcRV^8:gV^8:d \R4hW^, ,#)z[ Compute the CRT private_exponent % (p - 1) value from the RSA private_exponent (d) and p. r]rR)r_r\rHr rsa_crt_dmp1rb+ 1Q/00 1u %%rcrT)r r_rrYr rrrrrrr`rcra)z[ Compute the CRT private_exponent % (q - 1) value from the RSA private_exponent (d) and q. r]rR)r_rYrHr rsa_crt_dmq1rdrcrcs(V^8dQhRRRRRRRR/#)r rUrr\rYr rrrrrrs(  C C C C rcsV^8:gV^8:gV^8:d \R4hV^, V^, ,\V^, V^, 4,p\W4#)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. r])rSrr[)rUr\rYZlambda_ns&&& rrsa_recover_private_exponentresT" Ava16/00A!a% CAq1u$55H 1 rics(V^8dQhRRRRRRRR/#)r nrrUdr ztuple[int, int]rrrrrrs(------rcsV^8:gV^8:d \R4h^\^W,V48wd \R4hW!,^, pTpV^,^8Xd V^,pKRp^pV'gV\8d\P!^V^, 4pV^, pTpW8gKD\WxV4p V ^8wd7W^, 8wd*\V ^V4^8Xd\ V ^,V4p RpKV^,pK\V'g \R4h\ VX 4wrV ^8XgQh\W3RR7wrW3#)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. zd, e can't be <= 1zn, d, e don't matchFTz2Unable to compute factors p and q from exponent d.)Zreverse)rSZpow_MAX_RECOVERY_ATTEMPTSrandomZrandintrrWZsorted) rfrUrgZktotZtZspottedZtriesrXZkZcandr\rYrZs &&& rrsa_recover_prime_factorsrjs*  Ava-.. SQUA .// 519D A a%1* F G E%"88 NN1a!e $   hqQrks # FAHI4 ckk4 n"/ |''556? S[[? D!- l&&334 $$66##44LA && 2-r