o c:,@sddlZddlZddlmZddlmZmZddlmZddl m Z Gdddej dZ e ZGd d d ej dZeZ d1d ed ed ejde fddZd ed eddfddZdedededededed ededdfddZdededdfddZded edefd!d"Zdededefd#d$Zdededefd%d&Zdededefd'd(Zd)Zdeded*edejeeffd+d,ZGd-d.d.ZGd/d0d0ZdS)2N)gcd)_serializationhashes)AsymmetricPadding)utilsc @seZdZejdededefddZejde fddZ ejdd d Z ejd eded e j ejejfdefd dZejdddZejdejdejdejdefddZdS) RSAPrivateKey ciphertextpaddingreturncCdS)z3 Decrypts the provided ciphertext. N)selfrr r r Qusr/lib/python3.10/site-packages/cryptography/hazmat/primitives/asymmetric/rsa.pydecryptzRSAPrivateKey.decryptcCr z7 The bit length of the public modulus. Nr r r r rkey_sizerzRSAPrivateKey.key_size RSAPublicKeycCr )zD The RSAPublicKey associated with this private key. Nr rr r r public_keyrzRSAPrivateKey.public_keydata algorithmcCr )z! Signs the data. Nr )r rr rr r rsign$rzRSAPrivateKey.signRSAPrivateNumberscCr )z/ Returns an RSAPrivateNumbers. Nr rr r rprivate_numbers/rzRSAPrivateKey.private_numbersencodingformatencryption_algorithmcCr z6 Returns the key serialized as bytes. Nr )r rrrr r r private_bytes5rzRSAPrivateKey.private_bytesN)r r)r r)__name__ __module__ __qualname__abcabstractmethodbytesrrabstractpropertyintrrtypingUnion asym_utils Prehashedr HashAlgorithmrrrEncodingZ PrivateFormatZKeySerializationEncryptionrr r r rrs:   r) metaclassc @seZdZejdededefddZejde fddZ ejdd d Z ejd e j d e jdefd dZejdedededejejejfddf ddZejdededejejdefddZdS)r plaintextr r cCr )z/ Encrypts the given plaintext. Nr )r r/r r r rencryptErzRSAPublicKey.encryptcCr rr rr r rrKrzRSAPublicKey.key_sizeRSAPublicNumberscCr )z- Returns an RSAPublicNumbers Nr rr r rpublic_numbersQrzRSAPublicKey.public_numbersrrcCr rr )r rrr r r public_bytesWrzRSAPublicKey.public_bytes signaturerrNcCr )z5 Verifies the signature of the data. Nr )r r4rr rr r rverifyarzRSAPublicKey.verifycCr )z@ Recovers the original data from the signature. Nr )r r4r rr r rrecover_data_from_signaturemrz(RSAPublicKey.recover_data_from_signaturer r1)r r!r"r#r$r%rr0r&r'rr2rr-Z PublicFormatr3r(r)r*r+rr,r5Optionalr6r r r rrDsJ      rpublic_exponentrbackendr cCs"ddlm}t|||||SNr)r:),cryptography.hazmat.backends.openssl.backendr:_verify_rsa_parametersZgenerate_rsa_private_key)r9rr:osslr r rgenerate_private_key|s   r?cCs$|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 512-bits. ValueError)r9rr r rr=sr=pqprivate_exponentdmp1dmq1iqmpmoduluscCs|dkrtd||krtd||krtd||kr td||kr(td||kr0td||kr8td|dks@||krDtd |d @d krNtd |d @d krXtd |d @d krbtd|||krltddS)Nr@zmodulus must be >= 3.zp must be < modulus.zq must be < modulus.zdmp1 must be < modulus.zdmq1 must be < modulus.ziqmp must be < modulus.z#private_exponent must be < modulus.z+public_exponent must be >= 3 and < modulus.rzpublic_exponent must be odd.zdmp1 must be odd.zdmq1 must be odd.zp*q must equal modulus.rA)rCrDrErFrGrHr9rIr r r_check_private_key_componentss2     rKencCs@|dkrtd|dks||krtd|d@dkrtddS)Nr@zn must be >= 3.ze must be >= 3 and < n.rJrze must be odd.rA)rLrMr r r_check_public_key_componentss rNmc CsXd\}}||}}|dkr(t||\}}|||}||||f\}}}}|dks ||S)zO Modular Multiplicative Inverse. Returns x such that: (x*e) mod m == 1 )rJrr)divmod) rLrOx1Zx2abrDrZxnr r r_modinvs  rUcCs t||S)zF Compute the CRT (q ** -1) % p value from RSA primes p and q. )rU)rCrDr r r rsa_crt_iqmps rVcC ||dS)zg Compute the CRT private_exponent % (p - 1) value from the RSA private_exponent (d) and p. rJr )rErCr r r rsa_crt_dmp1 rXcCrW)zg Compute the CRT private_exponent % (q - 1) value from the RSA private_exponent (d) and q. rJr )rErDr r r rsa_crt_dmq1rYrZidc Cs||d}|}|ddkr|d}|ddksd}d}|s\|tkr\|}||krRt|||}|dkrJ||dkrJt|d|dkrJt|d|} d}n|d9}||ks(|d7}|s\|tks"|sbtdt|| \} } | dksoJt| | 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. rJrFTz2Unable to compute factors p and q from exponent d.)reverse)_MAX_RECOVERY_ATTEMPTSpowrrBrPsorted) rMrLr[ZktottZspottedrRkcandrCrDrTr r rrsa_recover_prime_factorss2     $  rdc@seZdZdededededededdfd d Zed efd d Zed efddZed efddZed efddZ ed efddZ ed efddZ ed#ddZ d$de jd efddZded efdd Zd efd!d"ZdS)%rrCrDr[rFrGrHr2r1cCst|trt|trt|trt|trt|trt|ts"tdt|ts+td||_||_||_||_||_||_ ||_ dS)NzNRSAPrivateNumbers p, q, d, dmp1, dmq1, iqmp arguments must all be an integers.zFRSAPrivateNumbers public_numbers must be an RSAPublicNumbers instance.) isinstancer' TypeErrorr1_p_q_d_dmp1_dmq1_iqmp_public_numbers)r rCrDr[rFrGrHr2r r r__init__$s4   zRSAPrivateNumbers.__init__r cC|jSN)rgrr r rrCIzRSAPrivateNumbers.pcCrorp)rhrr r rrDMrqzRSAPrivateNumbers.qcCrorp)rirr r rr[QrqzRSAPrivateNumbers.dcCrorp)rjrr r rrFUrqzRSAPrivateNumbers.dmp1cCrorp)rkrr r rrGYrqzRSAPrivateNumbers.dmq1cCrorp)rlrr r rrH]rqzRSAPrivateNumbers.iqmpcCrorp)rmrr r rr2arqz RSAPrivateNumbers.public_numbersNr:cCddlm}||Sr;)r<r:Zload_rsa_private_numbersr r:r>r r r private_keye  zRSAPrivateNumbers.private_keyothercCsbt|tstS|j|jko0|j|jko0|j|jko0|j|jko0|j|jko0|j|jko0|j |j kSrp) rerNotImplementedrCrDr[rFrGrHr2r rvr r r__eq__ls        zRSAPrivateNumbers.__eq__cCs$t|j|j|j|j|j|j|jfSrp)hashrCrDr[rFrGrHr2rr r r__hash__zszRSAPrivateNumbers.__hash__r7rp)r r!r"r'rnpropertyrCrDr[rFrGrHr2r(Anyrrtobjectboolryr{r r r rr#sB % rc@seZdZdedefddZedefddZedefdd Zdd ej de fd d Z de fddZ dedefddZdefddZd S)r1rLrMcCs,t|tr t|tstd||_||_dS)Nz,RSAPublicNumbers arguments must be integers.)rer'rf_e_n)r rLrMr r rrns zRSAPublicNumbers.__init__r cCrorp)rrr r rrLrqzRSAPublicNumbers.ecCrorp)rrr r rrMrqzRSAPublicNumbers.nNr:cCrrr;)r<r:Zload_rsa_public_numbersrsr r rrruzRSAPublicNumbers.public_keycCs d|S)Nz$)rrr r r__repr__s zRSAPublicNumbers.__repr__rvcCs&t|tstS|j|jko|j|jkSrp)rer1rwrLrMrxr r rrys zRSAPublicNumbers.__eq__cCst|j|jfSrp)rzrLrMrr r rr{szRSAPublicNumbers.__hash__rp)r r!r"r'rnr|rLrMr(r}rrstrrr~rryr{r r r rr1sr1rp) r#r(mathrZcryptography.hazmat.primitivesrrZ*cryptography.hazmat.primitives._asymmetricrZ)cryptography.hazmat.primitives.asymmetricrr*ABCMetarZRSAPrivateKeyWithSerializationrZRSAPublicKeyWithSerializationr'r}r?r=rKrNrUrVrXrZr^Tuplerdrr1r r r rsr   05    /     -e