a cf@sXddlmZddlZddlZddlmZddlmZddl m Z m Z ddl m Z ddlmZGdd d ejd ZeZeejjGd d d ejd ZeZeejjejjZejjZd*d d dd dddZd d ddddZd d d dddZd d d dddZd d d dddZd d d dd d!Zd 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 dS) RSAPrivateKeybytesr) ciphertextpaddingreturncCsdS)z3 Decrypts the provided ciphertext. N)selfr r rrj/home/httpd/docs/test/DocsMgr/lib/python3.9/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_keyszRSAPrivateKey.public_key+asym_utils.Prehashed | hashes.HashAlgorithm)datar algorithmr cCsdS)z! Signs the data. Nr)rrr rrrrsign%szRSAPrivateKey.signRSAPrivateNumberscCsdS)z/ Returns an RSAPrivateNumbers. Nrrrrrprivate_numbers0szRSAPrivateKey.private_numbers_serialization.Encodingz_serialization.PrivateFormatz)_serialization.KeySerializationEncryption)encodingformatencryption_algorithmr cCsdSz6 Returns the key serialized as bytes. Nr)rr r!r"rrr private_bytes6szRSAPrivateKey.private_bytesN) __name__ __module__ __qualname__abcabstractmethodrpropertyrrrrr$rrrrr s r ) metaclassc@seZdZejddddddZeejdddd Zejd dd d Zejd dddddZ ejddddddddZ ejdddddddZ ejdddddZ d S)!rr r) plaintextr r cCsdS)z/ Encrypts the given plaintext. Nr)rr,r rrrencryptGszRSAPublicKey.encryptrrcCsdSrrrrrrrMszRSAPublicKey.key_sizeRSAPublicNumberscCsdS)z- Returns an RSAPublicNumbers Nrrrrrpublic_numbersTszRSAPublicKey.public_numbersrz_serialization.PublicFormat)r r!r cCsdSr#r)rr r!rrr public_bytesZszRSAPublicKey.public_bytesrNone) signaturerr rr cCsdS)z5 Verifies the signature of the data. Nr)rr2rr rrrrverifydszRSAPublicKey.verifyzhashes.HashAlgorithm | None)r2r rr cCsdS)z@ Recovers the original data from the signature. Nr)rr2r rrrrrecover_data_from_signaturepsz(RSAPublicKey.recover_data_from_signatureobjectbool)otherr cCsdS)z" Checks equality. Nr)rr7rrr__eq__{szRSAPublicKey.__eq__N) r%r&r'r(r)r-r*rr/r0r3r4r8rrrrrFs   rrz typing.Any)public_exponentrbackendr cCst||tj||S)N)_verify_rsa_parameters rust_opensslrsagenerate_private_key)r9rr:rrrr>s r>r1)r9rr cCs$|dvrtd|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)r9rrrrr;s r;)emr c CsRd\}}||}}|dkrJt||\}}|||}||||f\}}}}q||S)zO Modular Multiplicative Inverse. Returns x such that: (x*e) mod m == 1 )rr)divmod) rArBx1Zx2abqrZxnrrr_modinvs  rJ)prHr cCs t||S)zF Compute the CRT (q ** -1) % p value from RSA primes p and q. )rJ)rKrHrrr rsa_crt_iqmpsrL)private_exponentrKr cCs ||dS)zg Compute the CRT private_exponent % (p - 1) value from the RSA private_exponent (d) and p. rCr)rMrKrrr rsa_crt_dmp1srN)rMrHr cCs ||dS)zg Compute the CRT private_exponent % (q - 1) value from the RSA private_exponent (d) and q. rCr)rMrHrrr rsa_crt_dmq1srO)rArKrHr cCs,|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. rC)rrJ)rArKrHZlambda_nrrrrsa_recover_private_exponents"rPiztuple[int, int])nrAdr c Cs||d}|}|ddkr&|d}qd}d}|s|tkr|}||krt|||}|dkr||dkrt|d|dkrt|d|} d}q|d9}q>|d7}q.|stdt|| \} } | dksJt| | 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. rCrFTz2Unable to compute factors p and q from exponent d.)reverse)_MAX_RECOVERY_ATTEMPTSpowrr@rDsorted) rQrArRZktottZspottedrFkcandrKrHrIrrrrsa_recover_prime_factorss,     $   r[)N)# __future__rr(typingmathrZ"cryptography.hazmat.bindings._rustrr<Zcryptography.hazmat.primitivesrrZ*cryptography.hazmat.primitives._asymmetricrZ)cryptography.hazmat.primitives.asymmetricrZ asym_utilsABCMetar ZRSAPrivateKeyWithSerializationregisterr=rZRSAPublicKeyWithSerializationrr.r>r;rJrLrNrOrPrUr[rrrrs2     1<