Website : rimsha.abasa.com
backdoor
Home
Console
Upload
information
Create File
Create Folder
About
Tools
:
/
lib
/
python3
/
dist-packages
/
rsa
/
__pycache__
/
Filename :
key.cpython-310.pyc
back
Copy
o ��a�k � @ s d Z ddlZddlZddlZddlZddlZddlZddlZddl Zddl Ze� e �Z dZG dd� d�ZG dd� de�ZG dd � d e�Zejjd fd ed ejegef d edejeef fdd�Zdedededejeef fdd�Zdededejeef fdd�Zd efd ed ejegef d ededejeeeef f dd�Zd defd ed edededejeef f d d �Z g d �Z e d k�rddl Z z%e d �D ] Z e �!� \Z"Z#e"r� ne d! dkr�e s�e dkr�e$d"e � q�W n e%y� e$d#� Y dS w e$d$� dS dS )%aj RSA key generation code. Create new keys with the newkeys() function. It will give you a PublicKey and a PrivateKey object. Loading and saving keys requires the pyasn1 module. This module is imported as late as possible, such that other functionality will remain working in absence of pyasn1. .. note:: Storing public and private keys via the `pickle` module is possible. However, it is insecure to load a key from an untrusted source. The pickle module is not secure against erroneous or maliciously constructed data. Never unpickle data received from an untrusted or unauthenticated source. � Ni c @ s" e Zd ZdZdZdededdfdd�Zed edd fd d ��Z ed edd fd d ��Z defdd�Z defdd�Z ed'd ede dd fdd��Zede deje ejf dejfdd��Zd'de defdd�Zd edejeef fd d �Zd ed edefd!d"�Zdefd#d$�Zdejeef fd%d&�ZdS )(� AbstractKeyz0Abstract superclass for private and public keys.)�n�e�blindfac�blindfac_inverse�mutexr r �returnNc C s& || _ || _d | _| _t�� | _d S )N���)r r r r � threading�Lockr )�selfr r � r �)/usr/lib/python3/dist-packages/rsa/key.py�__init__7 s zAbstractKey.__init__�keyfilec C � dS )z�Loads a key in PKCS#1 PEM format, implement in a subclass. :param keyfile: contents of a PEM-encoded file that contains the public key. :type keyfile: bytes :return: the loaded key :rtype: AbstractKey Nr ��clsr r r r �_load_pkcs1_pemB � zAbstractKey._load_pkcs1_pemc C r )z�Loads a key in PKCS#1 PEM format, implement in a subclass. :param keyfile: contents of a DER-encoded file that contains the public key. :type keyfile: bytes :return: the loaded key :rtype: AbstractKey Nr r r r r �_load_pkcs1_derN r zAbstractKey._load_pkcs1_derc C r )z�Saves the key in PKCS#1 PEM format, implement in a subclass. :returns: the PEM-encoded key. :rtype: bytes Nr �r r r r �_save_pkcs1_pemZ r zAbstractKey._save_pkcs1_pemc C r )z�Saves the key in PKCS#1 DER format, implement in a subclass. :returns: the DER-encoded key. :rtype: bytes Nr r r r r �_save_pkcs1_dera r zAbstractKey._save_pkcs1_der�PEM�formatc C s" | j | jd�}| �||�}||�S )aN Loads a key in PKCS#1 DER or PEM format. :param keyfile: contents of a DER- or PEM-encoded file that contains the key. :type keyfile: bytes :param format: the format of the file to load; 'PEM' or 'DER' :type format: str :return: the loaded key :rtype: AbstractKey �r �DER)r r �_assert_format_exists)r r r �methods�methodr r r � load_pkcs1h s � zAbstractKey.load_pkcs1� file_formatr c C sH z|| W S t y# } zd�t|�� ��}td| |f �|�d}~ww )z9Checks whether the given file format exists in 'methods'.z, z%Unsupported format: %r, try one of %sN)�KeyError�join�sorted�keys� ValueError)r" r �ex�formatsr r r r ~ s ����z!AbstractKey._assert_format_existsc C s | j | jd�}| �||�}|� S )z�Saves the key in PKCS#1 DER or PEM format. :param format: the format to save; 'PEM' or 'DER' :type format: str :returns: the DER- or PEM-encoded key. :rtype: bytes r )r r r )r r r r r r r � save_pkcs1� s � zAbstractKey.save_pkcs1�messagec C s. | � � \}}|t|| j| j� | j }||fS )a� Performs blinding on the message. :param message: the message, as integer, to blind. :param r: the random number to blind with. :return: tuple (the blinded message, the inverse of the used blinding factor) The blinding is such that message = unblind(decrypt(blind(encrypt(message))). See https://en.wikipedia.org/wiki/Blinding_%28cryptography%29 )�_update_blinding_factor�powr r )r r+ r r �blindedr r r �blind� s zAbstractKey.blindr. r c C s || | j S )a� Performs blinding on the message using random number 'blindfac_inverse'. :param blinded: the blinded message, as integer, to unblind. :param blindfac: the factor to unblind with. :return: the original message. The blinding is such that message = unblind(decrypt(blind(encrypt(message))). See https://en.wikipedia.org/wiki/Blinding_%28cryptography%29 )r )r r. r r r r �unblind� s zAbstractKey.unblindc C s@ t d�D ]}tj�| jd �}tj�| j|�r| S qtd��)Ni� � z unable to find blinding factor)�range�rsa�randnum�randintr �prime�are_relatively_prime� RuntimeError)r �_�blind_rr r r �_initial_blinding_factor� s �z$AbstractKey._initial_blinding_factorc C s� | j �5 | jdk r| �� | _tj�| j| j�| _nt| jd| j�| _t| jd| j�| _| j| jfW d � S 1 s;w Y dS )a� Update blinding factors. Computing a blinding factor is expensive, so instead this function does this once, then updates the blinding factor as per section 9 of 'A Timing Attack against RSA with the Chinese Remainder Theorem' by Werner Schindler. See https://tls.mbed.org/public/WSchindler-RSA_Timing_Attack.pdf :return: the new blinding factor and its inverse. r � N) r r r; r3 �common�inverser r r- r r r r r, � s $�z#AbstractKey._update_blinding_factor)r )�__name__� __module__� __qualname__�__doc__� __slots__�intr � classmethod�bytesr r r r �strr! � staticmethod�typing�Mapping�Callabler r* �Tupler/ r0 r; r, r r r r r 2 s2 �� � r c @ s e Zd ZdZdZdedefdd�Zdefdd�Zde j eef fd d �Z d e j eef dd fd d�Z de j defdd�Zde j defdd�Zdefdd�Zededd fdd��Zdefdd�Zededd fdd ��Zdefd d �Zededd fd d ��Zededd fd!d"��Zd S )#� PublicKeya� Represents a public RSA key. This key is also known as the 'encryption key'. It contains the 'n' and 'e' values. Supports attributes as well as dictionary-like access. Attribute access is faster, though. >>> PublicKey(5, 3) PublicKey(5, 3) >>> key = PublicKey(5, 3) >>> key.n 5 >>> key['n'] 5 >>> key.e 3 >>> key['e'] 3 �r r �keyr c C � t | |�S �N��getattr�r rO r r r � __getitem__� � zPublicKey.__getitem__c C s d| j | jf S )NzPublicKey(%i, %i)rN r r r r �__repr__� � zPublicKey.__repr__c C s | j | jfS �z&Returns the key as tuple for pickling.rN r r r r � __getstate__� s zPublicKey.__getstate__�stateNc C s" |\| _ | _t�| | j | j� dS �zSets the key from tuple.N)r r r r �r r[ r r r � __setstate__� s zPublicKey.__setstate__�otherc C s2 |d u rdS t |t�s dS | j|jko| j|jkS �NF)� isinstancerM r r �r r_ r r r �__eq__ s zPublicKey.__eq__c C � | |k S rQ r rb r r r �__ne__ rV zPublicKey.__ne__c C s t | j| jf�S rQ )�hashr r r r r r �__hash__ rX zPublicKey.__hash__r c C sH ddl m} ddlm} |j||� d�\}}| t|d �t|d �d�S )a� Loads a key in PKCS#1 DER format. :param keyfile: contents of a DER-encoded file that contains the public key. :return: a PublicKey object First let's construct a DER encoded key: >>> import base64 >>> b64der = 'MAwCBQCNGmYtAgMBAAE=' >>> der = base64.standard_b64decode(b64der) This loads the file: >>> PublicKey._load_pkcs1_der(der) PublicKey(2367317549, 65537) r ��decoder�� AsnPubKey��asn1Spec�modulus�publicExponentrN )�pyasn1.codec.derri �rsa.asn1rk �decoderD )r r ri rk �privr9 r r r r s zPublicKey._load_pkcs1_derc C sD ddl m} ddlm} |� }|�d| j� |�d| j� |�|�S )zxSaves the public key in PKCS#1 DER format. :returns: the DER-encoded public key. :rtype: bytes r ��encoderrj rn ro )rp ru rq rk �setComponentByNamer r �encode)r ru rk �asn_keyr r r r , s zPublicKey._save_pkcs1_derc C � t j�|d�}| �|�S )aO Loads a PKCS#1 PEM-encoded public key file. The contents of the file before the "-----BEGIN RSA PUBLIC KEY-----" and after the "-----END RSA PUBLIC KEY-----" lines is ignored. :param keyfile: contents of a PEM-encoded file that contains the public key. :return: a PublicKey object �RSA PUBLIC KEY�r3 �pem�load_pemr �r r �derr r r r = s zPublicKey._load_pkcs1_pemc C � | � � }tj�|d�S )z�Saves a PKCS#1 PEM-encoded public key file. :return: contents of a PEM-encoded file that contains the public key. :rtype: bytes rz �r r3 r| �save_pem�r r r r r r L � zPublicKey._save_pkcs1_pemc C ry )a� Loads a PKCS#1.5 PEM-encoded public key file from OpenSSL. These files can be recognised in that they start with BEGIN PUBLIC KEY rather than BEGIN RSA PUBLIC KEY. The contents of the file before the "-----BEGIN PUBLIC KEY-----" and after the "-----END PUBLIC KEY-----" lines is ignored. :param keyfile: contents of a PEM-encoded file that contains the public key, from OpenSSL. :type keyfile: bytes :return: a PublicKey object z PUBLIC KEY)r3 r| r} �load_pkcs1_openssl_derr~ r r r �load_pkcs1_openssl_pemV s z PublicKey.load_pkcs1_openssl_pemc C sl ddl m} ddlm} ddlm} |j||� d�\}}|d d |�d�kr+td ��| � |d d d � �S ) z�Loads a PKCS#1 DER-encoded public key file from OpenSSL. :param keyfile: contents of a DER-encoded file that contains the public key, from OpenSSL. :return: a PublicKey object r )� OpenSSLPubKeyrh )�univrl �header�oidz1.2.840.113549.1.1.1z7This is not a DER-encoded OpenSSL-compatible public keyrO r1 N) rq r� rp ri � pyasn1.typer� rr �ObjectIdentifier� TypeErrorr )r r r� ri r� �keyinfor9 r r r r� i s z PublicKey.load_pkcs1_openssl_der)r? r@ rA rB rC rG rD rU rW rI rL rZ r^ �Any�boolrc re rg rE rF r r r r r� r� r r r r rM � s( rM c @ sD e Zd ZdZdZdedededededd f d d �Zd edefd d�Zdefdd�Z de j eeeeeeeef fdd�Z de j eeeeeeeef dd fdd�Z de jdefdd�Zde jdefdd�Zdefdd �Zd edefd d �Zd edefd!d"�Zed#edd fd$d%��Zdefd&d'�Zed#edd fd(d)��Zdefd*d+�Zd S ),� PrivateKeya Represents a private RSA key. This key is also known as the 'decryption key'. It contains the 'n', 'e', 'd', 'p', 'q' and other values. Supports attributes as well as dictionary-like access. Attribute access is faster, though. >>> PrivateKey(3247, 65537, 833, 191, 17) PrivateKey(3247, 65537, 833, 191, 17) exp1, exp2 and coef will be calculated: >>> pk = PrivateKey(3727264081, 65537, 3349121513, 65063, 57287) >>> pk.exp1 55063 >>> pk.exp2 10095 >>> pk.coef 50797 �r r �d�p�q�exp1�exp2�coefr r r� r� r� r Nc C sX t �| ||� || _|| _|| _t||d �| _t||d �| _tj � ||�| _ d S )Nr1 ) r r r� r� r� rD r� r� r3 r= r> r� )r r r r� r� r� r r r r � s zPrivateKey.__init__rO c C rP rQ rR rT r r r rU � rV zPrivateKey.__getitem__c C s d| j | j| j| j| jf S )Nz PrivateKey(%i, %i, %i, %i, %i))r r r� r� r� r r r r rW � s �zPrivateKey.__repr__c C s$ | j | j| j| j| j| j| j| jfS rY r� r r r r rZ � s $zPrivateKey.__getstate__r[ c C s: |\| _ | _| _| _| _| _| _| _t� | | j | j� dS r\ ) r r r� r� r� r� r� r� r r r] r r r r^ � s $zPrivateKey.__setstate__r_ c C sz |d u rdS t |t�s dS | j|jko<| j|jko<| j|jko<| j|jko<| j|jko<| j|jko<| j|jko<| j |j kS r` ) ra r� r r r� r� r� r� r� r� rb r r r rc � s& � � � � � � �zPrivateKey.__eq__c C rd rQ r rb r r r re � rV zPrivateKey.__ne__c C s( t | j| j| j| j| j| j| j| jf�S rQ ) rf r r r� r� r� r� r� r� r r r r rg � s (zPrivateKey.__hash__� encryptedc C s\ | � |�\}}t|| j| j�}t|| j| j�}|| | j | j }|| j| }| �||�S )z�Decrypts the message using blinding to prevent side-channel attacks. :param encrypted: the encrypted message :type encrypted: int :returns: the decrypted message :rtype: int )r/ r- r� r� r� r� r� r0 )r r� r. r �s1�s2�h� decryptedr r r �blinded_decrypt� s zPrivateKey.blinded_decryptr+ c C s. | � |�\}}tj�|| j| j�}| �||�S )z�Encrypts the message using blinding to prevent side-channel attacks. :param message: the message to encrypt :type message: int :returns: the encrypted message :rtype: int )r/ r3 �core� encrypt_intr� r r0 )r r+ r. r r� r r r �blinded_encrypt� s zPrivateKey.blinded_encryptr c C s� ddl m} |�|�\}}|d dkrtd|d ��tt|dd� �}| |� }tt|dd� �\}}} |j|j|jf||| fkrGt � dt � |S )a4 Loads a key in PKCS#1 DER format. :param keyfile: contents of a DER-encoded file that contains the private key. :type keyfile: bytes :return: a PrivateKey object First let's construct a DER encoded key: >>> import base64 >>> b64der = 'MC4CAQACBQDeKYlRAgMBAAECBQDHn4npAgMA/icCAwDfxwIDANcXAgInbwIDAMZt' >>> der = base64.standard_b64decode(b64der) This loads the file: >>> PrivateKey._load_pkcs1_der(der) PrivateKey(3727264081, 65537, 3349121513, 65063, 57287) r rh z)Unable to read this file, version %s != 0r1 � � zYou have provided a malformed keyfile. Either the exponents or the coefficient are incorrect. Using the correct values instead.) rp ri rr r' �maprD r� r� r� �warnings�warn� UserWarning) r r ri rs r9 �as_intsrO r� r� r� r r r r � s �zPrivateKey._load_pkcs1_derc s� ddl m�m� ddlm} G � �fdd�d�j�}|� }|�dd� |�d| j� |�d| j� |�d | j � |�d | j � |�d | j � |�d | j � |�d | j � |�d| j� |�|�S )zzSaves the private key in PKCS#1 DER format. :returns: the DER-encoded private key. :rtype: bytes r )r� � namedtypert c s� e Zd Z� �� �d��� �� �d��� �� �d��� �� �d��� �� �d��� �� �d��� �� �d��� �� �d��� �� �d ��� �� Zd S ) z.PrivateKey._save_pkcs1_der.<locals>.AsnPrivKey�versionrn ro �privateExponent�prime1�prime2� exponent1� exponent2� coefficientN)r? r@ rA � NamedTypes� NamedType�Integer� componentTyper �r� r� r r � AsnPrivKey; s �r� r� rn ro r� r� r� r� r� r� )r� r� r� rp ru �Sequencerv r r r� r� r� r� r� r� rw )r ru r� rx r r� r r 1 s zPrivateKey._save_pkcs1_derc C ry )aq Loads a PKCS#1 PEM-encoded private key file. The contents of the file before the "-----BEGIN RSA PRIVATE KEY-----" and after the "-----END RSA PRIVATE KEY-----" lines is ignored. :param keyfile: contents of a PEM-encoded file that contains the private key. :type keyfile: bytes :return: a PrivateKey object � RSA PRIVATE KEYr{ r~ r r r r V s zPrivateKey._load_pkcs1_pemc C r� )z�Saves a PKCS#1 PEM-encoded private key file. :return: contents of a PEM-encoded file that contains the private key. :rtype: bytes r� r� r� r r r r f r� zPrivateKey._save_pkcs1_pem)r? r@ rA rB rC rD r rG rU rW rI rL rZ r^ r� r� rc re rg r� r� rE rF r r r r r r r r r� ~ s& " $ (:%r� T�nbits� getprime_func�accurater c s� | d �| d }| | }| | }t �d| � ||�}t �d| � ||�}dtdtdtf� �fdd � }d } |||�sL| r@||�}n||�}| } |||�r9t||�t||�fS ) a& Returns a tuple of two different primes of nbits bits each. The resulting p * q has exactly 2 * nbits bits, and the returned p and q will not be equal. :param nbits: the number of bits in each of p and q. :param getprime_func: the getprime function, defaults to :py:func:`rsa.prime.getprime`. *Introduced in Python-RSA 3.1* :param accurate: whether to enable accurate mode or not. :returns: (p, q), where p > q >>> (p, q) = find_p_q(128) >>> from rsa import common >>> common.bit_size(p * q) 256 When not in accurate mode, the number of bits can be slightly less >>> (p, q) = find_p_q(128, accurate=False) >>> from rsa import common >>> common.bit_size(p * q) <= 256 True >>> common.bit_size(p * q) > 240 True r< � zfind_p_q(%i): Finding pzfind_p_q(%i): Finding qr� r� r c s, | |krdS � s dS t j�| | �}�|kS )z�Returns True iff p and q are acceptable: - p and q differ - (p * q) has the right nr of bits (when accurate=True) FT)r3 r= �bit_size)r� r� � found_size�r� � total_bitsr r � is_acceptable� s z find_p_q.<locals>.is_acceptableF)�log�debugrD r� �max�min) r� r� r� �shift�pbits�qbitsr� r� r� �change_pr r� r �find_p_qq s" # � r� r� r� �exponentc C s� | d |d }z t j�||�}W n t jjy1 } zt jj|||jd|||jf d�|�d}~ww || | dkrCtd|||f ��||fS )a� Calculates an encryption and a decryption key given p, q and an exponent, and returns them as a tuple (e, d) :param p: the first large prime :param q: the second large prime :param exponent: the exponent for the key; only change this if you know what you're doing, as the exponent influences how difficult your private key can be cracked. A very common choice for e is 65537. :type exponent: int r1 z;e (%d) and phi_n (%d) are not relatively prime (divider=%i))�msgNz6e (%d) and d (%d) are not mult. inv. modulo phi_n (%d))r3 r= r> �NotRelativePrimeErrorr� r' )r� r� r� �phi_nr� r( r r r � calculate_keys_custom_exponent� s* ����� �r� c C s t | |t�S )z�Calculates an encryption and a decryption key given p and q, and returns them as a tuple (e, d) :param p: the first large prime :param q: the second large prime :return: tuple (e, d) with the encryption and decryption exponents. )r� �DEFAULT_EXPONENT)r� r� r r r �calculate_keys� s r� c C sN t | d ||�\}}z t|||d�\}}W n ty Y nw q||||fS )aW Generate RSA keys of nbits bits. Returns (p, q, e, d). Note: this can take a long time, depending on the key size. :param nbits: the total number of bits in ``p`` and ``q``. Both ``p`` and ``q`` will use ``nbits/2`` bits. :param getprime_func: either :py:func:`rsa.prime.getprime` or a function with similar signature. :param exponent: the exponent for the key; only change this if you know what you're doing, as the exponent influences how difficult your private key can be cracked. A very common choice for e is 65537. :type exponent: int Tr< )r� )r� r� r' )r� r� r� r� r� r� r r� r r r �gen_keys� s �� r� r1 �poolsizec s� | dk rt d���dk rt d� ���dkr)ddlm� dtdtf� �fd d � }ntjj}t| |||d �\}}}}|| } t| |�t| ||||�fS ) a� Generates public and private keys, and returns them as (pub, priv). The public key is also known as the 'encryption key', and is a :py:class:`rsa.PublicKey` object. The private key is also known as the 'decryption key' and is a :py:class:`rsa.PrivateKey` object. :param nbits: the number of bits required to store ``n = p*q``. :param accurate: when True, ``n`` will have exactly the number of bits you asked for. However, this makes key generation much slower. When False, `n`` may have slightly less bits. :param poolsize: the number of processes to use to generate the prime numbers. If set to a number > 1, a parallel algorithm will be used. This requires Python 2.6 or newer. :param exponent: the exponent for the key; only change this if you know what you're doing, as the exponent influences how difficult your private key can be cracked. A very common choice for e is 65537. :type exponent: int :returns: a tuple (:py:class:`rsa.PublicKey`, :py:class:`rsa.PrivateKey`) The ``poolsize`` parameter was added in *Python-RSA 3.1* and requires Python 2.6 or newer. r� z Key too smallr1 z Pool size (%i) should be >= 1r )�parallelr� r c s � j | �d�S )N)r� )�getprime)r� �r� r� r r r� < s z newkeys.<locals>.getprime_func)r� r� ) r' r3 r� rD r6 r� r� rM r� ) r� r� r� r� r� r� r� r r� r r r� r �newkeys s r� )rM r� r� �__main__�d � z%i times�Abortedz Doctests done)&rB �loggingr rI r� � rsa.primer3 �rsa.pem� rsa.common� rsa.randnum�rsa.core� getLoggerr? r� r� r rM r� r6 r� rD rK r� rL r� r� r� r� r� �__all__�doctestr2 �count�testmod�failures�tests�print�KeyboardInterruptr r r r �<module> s� ( & v���� �$R "����� �#����� �8 � � �