a  `)@sRddlmZmZmZddlZzddlmZWneyJddlmZYn0ddl Z ddl m Z ddl m Z mZddlmZddlmZe ejGdd d eZe ejGd d d eZe ejGd d d eZeZd%ddZddZddZddZddZddZddZ ddZ!dZ"dd Z#Gd!d"d"eZ$Gd#d$d$eZ%dS)&)absolute_importdivisionprint_functionN)gcd)utils)UnsupportedAlgorithm_Reasons) _get_backend) RSABackendc@sReZdZejddZejddZejddZejddZ ejd d Z d S) RSAPrivateKeycCsdS)zN Returns an AsymmetricSignatureContext used for signing data. N)selfpadding algorithmr r O/usr/lib/python3/dist-packages/cryptography/hazmat/primitives/asymmetric/rsa.pysignerszRSAPrivateKey.signercCsdS)z3 Decrypts the provided ciphertext. Nr )r Z ciphertextrr r rdecryptszRSAPrivateKey.decryptcCsdSz7 The bit length of the public modulus. Nr r r r rkey_size%szRSAPrivateKey.key_sizecCsdS)zD The RSAPublicKey associated with this private key. Nr rr r r public_key+szRSAPrivateKey.public_keycCsdS)z! Signs the data. Nr )r datarrr r rsign1szRSAPrivateKey.signN) __name__ __module__ __qualname__abcabstractmethodrrabstractpropertyrrrr r r rr s    r c@s(eZdZejddZejddZdS)RSAPrivateKeyWithSerializationcCsdS)z/ Returns an RSAPrivateNumbers. Nr rr r rprivate_numbers:sz.RSAPrivateKeyWithSerialization.private_numberscCsdSz6 Returns the key serialized as bytes. Nr )r encodingformatZencryption_algorithmr r r private_bytes@sz,RSAPrivateKeyWithSerialization.private_bytesN)rrrrrr r$r r r rr8s rc@sneZdZejddZejddZejddZejddZ ejd d Z ejd d Z ejd dZ dS) RSAPublicKeycCsdS)zY Returns an AsymmetricVerificationContext used for verifying signatures. Nr r signaturerrr r rverifierIszRSAPublicKey.verifiercCsdS)z/ Encrypts the given plaintext. Nr )r Z plaintextrr r rencryptOszRSAPublicKey.encryptcCsdSrr rr r rrUszRSAPublicKey.key_sizecCsdS)z- Returns an RSAPublicNumbers Nr rr r rpublic_numbers[szRSAPublicKey.public_numberscCsdSr!r )r r"r#r r r public_bytesaszRSAPublicKey.public_bytescCsdS)z5 Verifies the signature of the data. Nr )r r'rrrr r rverifygszRSAPublicKey.verifycCsdS)z@ Recovers the original data from the signature. Nr r&r r rrecover_data_from_signaturemsz(RSAPublicKey.recover_data_from_signatureN) rrrrrr(r)rrr*r+r,r-r r r rr%Gs      r%cCs4t|}t|tstdtjt|||||S)Nz-Backend object does not implement RSABackend.)r isinstancer rrZBACKEND_MISSING_INTERFACE_verify_rsa_parametersZgenerate_rsa_private_key)public_exponentrbackendr r rgenerate_private_keyws  r2cCs$|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 512-bits. ValueError)r0rr r rr/s r/cCs|dkrtd||kr td||kr0td||kr@td||krPtd||kr`td||krptd|dks||krtd |d @d krtd |d @d krtd |d @d krtd|||krtddS)Nr3zmodulus 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.r4)pqprivate_exponentdmp1dmq1iqmpr0modulusr r r_check_private_key_componentss0    r>cCs@|dkrtd|dks ||kr(td|d@dkr= 3.ze must be >= 3 and < n.r6rze must be odd.r4)enr r r_check_public_key_componentss  rAc CsRd\}}||}}|dkrJt||\}}|||}||||f\}}}}q||S)zO Modular Multiplicative Inverse. Returns x such that: (x*e) mod m == 1 )r6rr)divmod) r?mZx1Zx2abr8rZxnr r r_modinvs  rGcCs t||S)zF Compute the CRT (q ** -1) % p value from RSA primes p and q. )rG)r7r8r r r rsa_crt_iqmpsrHcCs ||dS)zg Compute the CRT private_exponent % (p - 1) value from the RSA private_exponent (d) and p. r6r )r9r7r r r rsa_crt_dmp1srIcCs ||dS)zg Compute the CRT private_exponent % (q - 1) value from the RSA private_exponent (d) and q. r6r )r9r8r r r rsa_crt_dmq1srJic 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. r6rFTz2Unable to compute factors p and q from exponent d.)reverse)_MAX_RECOVERY_ATTEMPTSpowrr5rBsorted) r@r?dZktottZspottedrDkZcandr7r8rFr r rrsa_recover_prime_factorss,     $   rSc@s|eZdZddZedZedZedZedZ edZ edZ ed Z dd d Z d dZddZddZd S)RSAPrivateNumberscCst|tjrHt|tjrHt|tjrHt|tjrHt|tjrHt|tjsPtdt|tsbtd||_||_||_||_||_ ||_ ||_ dS)NzNRSAPrivateNumbers p, q, d, dmp1, dmq1, iqmp arguments must all be an integers.zFRSAPrivateNumbers public_numbers must be an RSAPublicNumbers instance.) r.six integer_types TypeErrorRSAPublicNumbers_p_q_d_dmp1_dmq1_iqmp_public_numbers)r r7r8rPr:r;r<r*r r r__init__s4       zRSAPrivateNumbers.__init__rYrZr[r\r]r^r_NcCst|}||SN)r Zload_rsa_private_numbersr r1r r r private_key;szRSAPrivateNumbers.private_keycCsbt|tstS|j|jko`|j|jko`|j|jko`|j|jko`|j|jko`|j|jko`|j |j kSra) r.rTNotImplementedr7r8rPr:r;r<r*r otherr r r__eq__?s        zRSAPrivateNumbers.__eq__cCs ||k Srar rer r r__ne__MszRSAPrivateNumbers.__ne__cCs$t|j|j|j|j|j|j|jfSra)hashr7r8rPr:r;r<r*rr r r__hash__PszRSAPrivateNumbers.__hash__)N)rrrr`rread_only_propertyr7r8rPr:r;r<r*rcrgrhrjr r r rrTs        rTc@sReZdZddZedZedZdddZdd Z d d Z d d Z ddZ dS)rXcCs0t|tjrt|tjs td||_||_dS)Nz,RSAPublicNumbers arguments must be integers.)r.rUrVrW_e_n)r r?r@r r rr`_s zRSAPublicNumbers.__init__rlrmNcCst|}||Sra)r Zload_rsa_public_numbersrbr r rrkszRSAPublicNumbers.public_keycCs d|S)Nz$)r#rr r r__repr__oszRSAPublicNumbers.__repr__cCs&t|tstS|j|jko$|j|jkSra)r.rXrdr?r@rer r rrgrs zRSAPublicNumbers.__eq__cCs ||k Srar rer r rrhxszRSAPublicNumbers.__ne__cCst|j|jfSra)rir?r@rr r rrj{szRSAPublicNumbers.__hash__)N) rrrr`rrkr?r@rrnrgrhrjr r r rrX^s   rX)N)&Z __future__rrrrZmathr ImportErrorZ fractionsrUZ cryptographyrZcryptography.exceptionsrrZcryptography.hazmat.backendsr Z'cryptography.hazmat.backends.interfacesr Z add_metaclassABCMetaobjectr rr%ZRSAPublicKeyWithSerializationr2r/r>rArGrHrIrJrMrSrTrXr r r rs:       ,  (   +H