o j,!@s ddlmZddlZddlZddlZddlmZmZddlm Z ddl m Z m Z ddlmZddlmZGdd d ejd ZeZee jjGd d d ejd ZeZee jje jjZe jjZ d-d.ddZd/ddZd0ddZd1ddZd2d!d"Z d3d#d$Z!d4d%d&Z"d'Z#d5d+d,Z$dS)6) annotationsN)gcdlcm)openssl)_serializationhashes)AsymmetricPadding)utilsc@seZdZejd%ddZeejd&d d Zejd'd d Zejd(ddZ ejd)ddZ ejd*ddZ ejd+ddZ ejd,d"d#Z d$S)- RSAPrivateKey ciphertextbytespaddingrreturncCdS)z3 Decrypts the provided ciphertext. N)selfr r rr/root/aizidognhua/tmp/workspace/projects/ec89d86c-575f-41c9-af57-ac45cbdbf775/venv/lib/python3.10/site-packages/cryptography/hazmat/primitives/asymmetric/rsa.pydecryptzRSAPrivateKey.decryptintcCrz7 The bit length of the public modulus. Nrrrrrkey_sizerzRSAPrivateKey.key_size RSAPublicKeycCr)zD The RSAPublicKey associated with this private key. Nrrrrr public_key rzRSAPrivateKey.public_keydata algorithmEasym_utils.Prehashed | hashes.HashAlgorithm | asym_utils.NoDigestInfocCr)z! Signs the data. Nr)rrr rrrrsign&rzRSAPrivateKey.signRSAPrivateNumberscCr)z/ Returns an RSAPrivateNumbers. Nrrrrrprivate_numbers3rzRSAPrivateKey.private_numbersencoding_serialization.Encodingformat_serialization.PrivateFormatencryption_algorithm)_serialization.KeySerializationEncryptioncCrz6 Returns the key serialized as bytes. Nr)rr!r#r%rrr private_bytes9rzRSAPrivateKey.private_bytescCrz! Returns a copy. Nrrrrr__copy__DrzRSAPrivateKey.__copy__memodictcCrz& Returns a deep copy. Nrrr+rrr __deepcopy__JrzRSAPrivateKey.__deepcopy__N)r r r rrr rrrr)rr r rrrrr )rr)r!r"r#r$r%r&rr )rr )r+r,rr )__name__ __module__ __qualname__abcabstractmethodrpropertyrrrr r(r*r/rrrrr s$      r ) metaclassc@seZdZejd*ddZeejd+d d Zejd,d d Zejd-ddZ ejd.ddZ ejd/ddZ ejd0d!d"Z ejd1d#d$Z ejd2d'd(Zd)S)3r plaintextr r rrcCr)z/ Encrypts the given plaintext. Nr)rr9r rrrencryptVrzRSAPublicKey.encryptrcCrrrrrrrr\rzRSAPublicKey.key_sizeRSAPublicNumberscCr)z- Returns an RSAPublicNumbers Nrrrrrpublic_numberscrzRSAPublicKey.public_numbersr!r"r#_serialization.PublicFormatcCrr'r)rr!r#rrr public_bytesirzRSAPublicKey.public_bytes signaturerr+asym_utils.Prehashed | hashes.HashAlgorithmNonecCr)z5 Verifies the signature of the data. Nr)rr?rr rrrrverifysrzRSAPublicKey.verify5hashes.HashAlgorithm | asym_utils.NoDigestInfo | NonecCr)z@ Recovers the original data from the signature. Nr)rr?r rrrrrecover_data_from_signaturerz(RSAPublicKey.recover_data_from_signatureotherobjectboolcCr)z" Checks equality. Nr)rrErrr__eq__rzRSAPublicKey.__eq__cCrr)rrrrrr*rzRSAPublicKey.__copy__r+r,cCrr-rr.rrrr/rzRSAPublicKey.__deepcopy__N)r9r r rrr r0)rr;)r!r"r#r=rr ) r?r rr r rrr@rrA)r?r r rrrCrr )rErFrrGr1)r+r,rr)r2r3r4r5r6r:r7rr<r>rBrDrHr*r/rrrrrUs(       rpublic_exponentrrbackend typing.AnyrcCst||tj||SN)_verify_rsa_parameters rust_opensslrsagenerate_private_key)rIrrJrrrrPs rPrAcCs$|dvrtd|dkrtddS)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)rIrrrrrMsrMemc CsXd\}}||}}|dkr(t||\}}|||}||||f\}}}}|dks ||S)zO Modular Multiplicative Inverse. Returns x such that: (x*e) mod m == 1 )rr)divmod) rTrUx1x2abqrxnrrr_modinvs  r_pr\cCs"|dks|dkr tdt||S)zF Compute the CRT (q ** -1) % p value from RSA primes p and q. rVValues can't be <= 1)rSr_)r`r\rrr rsa_crt_iqmps rbprivate_exponentcC$|dks|dkr td||dS)zg Compute the CRT private_exponent % (p - 1) value from the RSA private_exponent (d) and p. rVrarR)rcr`rrr rsa_crt_dmp1 recCrd)zg Compute the CRT private_exponent % (q - 1) value from the RSA private_exponent (d) and q. rVrarR)rcr\rrr rsa_crt_dmq1rfrgcCs8|dks |dks |dkrtdt|t|d|dS)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. rVra)rSr_r)rTr`r\rrrrsa_recover_private_exponentsrhindtuple[int, int]c Cs>|dks|dkr tddtd|||krtd||d}|}|ddkr2|d}|ddks(d}d}|s~|tkr~td|d}|d7}|}||krxt|||} | dkrp| |dkrpt| d|dkrpt| d|} d}n|d9}||ksN|s~|tks<|std t|| \} } | 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. rVzd, e can't be <= 1zn, d, e don't matchrFTz2Unable to compute factors p and q from exponent d.)reverse)rSpow_MAX_RECOVERY_ATTEMPTSrandomrandintrrWsorted) rirTrjktottspottedtriesrZkcandr`r\r]rrrrsa_recover_prime_factorss<     $  rzrL)rIrrrrJrKrr )rIrrrrrA)rTrrUrrr)r`rr\rrr)rcrr`rrr)rcrr\rrr)rTrr`rr\rrr)rirrTrrjrrrk)% __future__rr5rqtypingmathrr"cryptography.hazmat.bindings._rustrrNcryptography.hazmat.primitivesrr*cryptography.hazmat.primitives._asymmetricr)cryptography.hazmat.primitives.asymmetricr asym_utilsABCMetar RSAPrivateKeyWithSerializationregisterrOrRSAPublicKeyWithSerializationrr;rPrMr_rbrergrhrprzrrrrs6    ?H