o e}n@sdZddlZddlZddlZddlZddlZddlZddlZddl ZdZ ej dddZ GdddZ Gdd d e ZGd d d e Zejjd fd edejegefdedejeeffddZdedededejeeffddZdededejeeffddZd e fd edejegefdededejeeeeff ddZd de fd ededededejeeff ddZgd Zed!krddlZz%ed"D]Ze \Z!Z"e!rned#dkresedkre#d$eqWne$ye#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. NiT AbstractKey)boundc @s@eZdZdZdZdededdfddZed ej e d e de fd d Z ed ej e d e de fd dZ de fddZde fddZed(d ej e d e dede fddZededejeejfdejfddZd(dede fddZdedejeeffddZd ed!edefd"d#Zdefd$d%Zdejeeffd&d'ZdS))rz0Abstract superclass for private and public keys.)neblindfacblindfac_inversemutexrrreturnNcCs&||_||_d|_|_t|_dS)N)rrrr threadingLockr )selfrrr2/usr/local/lib/python3.10/dist-packages/rsa/key.py__init__8s zAbstractKey.__init__clskeyfilecCdS)zLoads 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 Nrrrrrr_load_pkcs1_pemCzAbstractKey._load_pkcs1_pemcCr)zLoads 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 Nrrrrr_load_pkcs1_derOrzAbstractKey._load_pkcs1_dercCr)zSaves the key in PKCS#1 PEM format, implement in a subclass. :returns: the PEM-encoded key. :rtype: bytes Nrrrrr_save_pkcs1_pem[rzAbstractKey._save_pkcs1_pemcCr)zSaves the key in PKCS#1 DER format, implement in a subclass. :returns: the DER-encoded key. :rtype: bytes Nrrrrr_save_pkcs1_derbrzAbstractKey._save_pkcs1_derPEMformatcCs"|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 rDER)rr_assert_format_exists)rrrmethodsmethodrrr load_pkcs1is  zAbstractKey.load_pkcs1 file_formatr!c CsHz||WSty#}zdt|}td||f|d}~ww)z9Checks whether the given file format exists in 'methods'.z, z%Unsupported format: %r, try one of %sN)KeyErrorjoinsortedkeys ValueError)r$r!exformatsrrrr s  z!AbstractKey._assert_format_existscCs |j|jd}|||}|S)zSaves 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 )rrr!r"rrr save_pkcs1s   zAbstractKey.save_pkcs1messagecCs.|\}}|t||j|j|j}||fS)aPerforms 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_factorpowrr)rr-rrblindedrrrblinds zAbstractKey.blindr0rcCs|||jS)aPerforms 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)rr0rrrrunblinds zAbstractKey.unblindcCs@tdD]}tj|jd}tj|j|r|Sqtd)Nizunable to find blinding factor)rangersarandnumrandintrprimeare_relatively_prime RuntimeError)r_blind_rrrr_initial_blinding_factors z$AbstractKey._initial_blinding_factorcCs|j5|jdkr||_tj|j|j|_nt|jd|j|_t|jd|j|_|j|jfWdS1s;wYdS)aUpdate 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. rN) r rr=r5commoninverserrr/rrrrr.s   $z#AbstractKey._update_blinding_factor)r)__name__ __module__ __qualname____doc__ __slots__intr classmethodtypingTyperbytesrrrrstrr# staticmethodMappingCallabler r,Tupler1r2r=r.rrrrr3s2   $   c@seZdZdZdZdedefddZdefddZde j eeffd d Z d e j eefdd fd dZ de j defddZde j defddZdefddZededdfddZdefddZededdfddZdefddZededdfdd Zededdfd!d"Zd S)# 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 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 rkeyr cC t||SNgetattrrrQrrr __getitem__ zPublicKey.__getitem__cCsd|j|jfS)NzPublicKey(%i, %i)rrrrrr__repr__zPublicKey.__repr__cCs |j|jfSz&Returns the key as tuple for pickling.rYrrrr __getstate__s zPublicKey.__getstate__stateNcCs"|\|_|_t||j|jdSzSets the key from tuple.N)rrrrrr^rrr __setstate__s zPublicKey.__setstate__othercCs2|durdSt|ts dS|j|jko|j|jkSNF) isinstancerPrrrrbrrr__eq__s  zPublicKey.__eq__cC ||k SrSrrerrr__ne__ rXzPublicKey.__ne__cCst|j|jfSrS)hashrrrrrr__hash__r[zPublicKey.__hash__rcCsHddlm}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 AsnPubKeyasn1SpecmoduluspublicExponentrY)pyasn1.codec.derrlrsa.asn1rndecoderF)rrrlrnprivr;rrrrs  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 rencoderrmrqrr)rsrxrtrnsetComponentByNamerrencode)rrxrnasn_keyrrrr-s   zPublicKey._save_pkcs1_dercCtj|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 KEYr5pemload_pemrrrderrrrr>s zPublicKey._load_pkcs1_pemcC|}tj|dS)zSaves a PKCS#1 PEM-encoded public key file. :return: contents of a PEM-encoded file that contains the public key. :rtype: bytes r}rr5rsave_pemrrrrrrMzPublicKey._save_pkcs1_pemcCr|)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. :type keyfile: bytes :return: a PublicKey object z PUBLIC KEY)r5rrload_pkcs1_openssl_derrrrrload_pkcs1_openssl_pemWs z PublicKey.load_pkcs1_openssl_pemcCslddlm}ddlm}ddlm}|j||d\}}|dd|dkr+td | |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) OpenSSLPubKeyrk)univroheaderoidz1.2.840.113549.1.1.1z7This is not a DER-encoded OpenSSL-compatible public keyrQr3N) rtrrsrl pyasn1.typerruObjectIdentifier TypeErrorr)rrrrlrkeyinfor;rrrrjs  z PublicKey.load_pkcs1_openssl_der)rArBrCrDrErKrFrWrZrHrOr]raAnyboolrfrhrjrGrJrrrrrrrrrrrPs(  rPc @sDeZdZdZdZdedededededd f d d Zd edefd dZdefddZ de j eeeeeeeeffddZ de j eeeeeeeefdd fddZ de jdefddZde jdefddZdefddZdedefddZd 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 )dpqexp1exp2coefrrrrrr NcCsXt|||||_||_||_t||d|_t||d|_tj |||_ dS)Nr3) rrrrrrFrrr5r?r@r)rrrrrrrrrrszPrivateKey.__init__rQcCrRrSrTrVrrrrWrXzPrivateKey.__getitem__cCsd|j|j|j|j|jfS)NzPrivateKey(%i, %i, %i, %i, %i))rrrrrrrrrrZszPrivateKey.__repr__cCs$|j|j|j|j|j|j|j|jfSr\)rrrrrrrrrrrrr]s$zPrivateKey.__getstate__r^c Cs:|\|_|_|_|_|_|_|_|_t ||j|jdSr_) rrrrrrrrrrr`rrrras$zPrivateKey.__setstate__rbcCsz|durdSt|ts dS|j|jko<|j|jko<|j|jko<|j|jko<|j|jko<|j|jko<|j|jko<|j |j kSrc) rdrrrrrrrrrrerrrrfs&         zPrivateKey.__eq__cCrgrSrrerrrrhrXzPrivateKey.__ne__c Cs(t|j|j|j|j|j|j|j|jfSrS) rirrrrrrrrrrrrrjs(zPrivateKey.__hash__ encryptedcCs\||\}}t||j|j}t||j|j}|||j|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 )r1r/rrrrrr2)rrr0rs1s2h decryptedrrrblinded_decrypts   zPrivateKey.blinded_decryptr-cCs.||\}}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 )r1r5core encrypt_intrrr2)rr-r0rrrrrblinded_encrypts  zPrivateKey.blinded_encryptrc Csddlm}||\}}|ddkrtd|dtt|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) rrkz)Unable to read this file, version %s != 0r3 zYou have provided a malformed keyfile. Either the exponents or the coefficient are incorrect. Using the correct values instead.) rsrlrur)maprFrrrwarningswarn UserWarning) rrrlrvr;as_intsrQrrrrrrrs  zPrivateKey._load_pkcs1_dercsddlmmddlm}Gfdddj}|}|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 namedtyperwcseZdZddddddddd  Zd S) z.PrivateKey._save_pkcs1_der..AsnPrivKeyversionrqrrprivateExponentprime1prime2 exponent1 exponent2 coefficientN)rArBrC NamedTypes NamedTypeInteger componentTyperrrrr AsnPrivKey<srrrqrrrrrrrr)rrrrsrxSequenceryrrrrrrrrrz)rrxrr{rrrr2s   zPrivateKey._save_pkcs1_dercCr|)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~rrrrrWs zPrivateKey._load_pkcs1_pemcCr)zSaves a PKCS#1 PEM-encoded private key file. :return: contents of a PEM-encoded file that contains the private key. :rtype: bytes rrrrrrrgrzPrivateKey._save_pkcs1_pem)rArBrCrDrErFrrKrWrZrHrOr]rarrrfrhrjrrrGrJrrrrrrrrrs&" $ (:%rTnbits getprime_funcaccurater c s|d|d}||}||}||}||}dtdtdtffdd }d} |||s@| r4||}n||}| } |||r-t||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>rrr cs,||krdSs dStj||}|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)r5r?bit_size)rr found_sizer total_bitsrr is_acceptables zfind_p_q..is_acceptableF)rFrmaxmin) rrrshiftpbitsqbitsrrrchange_prrrfind_p_qrs#    rrrexponentc Cs|d|d}z tj||}Wn tjjy1}ztjj|||jd|||jfd|d}~ww|||dkrCtd|||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 r3z;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))r5r?r@NotRelativePrimeErrorrr))rrrphi_nrr*rrrcalculate_keys_custom_exponents*    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)rrrrrcalculate_keyss rcCsN t|d||\}}z t|||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)rrr))rrrrrrrrrrrgen_keyss  rr3poolsizec s|dkrtddkrtddkr)ddlmdtdtffd 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 smallr3zPool size (%i) should be >= 1r)parallelrr csj|dS)N)r)getprime)rrrrrr;sznewkeys..getprime_func)rr) r)r5rrFr8rrrPr) rrrrrrrrrrrrrnewkeyss  r)rPrr__main__d z%i timesAbortedz Doctests done)%rDr rHr rsa.primer5rsa.pem rsa.common rsa.randnumrsa.corerTypeVarrrrPrr8rrFrNrrOrrrrr__all__rAdoctestr4counttestmodfailurestestsprintKeyboardInterruptrrrrs(&v  $P " #  8