U j!@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 ejdddddZ d S)! RSAPrivateKeybytesr) ciphertextpaddingreturncCsdS)z3 Decrypts the provided ciphertext. N)selfr r rrQ/tmp/pip-unpacked-wheel-cr19813o/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_keyzEasym_utils.Prehashed | hashes.HashAlgorithm | asym_utils.NoDigestInfo)datar algorithmr cCsdS)z! Signs the data. Nr)rrr rrrrsign&s zRSAPrivateKey.signRSAPrivateNumberscCsdS)z/ Returns an RSAPrivateNumbers. Nrrrrrprivate_numbers3szRSAPrivateKey.private_numbers_serialization.Encodingz_serialization.PrivateFormatz)_serialization.KeySerializationEncryption)encodingformatencryption_algorithmr cCsdSz6 Returns the key serialized as bytes. Nr)rrr r!rrr private_bytes9szRSAPrivateKey.private_bytescCsdSz! Returns a copy. Nrrrrr__copy__DszRSAPrivateKey.__copy__dictmemor cCsdSz& Returns a deep copy. Nrrr(rrr __deepcopy__JszRSAPrivateKey.__deepcopy__N)__name__ __module__ __qualname__abcabstractmethodrpropertyrrrrr#r%r+rrrrr s"  r ) metaclassc@seZdZejddddddZeejdddd Zejd dd d Zejd dddddZ ejddddddddZ ejdddddddZ ejdddddZ ejddd d!Z ejd"dd#d$d%Zd&S)'rr r) plaintextr r cCsdS)z/ Encrypts the given plaintext. Nr)rr3r rrrencryptVszRSAPublicKey.encryptrrcCsdSrrrrrrr\szRSAPublicKey.key_sizeRSAPublicNumberscCsdS)z- Returns an RSAPublicNumbers Nrrrrrpublic_numberscszRSAPublicKey.public_numbersrz_serialization.PublicFormat)rr r cCsdSr"r)rrr rrr public_bytesiszRSAPublicKey.public_bytesz+asym_utils.Prehashed | hashes.HashAlgorithmNone) signaturerr rr cCsdS)z5 Verifies the signature of the data. Nr)rr9rr rrrrverifysszRSAPublicKey.verifyz5hashes.HashAlgorithm | asym_utils.NoDigestInfo | None)r9r rr cCsdS)z@ Recovers the original data from the signature. Nr)rr9r rrrrrecover_data_from_signaturesz(RSAPublicKey.recover_data_from_signatureobjectbool)otherr cCsdS)z" Checks equality. Nr)rr>rrr__eq__szRSAPublicKey.__eq__cCsdSr$rrrrrr%szRSAPublicKey.__copy__r&r'cCsdSr)rr*rrrr+szRSAPublicKey.__deepcopy__N)r,r-r.r/r0r4r1rr6r7r:r;r?r%r+rrrrrUs&   rrz typing.Any)public_exponentrbackendr cCst||tj||S)N)_verify_rsa_parameters rust_opensslrsagenerate_private_key)r@rrArrrrEs rEr8)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@rrrrrBs rB)emr c CsRd\}}||}}|dkrJt||\}}|||}||||f\}}}}q||S)zO Modular Multiplicative Inverse. Returns x such that: (x*e) mod m == 1 )rr)divmod) rIrJx1Zx2abqrZxnrrr_modinvs  rR)prPr cCs"|dks|dkrtdt||S)zF Compute the CRT (q ** -1) % p value from RSA primes p and q. rKValues can't be <= 1)rHrR)rSrPrrr rsa_crt_iqmpsrU)private_exponentrSr cCs$|dks|dkrtd||dS)zg Compute the CRT private_exponent % (p - 1) value from the RSA private_exponent (d) and p. rKrTrG)rVrSrrr rsa_crt_dmp1srW)rVrPr cCs$|dks|dkrtd||dS)zg Compute the CRT private_exponent % (q - 1) value from the RSA private_exponent (d) and q. rKrTrG)rVrPrrr rsa_crt_dmq1srX)rIrSrPr 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. rKrT)rHrrR)rIrSrPZlambda_nrrrrsa_recover_private_exponents"rYiztuple[int, int])nrIdr 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. rKzd, e can't be <= 1zn, d, e don't matchrFTz2Unable to compute factors p and q from exponent d.)reverse) rHpow_MAX_RECOVERY_ATTEMPTSrandomrandintrrLAssertionErrorsorted) rZrIr[ZktottZspottedtriesrNkZcandrSrPrQrrrrsa_recover_prime_factorss6     $ rh)N)$ __future__rr/ratypingmathrZ"cryptography.hazmat.bindings._rustrrCZcryptography.hazmat.primitivesrrZ*cryptography.hazmat.primitives._asymmetricrZ)cryptography.hazmat.primitives.asymmetricrZ asym_utilsABCMetar ZRSAPrivateKeyWithSerializationregisterrDrZRSAPublicKeyWithSerializationrr5rErBrRrUrWrXrYr`rhrrrrs4     ?H