£Á°èZ¨Ä…–K§‚«“ô4“ÒÙ´dîfUÙÃÅ WKbyÊ¦•êŽ…È®FÒ¿ÊÎóCozá¬S@6{Í:›œêZÌ:Š•_%:¢¾¾~;‘Ã~èŠ©ÊÇí`ÔÑ©úë™µ'5I¿fš×WO%ø9¾«¾DK|€ùÍD”Ýs]nHÕ¶ê×Ó¼ãžªéUWŸÈË%DÒÕ¬ï‘]/Åcx ‰ï2ß]ä6G[]S£ÔÏ¯rs{úëóµmÒï#UQxo·õÞCe]"±/aÙ&Eã4ú9Jé_ÞåëdãöKë)AÞ ¯¹ægƒÛowÐø^d™ý½ßB7áyMä9ÜÖUã !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! 3 l�_�(� @sTddlmZmZmZddlZyddlmZWn ek rLddlmZYnXddl Z ddl mZddlm Z mZddlmZddlmZe jej�Gdd �d e��Ze jej�Gd d�de��Ze jej�Gdd �d e��ZeZd%dd�Zdd�Zdd�Zdd�Zdd�Zdd�Zdd�Z dd�Z!dZ"dd �Z#Gd!d"�d"e�Z$Gd#d$�d$e�Z%dS)&�)�absolute_import�division�print_functionN)�gcd)�utils)�UnsupportedAlgorithm�_Reasons)�_get_backend)� RSABackendc@sReZdZejdd��Zejdd��Zejdd��Zejdd��Z ejd d ��Z dS)� RSAPrivateKeycCsdS)zN Returns an AsymmetricSignatureContext used for signing data. N�)�self�padding� algorithmrr�/usr/lib64/python3.6/rsa.py�signerszRSAPrivateKey.signercCsdS)z3 Decrypts the provided ciphertext. Nr)r Z ciphertextrrrr�decryptszRSAPrivateKey.decryptcCsdS)z7 The bit length of the public modulus. Nr)r rrr�key_size%szRSAPrivateKey.key_sizecCsdS)zD The RSAPublicKey associated with this private key. Nr)r rrr� public_key+szRSAPrivateKey.public_keycCsdS)z! Signs the data. Nr)r �datarrrrr�sign1szRSAPrivateKey.signN)�__name__� __module__�__qualname__�abc�abstractmethodrr�abstractpropertyrrrrrrrrs rc@s(eZdZejdd��Zejdd��ZdS)�RSAPrivateKeyWithSerializationcCsdS)z/ Returns an RSAPrivateNumbers. Nr)r rrr�private_numbers:sz.RSAPrivateKeyWithSerialization.private_numberscCsdS)z6 Returns the key serialized as bytes. Nr)r �encoding�formatZencryption_algorithmrrr� private_bytes@sz,RSAPrivateKeyWithSerialization.private_bytesN)rrrrrrr!rrrrr8src@s`eZdZejdd��Zejdd��Zejdd��Zejdd��Z ejd d ��Z ejdd��Zd S)�RSAPublicKeycCsdS)zY Returns an AsymmetricVerificationContext used for verifying signatures. Nr)r � signaturerrrrr�verifierIszRSAPublicKey.verifiercCsdS)z/ Encrypts the given plaintext. Nr)r Z plaintextrrrr�encryptOszRSAPublicKey.encryptcCsdS)z7 The bit length of the public modulus. Nr)r rrrrUszRSAPublicKey.key_sizecCsdS)z- Returns an RSAPublicNumbers Nr)r rrr�public_numbers[szRSAPublicKey.public_numberscCsdS)z6 Returns the key serialized as bytes. Nr)r rr rrr�public_bytesaszRSAPublicKey.public_bytescCsdS)z5 Verifies the signature of the data. Nr)r r#rrrrrr�verifygszRSAPublicKey.verifyN)rrrrrr$r%rrr&r'r(rrrrr"Gsr"cCs4t|�}t|t�stdtj��t||�|j||�S)Nz-Backend object does not implement RSABackend.)r � isinstancer rrZBACKEND_MISSING_INTERFACE�_verify_rsa_parametersZgenerate_rsa_private_key)�public_exponentr�backendrrr�generate_private_keyqs r-cCs$|dkrtd��|dkr td��dS)N��zopublic_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.)r.r/)� ValueError)r+rrrrr*}s r*cCs�|dkrtd��||kr td��||kr0td��||kr@td��||krPtd��||kr`td��||krptd��|dks�||kr�td ��|d @dkr�td��|d @dkr�td ��|d @dkr�td��|||kr�td��dS)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.)r0)�p�q�private_exponent�dmp1�dmq1�iqmpr+�modulusrrr�_check_private_key_components�s0r9cCs@|dkrtd��|dks ||kr(td��|d@dkr= 3.ze must be >= 3 and < n.r1rze must be odd.)r0)�e�nrrr�_check_public_key_components�sr<c CsVd\}}||}}x:|dkrLt||�\}}|||}||||f\}}}}qW||S)zO Modular Multiplicative Inverse. Returns x such that: (x*e) mod m == 1 r1r)r1r)�divmod) r:�mZx1Zx2�a�br3�rZxnrrr�_modinv�s rBcCs t||�S)zF Compute the CRT (q ** -1) % p value from RSA primes p and q. )rB)r2r3rrr�rsa_crt_iqmp�srCcCs||dS)zg Compute the CRT private_exponent % (p - 1) value from the RSA private_exponent (d) and p. r1r)r4r2rrr�rsa_crt_dmp1�srDcCs||dS)zg Compute the CRT private_exponent % (q - 1) value from the RSA private_exponent (d) and q. r1r)r4r3rrr�rsa_crt_dmq1�srEi�cCs�||d}|}x|ddkr(|d}qWd}d}xx|r�|tkr�|}xX||kr�t|||�}|dkr�||dkr�t|d|�dkr�t|d|�} d}P|d9}qHW|d7}q4W|s�td��t|| �\} }t| | 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. r1�rFTz2Unable to compute factors p and q from exponent d.)�reverse)�_MAX_RECOVERY_ATTEMPTS�powrr0r=�sorted)r;r:�dZktot�tZspottedr?�kZcandr2r3rArrr�rsa_recover_prime_factors�s* $rNc@s|eZdZdd�Zejd�Zejd�Zejd�Zejd�Z ejd�Z ejd�Zejd �Zddd�Z d d�Zdd�Zdd�Zd S)�RSAPrivateNumberscCs�t|tj�sTt|tj�sTt|tj�sTt|tj�sTt|tj�sTt|tj�r\td��t|t�sntd��||_||_||_||_||_ ||_ ||_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� TypeError�RSAPublicNumbers�_p�_q�_d�_dmp1�_dmq1�_iqmp�_public_numbers)r r2r3rKr5r6r7r&rrr�__init__s$ zRSAPrivateNumbers.__init__rTrUrVrWrXrYrZNcCst|�}|j|�S)N)r Zload_rsa_private_numbers)r r,rrr�private_key5szRSAPrivateNumbers.private_keycCsbt|t�stS|j|jko`|j|jko`|j|jko`|j|jko`|j|jko`|j|jko`|j |j kS)N) r)rO�NotImplementedr2r3rKr5r6r7r&)r �otherrrr�__eq__9s zRSAPrivateNumbers.__eq__cCs ||kS)Nr)r r^rrr�__ne__GszRSAPrivateNumbers.__ne__cCs$t|j|j|j|j|j|j|jf�S)N)�hashr2r3rKr5r6r7r&)r rrr�__hash__JszRSAPrivateNumbers.__hash__)N)rrrr[r�read_only_propertyr2r3rKr5r6r7r&r\r_r`rbrrrrrOs rOc@sReZdZdd�Zejd�Zejd�Zddd�Zdd �Z d d�Z dd �Zdd�ZdS)rScCs4t|tj�st|tj�r$td��||_||_dS)Nz,RSAPublicNumbers arguments must be integers.)r)rPrQrR�_e�_n)r r:r;rrrr[Ys zRSAPublicNumbers.__init__rdreNcCst|�}|j|�S)N)r Zload_rsa_public_numbers)r r,rrrreszRSAPublicNumbers.public_keycCs dj|�S)Nz$)r )r rrr�__repr__iszRSAPublicNumbers.__repr__cCs&t|t�stS|j|jko$|j|jkS)N)r)rSr]r:r;)r r^rrrr_ls zRSAPublicNumbers.__eq__cCs ||kS)Nr)r r^rrrr`rszRSAPublicNumbers.__ne__cCst|j|jf�S)N)rar:r;)r rrrrbuszRSAPublicNumbers.__hash__)N) rrrr[rrcr:r;rrfr_r`rbrrrrrSXs rS)N)&Z __future__rrrrZmathr�ImportErrorZ fractionsrPZcryptographyrZcryptography.exceptionsrrZcryptography.hazmat.backendsr Z'cryptography.hazmat.backends.interfacesr Z add_metaclass�ABCMeta�objectrrr"ZRSAPublicKeyWithSerializationr-r*r9r<rBrCrDrErHrNrOrSrrrr�s: & ( +H