0x1998 - MANAGER
Düzenlenen Dosya: rsa.cpython-36.pyc
3 l�_�( � @ sT d dl mZmZmZ d dlZyd dlmZ W n ek rL d dlmZ Y nX d dl Z d dl m Z d dl m Z mZ d dlmZ d dlmZ e jej�G dd � d e��Ze jej�G d d � d e��Ze jej�G d d � d e��ZeZd%dd�Zdd� Zdd� Z dd� Z dd� Z dd� Z dd� Z d d � Z!d Z"d d � Z#G d!d"� d"e�Z$G d#d$� d$e�Z%dS )&� )�absolute_import�division�print_functionN)�gcd)�utils)�UnsupportedAlgorithm�_Reasons)� _get_backend)� RSABackendc @ sR e Zd Zejdd� �Zejdd� �Zejdd� �Zejdd� �Z ejd d � �Z d S ) � RSAPrivateKeyc C s dS )zN Returns an AsymmetricSignatureContext used for signing data. N� )�self�padding� algorithmr r �/usr/lib64/python3.6/rsa.py�signer s zRSAPrivateKey.signerc C s dS )z3 Decrypts the provided ciphertext. Nr )r Z ciphertextr r r r �decrypt s zRSAPrivateKey.decryptc C s dS )z7 The bit length of the public modulus. Nr )r r r r �key_size% s zRSAPrivateKey.key_sizec C s dS )zD The RSAPublicKey associated with this private key. Nr )r r r r � public_key+ s zRSAPrivateKey.public_keyc C s dS )z! Signs the data. Nr )r �datar r r r r �sign1 s zRSAPrivateKey.signN) �__name__� __module__� __qualname__�abc�abstractmethodr r �abstractpropertyr r r r r r r r s r c @ s( e Zd Zejdd� �Zejdd� �ZdS )� RSAPrivateKeyWithSerializationc C s dS )z/ Returns an RSAPrivateNumbers. Nr )r r r r �private_numbers: s z.RSAPrivateKeyWithSerialization.private_numbersc C s dS )z6 Returns the key serialized as bytes. Nr )r �encoding�formatZencryption_algorithmr r r � private_bytes@ s z,RSAPrivateKeyWithSerialization.private_bytesN)r r r r r r r! r r r r r 8 s r c @ s` e Zd Zejdd� �Zejdd� �Zejdd� �Zejdd� �Z ejd d � �Z ejd d � �Z d S )� RSAPublicKeyc C s dS )zY Returns an AsymmetricVerificationContext used for verifying signatures. Nr )r � signaturer r r r r �verifierI s zRSAPublicKey.verifierc C s dS )z/ Encrypts the given plaintext. Nr )r Z plaintextr r r r �encryptO s zRSAPublicKey.encryptc C s dS )z7 The bit length of the public modulus. Nr )r r r r r U s zRSAPublicKey.key_sizec C s dS )z- Returns an RSAPublicNumbers Nr )r r r r �public_numbers[ s zRSAPublicKey.public_numbersc C s dS )z6 Returns the key serialized as bytes. Nr )r r r r r r � public_bytesa s zRSAPublicKey.public_bytesc C s dS )z5 Verifies the signature of the data. Nr )r r# r r r r r r �verifyg s zRSAPublicKey.verifyN) r r r r r r$ r% r r r& r' r( r r r r r" G s r" c C s4 t |�}t|t�s tdtj��t| |� |j| |�S )Nz-Backend object does not implement RSABackend.)r � isinstancer r r ZBACKEND_MISSING_INTERFACE�_verify_rsa_parametersZgenerate_rsa_private_key)�public_exponentr �backendr r r �generate_private_keyq s r- c C s$ | dkrt d��|dk r t d��d S )N� � zopublic_exponent must be either 3 (for legacy compatibility) or 65537. Almost everyone should choose 65537 here!i z#key_size must be at least 512-bits.)r. r/ )� ValueError)r+ r r r r r* } s r* c C s� |dk rt d��| |kr t d��||kr0t d��||kr@t d��||krPt d��||kr`t d��||krpt d��|dk s�||kr�t d ��|d @ d kr�t d ��|d @ d kr�t d ��|d @ d kr�t d��| | |kr�t d��d S )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.� r z public_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+ �modulusr r r � _check_private_key_components� s0 r9 c C s@ |dk rt d��| dk s | |kr(t d��| d@ dkr<t d��d S )Nr. zn must be >= 3.ze must be >= 3 and < n.r1 r ze must be odd.)r0 )�e�nr r r � _check_public_key_components� s r< c C sV d\}}| | }}x:|dkrLt ||�\}}||| }||||f\}}}}qW || S )zO Modular Multiplicative Inverse. Returns x such that: (x*e) mod m == 1 r1 r )r1 r )�divmod) r: �mZx1Zx2�a�br3 �rZxnr r r �_modinv� s rB c C s t || �S )zF Compute the CRT (q ** -1) % p value from RSA primes p and q. )rB )r2 r3 r r r � rsa_crt_iqmp� s rC c C s | |d S )zg Compute the CRT private_exponent % (p - 1) value from the RSA private_exponent (d) and p. r1 r )r4 r2 r r r � rsa_crt_dmp1� s rD c C s | |d S )zg Compute the CRT private_exponent % (q - 1) value from the RSA private_exponent (d) and q. r1 r )r4 r3 r r r � rsa_crt_dmq1� s rE i� c C s� || d }|}x|d dkr(|d }qW d}d}xx| r�|t k r�|}xX||k r�t||| �}|dkr�|| d kr�t|d| �dkr�t|d | �} d}P |d9 }qHW |d7 }q4W |s�td��t| | �\} } | dks�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 � r FTz2Unable to compute factors p and q from exponent d.)�reverse)�_MAX_RECOVERY_ATTEMPTS�powr r0 r= �AssertionError�sorted) r; r: �dZktot�tZspottedr? �kZcandr2 r3 rA r r r �rsa_recover_prime_factors� s, $ rO c @ s| e Zd Zdd� Zejd�Zejd�Zejd�Zejd�Z ejd�Z ejd�Z ejd �Z dd d �Z d d� Zdd� Zdd� Zd S )�RSAPrivateNumbersc C s� t |tj� sTt |tj� sTt |tj� sTt |tj� sTt |tj� sTt |tj� r\td��t |t�sntd��|| _|| _|| _|| _|| _ || _ || _ d S )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 r2 r3 rL r5 r6 r7 r& r r r �__init__ s$ zRSAPrivateNumbers.__init__rU rV rW rX rY rZ r[ Nc C s t |�}|j| �S )N)r Zload_rsa_private_numbers)r r, r r r � private_key5 s z RSAPrivateNumbers.private_keyc C sb t |t�stS | j|jko`| j|jko`| j|jko`| j|jko`| j|jko`| j|jko`| j |j kS )N) r) rP �NotImplementedr2 r3 rL r5 r6 r7 r& )r �otherr r r �__eq__9 s zRSAPrivateNumbers.__eq__c C s | |k S )Nr )r r_ r r r �__ne__G s zRSAPrivateNumbers.__ne__c C s$ t | j| j| j| j| j| j| jf�S )N)�hashr2 r3 rL r5 r6 r7 r& )r r r r �__hash__J s zRSAPrivateNumbers.__hash__)N)r r r r\ r �read_only_propertyr2 r3 rL r5 r6 r7 r& r] r` ra rc r r r r rP s rP c @ sR e Zd Zdd� Zejd�Zejd�Zddd�Zdd � Z d d � Z d d � Z dd� Z dS )rT c C s4 t |tj� s t |tj� r$td��|| _|| _d S )Nz,RSAPublicNumbers arguments must be integers.)r) rQ rR rS �_e�_n)r r: r; r r r r\ Y s zRSAPublicNumbers.__init__re rf Nc C s t |�}|j| �S )N)r Zload_rsa_public_numbers)r r, r r r r e s zRSAPublicNumbers.public_keyc C s dj | �S )Nz$<RSAPublicNumbers(e={0.e}, n={0.n})>)r )r r r r �__repr__i s zRSAPublicNumbers.__repr__c C s& t |t�stS | j|jko$| j|jkS )N)r) rT r^ r: r; )r r_ r r r r` l s zRSAPublicNumbers.__eq__c C s | |k S )Nr )r r_ r r r ra r s zRSAPublicNumbers.__ne__c C s t | j| jf�S )N)rb r: r; )r r r r rc u s zRSAPublicNumbers.__hash__)N) r r r r\ r rd r: r; r rg r` ra rc r r r r rT X s rT )N)&Z __future__r r r r Zmathr � ImportErrorZ fractionsrQ Z cryptographyr Zcryptography.exceptionsr r Z cryptography.hazmat.backendsr Z'cryptography.hazmat.backends.interfacesr Z add_metaclass�ABCMeta�objectr r r" Z RSAPublicKeyWithSerializationr- r* r9 r< rB rC rD rE rH rO rP rT r r r r �<module> s: & ( +H
geri dön