U ʹho @s`ddlmZddlZddlZddlZddlmZddlmZ ddl m Z m Z ddl mZddlmZGdd d ejd ZeZee jjGd d d ejd ZeZee jje jjZe jjZd*d d dd dddZd d ddddZd d d dddZd d d dddZd d d dddZd d d dd d!Z d d d d d"d#d$Z!d%Z"d d d d&d'd(d)Z#dS)+) annotationsN)gcd)openssl)_serializationhashes)AsymmetricPadding)utilsc@seZdZejddddddZeejdddd Zejd dd d Zejddd ddddZ ejddddZ ejdddddddZ ejddddZ dS) RSAPrivateKeybytesr) ciphertextpaddingreturncCsdS)z3 Decrypts the provided ciphertext. N)selfr r rrS./venv/lib/python3.8/site-packages/cryptography/hazmat/primitives/asymmetric/rsa.pydecryptszRSAPrivateKey.decryptintr cCsdSz7 The bit length of the public modulus. Nrrrrrkey_sizeszRSAPrivateKey.key_size RSAPublicKeycCsdS)zD The RSAPublicKey associated with this private key. Nrrrrr public_key szRSAPrivateKey.public_key+asym_utils.Prehashed | hashes.HashAlgorithm)datar algorithmr cCsdS)z! Signs the data. Nr)rrr rrrrsign&szRSAPrivateKey.signRSAPrivateNumberscCsdS)z/ Returns an RSAPrivateNumbers. Nrrrrrprivate_numbers1szRSAPrivateKey.private_numbers_serialization.Encodingz_serialization.PrivateFormatz)_serialization.KeySerializationEncryption)encodingformatencryption_algorithmr cCsdSz6 Returns the key serialized as bytes. Nr)rr r!r"rrr private_bytes7szRSAPrivateKey.private_bytescCsdSz! Returns a copy. Nrrrrr__copy__BszRSAPrivateKey.__copy__N) __name__ __module__ __qualname__abcabstractmethodrpropertyrrrrr$r&rrrrr s  r ) metaclassc@seZdZejddddddZeejdddd Zejd dd d Zejd dddddZ ejddddddddZ ejdddddddZ ejdddddZ ejddd d!Z d"S)#rr r) plaintextr r cCsdS)z/ Encrypts the given plaintext. Nr)rr.r rrrencryptNszRSAPublicKey.encryptrrcCsdSrrrrrrrTszRSAPublicKey.key_sizeRSAPublicNumberscCsdS)z- Returns an RSAPublicNumbers Nrrrrrpublic_numbers[szRSAPublicKey.public_numbersrz_serialization.PublicFormat)r r!r cCsdSr#r)rr r!rrr public_bytesaszRSAPublicKey.public_bytesrNone) signaturerr rr cCsdS)z5 Verifies the signature of the data. Nr)rr4rr rrrrverifykszRSAPublicKey.verifyzhashes.HashAlgorithm | None)r4r rr cCsdS)z@ Recovers the original data from the signature. Nr)rr4r rrrrrecover_data_from_signaturewsz(RSAPublicKey.recover_data_from_signatureobjectbool)otherr cCsdS)z" Checks equality. Nr)rr9rrr__eq__szRSAPublicKey.__eq__cCsdSr%rrrrrr&szRSAPublicKey.__copy__N)r'r(r)r*r+r/r,rr1r2r5r6r:r&rrrrrMs"   rrz typing.Any)public_exponentrbackendr cCst||tj||S)N)_verify_rsa_parameters rust_opensslrsagenerate_private_key)r;rr<rrrr@s r@r3)r;rr cCs$|dkrtd|dkr tddS)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)r;rrrrr=s r=)emr c CsRd\}}||}}|dkrJt||\}}|||}||||f\}}}}q||S)zO Modular Multiplicative Inverse. Returns x such that: (x*e) mod m == 1 )rr)divmod) rDrEZx1Zx2abqrZxnrrr_modinvs  rL)prJr cCs"|dks|dkrtdt||S)zF Compute the CRT (q ** -1) % p value from RSA primes p and q. rFValues can't be <= 1)rCrL)rMrJrrr rsa_crt_iqmpsrO)private_exponentrMr cCs$|dks|dkrtd||dS)zg Compute the CRT private_exponent % (p - 1) value from the RSA private_exponent (d) and p. rFrNrB)rPrMrrr rsa_crt_dmp1srQ)rPrJr cCs$|dks|dkrtd||dS)zg Compute the CRT private_exponent % (q - 1) value from the RSA private_exponent (d) and q. rFrNrB)rPrJrrr rsa_crt_dmq1srR)rDrMrJr cCsL|dks|dks|dkr td|d|dt|d|d}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. rFrN)rCrrL)rDrMrJZlambda_nrrrrsa_recover_private_exponents"rSiztuple[int, int])nrDdr c Cs&|dks|dkrtddtd|||kr4td||d}|}|ddkrZ|d}qDd}d}|s|tkrtd|d}|d7}|}||krbt|||} | dkr| |dkrt| d|dkrt| d|} d}qb|d9}qqb|std t|| \} } | dks tt| | fdd \} } | | 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. rFzd, e can't be <= 1zn, d, e don't matchrFTz2Unable to compute factors p and q from exponent d.)reverse) rCpow_MAX_RECOVERY_ATTEMPTSrandomZrandintrrGAssertionErrorsorted) rTrDrUZktottZspottedZtriesrHkZcandrMrJrKrrrrsa_recover_prime_factorss6     $ r`)N)$Z __future__rr*r[typingZmathrZ"cryptography.hazmat.bindings._rustrr>Zcryptography.hazmat.primitivesrrZ*cryptography.hazmat.primitives._asymmetricrZ)cryptography.hazmat.primitives.asymmetricrZ asym_utilsABCMetar ZRSAPrivateKeyWithSerializationregisterr?rZRSAPublicKeyWithSerializationrr0r@r=rLrOrQrRrSrZr`rrrrs4     7B