a dbSY@sRdZddlZddlmZddlZddlZddlZddlZddl Ze e Z dZ GdddeZGdddeZGd d d eZejjd fd d ZddZddZd e fddZd de fddZgdZe dkrNddlZzPedD]BZe\ZZerq&ereddksedkre deqWne!yDe dYn 0e ddS)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. N)bic@sPeZdZdZdZddZedddZedd Z dd d Z d d Z ddZ dS) AbstractKeyz0Abstract superclass for private and public keys.necCs||_||_dSNr)selfrrr X/home/tom/ab/renpy-build/tmp/install.linux-x86_64/lib/python3.9/site-packages/rsa/key.py__init__6szAbstractKey.__init__PEMcCs"|j|jd}|||}||S)aLoads a key in PKCS#1 DER or PEM format. :param keyfile: contents of a DER- or PEM-encoded file that contains the public key. :param format: the format of the file to load; 'PEM' or 'DER' :return: a PublicKey object r ZDER)_load_pkcs1_pem_load_pkcs1_der_assert_format_exists)clskeyfileformatmethodsmethodr r r load_pkcs1:s  zAbstractKey.load_pkcs1cCsDz ||WSty>dt|}td||fYn0dS)zBChecks whether the given file format exists in 'methods'. z, z%Unsupported format: %r, try one of %sN)KeyErrorjoinsortedkeys ValueError)Z file_formatrformatsr r r rMs  z!AbstractKey._assert_format_existscCs |j|jd}|||}|S)zSaves the public key in PKCS#1 DER or PEM format. :param format: the format to save; 'PEM' or 'DER' :returns: the DER- or PEM-encoded public key. r )_save_pkcs1_pem_save_pkcs1_derr)rrrrr r r save_pkcs1Ys  zAbstractKey.save_pkcs1cCs|t||j|j|jS)aPerforms blinding on the message using random number 'r'. :param message: the message, as integer, to blind. :type message: int :param r: the random number to blind with. :type r: int :return: the blinded message. :rtype: int The blinding is such that message = unblind(decrypt(blind(encrypt(message))). See https://en.wikipedia.org/wiki/Blinding_%28cryptography%29 )powrr)rmessagerr r r blindhszAbstractKey.blindcCstj||j||jS)aPerforms blinding on the message using random number 'r'. :param blinded: the blinded message, as integer, to unblind. :param r: the random number 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 )rsacommoninverser)rblindedr"r r r unblindys zAbstractKey.unblindN)r )r ) __name__ __module__ __qualname____doc__ __slots__r classmethodr staticmethodrrr#r(r r r r r1s  rc@seZdZdZdZddZddZddZd d Zd d Z d dZ e ddZ ddZ e ddZddZe ddZe ddZdS) PublicKeyaRepresents 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 accesss 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 rcCs t||Srgetattrrkeyr r r __getitem__szPublicKey.__getitem__cCsd|j|jfS)NzPublicKey(%i, %i)rrr r r __repr__szPublicKey.__repr__cCs |j|jfSz&Returns the key as tuple for pickling.rr6r r r __getstate__szPublicKey.__getstate__cCs|\|_|_dSzSets the key from tuple.Nrrstater r r __setstate__szPublicKey.__setstate__cCs2|dur dSt|tsdS|j|jko0|j|jkSNF) isinstancer0rrrotherr r r __eq__s  zPublicKey.__eq__cCs ||k Srr r@r r r __ne__szPublicKey.__ne__cCsHddlm}ddlm}|j||d\}}|t|dt|ddS)aLoads 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) rdecoder AsnPubKeyZasn1SpecmoduluspublicExponentr)pyasn1.codec.derrErsa.asn1rGdecodeint)rrrErGpriv_r r r rs  zPublicKey._load_pkcs1_dercCsDddlm}ddlm}|}|d|j|d|j||S)zbSaves the public key in PKCS#1 DER format. @returns: the DER-encoded public key. rencoderrFrIrJ)rKrRrLrGsetComponentByNamerrencode)rrRrGasn_keyr r r rs   zPublicKey._save_pkcs1_dercCstj|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)r$pemload_pemrrrderr r r rs zPublicKey._load_pkcs1_pemcCs|}tj|dS)zSaves a PKCS#1 PEM-encoded public key file. :return: contents of a PEM-encoded file that contains the public key. rV)rr$rWsave_pemrrZr r r rszPublicKey._save_pkcs1_pemcCstj|d}||S)aLoads 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. :return: a PublicKey object z PUBLIC KEY)r$rWrXload_pkcs1_openssl_derrYr r r load_pkcs1_openssl_pemsz PublicKey.load_pkcs1_openssl_pemcCslddlm}ddlm}ddlm}|j||d\}}|dd|dkrVtd | |d d d S) zLoads 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) OpenSSLPubKeyrD)univrHheaderoidz1.2.840.113549.1.1.1z7This is not a DER-encoded OpenSSL-compatible public keyr4N) rLr_rKrE pyasn1.typer`rMZObjectIdentifier TypeErrorr)rrr_rEr`ZkeyinforPr r r r]s   z PublicKey.load_pkcs1_openssl_derN)r)r*r+r,r-r5r7r9r=rBrCr.rrrrr^r]r r r r r0s$     r0c@seZdZdZdZdddZddZdd Zd d Zd d Z ddZ ddZ ddZ ddZ eddZddZeddZddZdS) 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 accesss is faster, though. >>> PrivateKey(3247, 65537, 833, 191, 17) PrivateKey(3247, 65537, 833, 191, 17) exp1, exp2 and coef can be given, but if None or omitted they will be calculated: >>> pk = PrivateKey(3727264081, 65537, 3349121513, 65063, 57287, exp2=4) >>> pk.exp1 55063 >>> pk.exp2 # this is of course not a correct value, but it is the one we passed. 4 >>> pk.coef 50797 If you give exp1, exp2 or coef, they will be used as-is: >>> pk = PrivateKey(1, 2, 3, 4, 5, 6, 7, 8) >>> pk.exp1 6 >>> pk.exp2 7 >>> pk.coef 8 rrdpqexp1exp2coefNc Cst|||||_||_||_|dur) r?rfrrrhrirjrkrlrmr@r r r rBos&         zPrivateKey.__eq__cCs ||k Srr r@r r r rCszPrivateKey.__ne__cCs>tj|jd}|||}tj||j|j}|||S)zDecrypts the message using blinding to prevent side-channel attacks. :param encrypted: the encrypted message :type encrypted: int :returns: the decrypted message :rtype: int rc) r$randnumrandintrr#coreZ decrypt_intrhr()r encryptedblind_rr'Z decryptedr r r blinded_decrypts  zPrivateKey.blinded_decryptcCs>tj|jd}|||}tj||j|j}|||S)zEncrypts the message using blinding to prevent side-channel attacks. :param message: the message to encrypt :type message: int :returns: the encrypted message :rtype: int rc) r$rnrorr#rpZ encrypt_intrhr()rr!rrr'rqr r r blinded_encrypts  zPrivateKey.blinded_encryptcCsXddlm}||\}}|ddkr6td|dtdd|ddD}||S)aLoads a key in PKCS#1 DER format. :param keyfile: contents of a DER-encoded file that contains the private key. :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) rrDz)Unable to read this file, version %s != 0css|]}t|VqdSr)rN).0xr r r z-PrivateKey._load_pkcs1_der..rc )rKrErMrtuple)rrrErOrPZas_intsr r r rs   zPrivateKey._load_pkcs1_dercsddlmmddlm}Gfdddj}|}|dd|d|j|d|j|d |j |d |j |d |j |d |j |d |j |d|j||S)zdSaves the private key in PKCS#1 DER format. @returns: the DER-encoded private key. r)r` namedtyperQcseZdZddddddddd  Zd S) z.PrivateKey._save_pkcs1_der..AsnPrivKeyversionrIrJprivateExponentprime1prime2 exponent1 exponent2 coefficientN)r)r*r+Z NamedTypesZ NamedTypeZIntegerZ componentTyper r{r`r r AsnPrivKeysrr|rIrJr}r~rrrr)rdr`r{rKrRSequencerSrrrhrirjrkrlrmrT)rrRrrUr rr rs  zPrivateKey._save_pkcs1_dercCstj|td}||S)aTLoads 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. :return: a PrivateKey object RSA PRIVATE KEY)r$rWrXrrrYr r r rs zPrivateKey._load_pkcs1_pemcCs|}tj|tdS)zSaves a PKCS#1 PEM-encoded private key file. :return: contents of a PEM-encoded file that contains the private key. r)rr$rWr[rr\r r r rszPrivateKey._save_pkcs1_pem)NNN)r)r*r+r,r-r r5r7r9r=rBrCrsrtr.rrrrr r r r rf's"!  ,$ rfTc s|d|d}||}||}td|||}td|||}fdd}d} |||s| rr||}n||}| } qZt||t||fS)a%Returns a tuple of two different primes of nbits bits each. The resulting p * q has exacty 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 zfind_p_q(%i): Finding pzfind_p_q(%i): Finding qcs,||kr dSsdStj||}|kS)zReturns True iff p and q are acceptable: - p and q differ - (p * q) has the right nr of bits (when accurate=True) FT)r$r%Zbit_size)rirjZ found_sizeaccurateZ total_bitsr r is_acceptable8s zfind_p_q..is_acceptableF)logdebugmaxmin) nbits getprime_funcrshiftZpbitsZqbitsrirjrZchange_pr rr find_p_q s     rcCsp|d|d}ztj||}Wn"tyDtd||fYn0|||dkrhtd|||f||fS)aCalculates 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 rcz.e (%d) and phi_n (%d) are not relatively primez6e (%d) and d (%d) are not mult. inv. modulo phi_n (%d))r$r%r&r)rirjexponentZphi_nrhr r r calculate_keys_custom_exponentYs   rcCs t||tS)zCalculates 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. )rDEFAULT_EXPONENT)rirjr r r calculate_keysus rcCsPt|d||\}}zt|||d\}}WqDWqty@Yq0q||||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 r)r)rrr)rrrrrirjrrhr r r gen_keyss rrcc Cs|dkrtd|dkr$td||dkrRddlm}ddl}|j|j|d}ntjj}t||||d \}}} } ||} t| | t | | | ||fS) aGenerates 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. rz Key too smallrczPool size (%i) should be >= 1r)parallelN)poolsize)rr) rr$r functoolspartialgetprimeprimerr0rf) rrrrrrrrirjrrhrr r r newkeyss  r)r0rfr__main__d z%i timesZAbortedz Doctests done)"r,loggingZ rsa._compatrZ rsa.primer$Zrsa.pemZ rsa.commonZ rsa.randnumZrsa.core getLoggerr)rrobjectrr0rfrrrrrrr__all__doctestrangecounttestmodZfailurestestsprintKeyboardInterruptr r r r s@  W eN 5