U ςdg- @sXddlmZddlZddlZddlmZddlmZmZddl m Z ddl m Z Gdddejd ZeZGd d d ejd ZeZd0d d d ddddZd d ddddZd d d d d d d d dd ddZd d ddddZd d d dddZd d d ddd Zd d d d!d"d#Zd d d d$d%d&Zd'Zd d d d(d)d*d+ZGd,d-d-ZGd.d/d/ZdS)1) annotationsN)gcd)_serializationhashes)AsymmetricPadding)utilsc@seZdZejddddddZeejdddd Zejd dd d Zejddd ddddZ ejddddZ ejdddddddZ dS) RSAPrivateKeybytesr) ciphertextpaddingreturncCsdS)z3 Decrypts the provided ciphertext. N)selfr r r r j/var/www/html/myproject/myenv/lib/python3.8/site-packages/cryptography/hazmat/primitives/asymmetric/rsa.pydecryptszRSAPrivateKey.decryptintr cCsdSz7 The bit length of the public modulus. Nr rr r rkey_sizeszRSAPrivateKey.key_size RSAPublicKeycCsdS)zD The RSAPublicKey associated with this private key. Nr rr r r public_keyszRSAPrivateKey.public_key8typing.Union[asym_utils.Prehashed, hashes.HashAlgorithm])datar algorithmr cCsdS)z! Signs the data. Nr )rrr rr r rsign$szRSAPrivateKey.signRSAPrivateNumberscCsdS)z/ Returns an RSAPrivateNumbers. Nr rr r rprivate_numbers/szRSAPrivateKey.private_numbers_serialization.Encodingz_serialization.PrivateFormatz)_serialization.KeySerializationEncryption)encodingformatencryption_algorithmr cCsdSz6 Returns the key serialized as bytes. Nr )rrr r!r r r private_bytes5szRSAPrivateKey.private_bytesN) __name__ __module__ __qualname__abcabstractmethodrpropertyrrrrr#r r r rrs 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 r r rencryptEszRSAPublicKey.encryptrrcCsdSrr rr r rrKszRSAPublicKey.key_sizeRSAPublicNumberscCsdS)z- Returns an RSAPublicNumbers Nr rr r rpublic_numbersRszRSAPublicKey.public_numbersrz_serialization.PublicFormat)rr r cCsdSr"r )rrr r r r public_bytesXszRSAPublicKey.public_bytesrNone) signaturerr rr cCsdS)z5 Verifies the signature of the data. Nr )rr1rr rr r rverifybszRSAPublicKey.verifyz%typing.Optional[hashes.HashAlgorithm])r1r rr cCsdS)z@ Recovers the original data from the signature. Nr )rr1r rr r rrecover_data_from_signaturensz(RSAPublicKey.recover_data_from_signatureobjectboolotherr cCsdS)z" Checks equality. Nr rr7r r r__eq__yszRSAPublicKey.__eq__N) r$r%r&r'r(r,r)rr.r/r2r3r9r r r rrDs   rr typing.Any)public_exponentrbackendr cCs"ddlm}t|||||SNr)r<),cryptography.hazmat.backends.openssl.backendr<_verify_rsa_parametersZgenerate_rsa_private_key)r;rr<osslr r rgenerate_private_keys  rAr0)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 512-bits. ValueError)r;rr r rr?s r?) pqprivate_exponentdmp1dmq1iqmpr;modulusr cCs|dkrtd||kr td||kr0td||kr@td||krPtd||kr`td||krptd|dks||krtd |d @d krtd |d @d krtd |d @d krtd|||krtddS)NrBzmodulus 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.rC)rErFrGrHrIrJr;rKr r r_check_private_key_componentss0     rM)enr cCs@|dkrtd|dks ||kr(td|d@dkr= 3.ze must be >= 3 and < n.rLrze must be odd.rCrNrOr r r_check_public_key_componentss  rQ)rNmr c CsRd\}}||}}|dkrJt||\}}|||}||||f\}}}}q||S)zO Modular Multiplicative Inverse. Returns x such that: (x*e) mod m == 1 )rLrr)divmod) rNrRx1Zx2abrFrZxnr r r_modinvs  rX)rErFr cCs t||S)zF Compute the CRT (q ** -1) % p value from RSA primes p and q. )rX)rErFr r r rsa_crt_iqmpsrY)rGrEr cCs ||dS)zg Compute the CRT private_exponent % (p - 1) value from the RSA private_exponent (d) and p. rLr )rGrEr r r rsa_crt_dmp1srZ)rGrFr cCs ||dS)zg Compute the CRT private_exponent % (q - 1) value from the RSA private_exponent (d) and q. rLr )rGrFr r r rsa_crt_dmq1sr[iztyping.Tuple[int, int])rOrNdr c Cs||d}|}|ddkr&|d}qd}d}|s|tkr|}||krt|||}|dkr||dkrt|d|dkrt|d|} d}q|d9}q>|d7}q.|stdt|| \} } | dkstt| | 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. rLrFTz2Unable to compute factors p and q from exponent d.)reverse)_MAX_RECOVERY_ATTEMPTSpowrrDrSAssertionErrorsorted) rOrNr\ZktottZspottedrUkcandrErFrWr r rrsa_recover_prime_factorss,     $   rfc@seZdZddddddddddZeddddZeddd d Zeddd d Zeddd dZeddddZ eddddZ eddddZ d$ddddddddZ dddd d!Z ddd"d#ZdS)%rrr-)rErFr\rHrIrJr.cCst|trr<Zload_rsa_private_numbers)rr<rrr@r r r private_keyls  zRSAPrivateNumbers.private_keyr4r6cCsbt|tstS|j|jko`|j|jko`|j|jko`|j|jko`|j|jko`|j|jko`|j |j kSrq) rgrNotImplementedrErFr\rHrIrJr.r8r r rr9zs        zRSAPrivateNumbers.__eq__cCs$t|j|j|j|j|j|j|jfSrq)hashrErFr\rHrIrJr.rr r r__hash__szRSAPrivateNumbers.__hash__)N)r$r%r&rpr)rErFr\rHrIrJr.rsr9rvr r r rr*s*%rc@s~eZdZdddddZeddddZedddd Zdd d d ddZddddZdddddZ ddddZ d S)r-rrPcCs,t|trt|tstd||_||_dS)Nz,RSAPublicNumbers arguments must be integers.)rgrrh_e_n)rrNrOr r rrpszRSAPublicNumbers.__init__rcCs|jSrq)rwrr r rrNszRSAPublicNumbers.ecCs|jSrq)rxrr r rrOszRSAPublicNumbers.nNr:r)r<r cCsddlm}||Sr=)r>r<Zload_rsa_public_numbers)rr<r@r r rrs zRSAPublicNumbers.public_keystrcCs d|S)Nz$)r rr r r__repr__szRSAPublicNumbers.__repr__r4r5r6cCs&t|tstS|j|jko$|j|jkSrq)rgr-rtrNrOr8r r rr9s zRSAPublicNumbers.__eq__cCst|j|jfSrq)rurNrOrr r rrvszRSAPublicNumbers.__hash__)N) r$r%r&rpr)rNrOrrzr9rvr r r rr-sr-)N) __future__rr'typingmathrZcryptography.hazmat.primitivesrrZ*cryptography.hazmat.primitives._asymmetricrZ)cryptography.hazmat.primitives.asymmetricrZ asym_utilsABCMetarZRSAPrivateKeyWithSerializationrZRSAPublicKeyWithSerializationrAr?rMrQrXrYrZr[r_rfrr-r r r rs.    1<  /   -l