o ˷e:,@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 d/var/www/ideatree/venv/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 HashAlgorithmrrrEncoding PrivateFormatKeySerializationEncryptionrr 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 r1r 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 r6rr rr r rverifyarzRSAPublicKey.verifycCr )z@ Recovers the original data from the signature. Nr )r r6r rr r rrecover_data_from_signaturemrz(RSAPublicKey.recover_data_from_signaturer r3)r r!r"r#r$r%rr2r&r'rr4rr- PublicFormatr5r(r)r*r+rr,r7Optionalr8r r r rrDsJ      rpublic_exponentrbackendr cCs"ddlm}t|||||SNr)r=),cryptography.hazmat.backends.openssl.backendr=_verify_rsa_parametersgenerate_rsa_private_key)r<rr=osslr r rgenerate_private_key|s   rCcCs$|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)r<rr 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)NrDzmodulus 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.rE)rGrHrIrJrKrLr<rMr r r_check_private_key_componentss2     rOencCs@|dkrtd|dks||krtd|d@dkrtddS)NrDzn must be >= 3.ze must be >= 3 and < n.rNrze must be odd.rE)rPrQr r r_check_public_key_componentss rRmc CsXd\}}||}}|dkr(t||\}}|||}||||f\}}}}|dks ||S)zO Modular Multiplicative Inverse. Returns x such that: (x*e) mod m == 1 )rNrr)divmod) rPrSx1x2abrHrxnr r r_modinvs  r[cCs t||S)zF Compute the CRT (q ** -1) % p value from RSA primes p and q. )r[)rGrHr r r rsa_crt_iqmps r\cC ||dS)zg Compute the CRT private_exponent % (p - 1) value from the RSA private_exponent (d) and p. rNr )rIrGr r r rsa_crt_dmp1 r^cCr])zg Compute the CRT private_exponent % (q - 1) value from the RSA private_exponent (d) and q. rNr )rIrHr r r rsa_crt_dmq1r_r`idc 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. rNrFTz2Unable to compute factors p and q from exponent d.)reverse)_MAX_RECOVERY_ATTEMPTSpowrrFrTsorted) rQrPraktottspottedrWkcandrGrHrYr r rrsa_recover_prime_factorss2     $  rlc@seZdZdededededededdfd d Zed efd d Zed efddZed efddZed efddZ ed efddZ ed efddZ ed#ddZ d$de jd efddZded efdd Zd efd!d"ZdS)%rrGrHrarJrKrLr4r3cCst|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' TypeErrorr3_p_q_d_dmp1_dmq1_iqmp_public_numbers)r rGrHrarJrKrLr4r r r__init__$s4   zRSAPrivateNumbers.__init__r cC|jSN)rorr r rrGIzRSAPrivateNumbers.pcCrwrx)rprr r rrHMryzRSAPrivateNumbers.qcCrwrx)rqrr r rraQryzRSAPrivateNumbers.dcCrwrx)rrrr r rrJUryzRSAPrivateNumbers.dmp1cCrwrx)rsrr r rrKYryzRSAPrivateNumbers.dmq1cCrwrx)rtrr r rrL]ryzRSAPrivateNumbers.iqmpcCrwrx)rurr r rr4aryz RSAPrivateNumbers.public_numbersNr=cCddlm}||Sr>)r?r=load_rsa_private_numbersr r=rBr r r private_keye  zRSAPrivateNumbers.private_keyothercCsbt|tstS|j|jko0|j|jko0|j|jko0|j|jko0|j|jko0|j|jko0|j |j kSrx) rmrNotImplementedrGrHrarJrKrLr4r rr r r__eq__ls        zRSAPrivateNumbers.__eq__cCs$t|j|j|j|j|j|j|jfSrx)hashrGrHrarJrKrLr4rr r r__hash__zszRSAPrivateNumbers.__hash__r9rx)r r!r"r'rvpropertyrGrHrarJrKrLr4r(Anyrr}objectboolrrr r r rr#sB % rc@seZdZdedefddZedefddZedefdd Zdd ej de fd d Z de fddZ dedefddZdefddZd S)r3rPrQcCs,t|tr t|tstd||_||_dS)Nz,RSAPublicNumbers arguments must be integers.)rmr'rn_e_n)r rPrQr r rrvs zRSAPublicNumbers.__init__r cCrwrx)rrr r rrPryzRSAPublicNumbers.ecCrwrx)rrr r rrQryzRSAPublicNumbers.nNr=cCrzr>)r?r=load_rsa_public_numbersr|r r rrr~zRSAPublicNumbers.public_keycCs d|S)Nz$)rrr r r__repr__s zRSAPublicNumbers.__repr__rcCs&t|tstS|j|jko|j|jkSrx)rmr3rrPrQrr r rrs zRSAPublicNumbers.__eq__cCst|j|jfSrx)rrPrQrr r rrszRSAPublicNumbers.__hash__rx)r r!r"r'rvrrPrQr(rrrstrrrrrrr r r rr3sr3rx) r#r(mathrcryptography.hazmat.primitivesrr*cryptography.hazmat.primitives._asymmetricr)cryptography.hazmat.primitives.asymmetricrr*ABCMetarRSAPrivateKeyWithSerializationrRSAPublicKeyWithSerializationr'rrCr@rOrRr[r\r^r`rdTuplerlrr3r r r rsr   05    /     -e