a db;@sdZdZdZdZddlZddlZddlZddlZddlZddl m Z ddl Z e de e ded d Zd d Zd dZddZddZddZddZddZddZddZddZdd Zd!d"Zd#d$Zd%d&Zd'd(Zd)d*Zd+d,Z d-d.Z!d/d0Z"d1d2Z#d3d4Z$d5d6Z%d7d8Z&d9d:Z'd;d<Z(d=d>Z)d?d@Z*dAdBZ+dCdDZ,dEdFZ-e dGkrxddl.Z.e./gdHZ0dS)IzDeprecated version of the RSA module .. deprecated:: 3.0 This submodule is deprecated and will be completely removed as of version 4.0. z;Sybren Stuvel, Marloes de Boer, Ivo Tamboer, and Barry Meadz 2010-02-08z2.0N)bytez4Insecure version of the RSA module is imported as %szNThis submodule is deprecated and will be completely removed as of version 4.0.cCsttt|dS)zBReturns the number of bits required to hold a specific long number)intmathceillognumberr `/home/tom/ab/renpy-build/tmp/install.linux-x86_64/lib/python3.9/site-packages/rsa/_version200.pybit_size+sr cCs.|dkr*||kr||}}|||}}q|S)zOReturns the greatest common divisor of p and q >>> gcd(48, 180) 12 rr )pqr r r gcd0srcCs\t|tjus$t|tjus$tdd}|D]*}|d9}t|tjurNt|}||7}q,|S)z7Converts a list of bytes or a string to an integer You must pass a string or a listr)typetypesListType StringType TypeErrorord)bytesintegerrr r r bytes2int<s rcCsRt|tjus$t|tjus$tdd}|dkrNdt|d@|f}|d}q(|S)z0 Converts a number to a string of bytes You must pass a long or an intr%s%sr)rrLongTypeIntTyperrr stringr r r int2bytesLs r#cCst|tjus$t|tjus$tdd|kr8dkrHnn t|dSd|kr\dkrlnn t|dSd|krd krnn t|d S|d krtd S|d krtd Std|dS)zConverts a number in the range of 0 to 63 into base 64 digit character in the range of '0'-'9', 'A'-'Z', 'a'-'z','-','_'. rr 0 #7$=>-?_Invalid Base64 value: %iN)rrrr rr ValueErrorrr r r to64\s   r1cCst|tjus$t|tjus$tdd|kr8dkrDnn|dSd|krXdkrdnn|dSd|krxdkrnn|d S|d krd S|d krd Std|dS)znConverts an ordinal character value in the range of 0-9,A-Z,a-z,-,_ to a number in the range of 0-63. rr%9AZr(azr*r,r+r.r-r/N)rrrr rr0rr r r from64vsr7cCsRt|tjus$t|tjus$tdd}|dkrNdt|d@|f}|d}q(|S)zsConverts a number to a string of base64 encoded characters in the range of '0'-'9','A'-'Z,'a'-'z','-','_'. rrrrr-@)rrrr rr1r!r r r int2str64s r9cCs`t|tjus$t|tjus$tdd}|D].}|d9}t|tjurNt|}|t|7}q,|S)zConverts a base64 encoded string into an integer. The chars of this string in in the range '0'-'9','A'-'Z','a'-'z','-','_' rrr8)rrrrrrr7)r"rrr r r str642intsr:cCs$tt|d}t|}t|S)zPReads a random integer of approximately nbits bits rounded up to whole bytesg @)rrrosurandomr)nbitsnbytesZ randomdatar r r read_random_ints r?cCsNd}||d}t|dd}t|d|d}t||}t|||S)z9Returns a random integer x with minvalue <= x <= maxvalue r)r maxrandomrandintr?)ZminvalueZmaxvalueZ min_nbitsrangeZ rangebytesZ rangebitsr=r r r rFs   rFcCs|dkr dSd}|dkrr|d@rN|d|dd?d@r>| }|||}}q||dd?d@rh| }|dL}q|dkr~dS|S)zoCalculates the value of the Jacobi symbol (a/b) where both a and b are positive integers, and b is odd rrArr )abresultr r r jacobis   rLcCs2t|||}t||dd|}||kr.dSdS)zUReturns False if n is an Euler pseudo-prime with base x, and True otherwise. rArFT)rLpow)xnjfr r r jacobi_witnesss rRcCs0t|D]"}td|d}t||rdSqdS)zCalculates whether n is composite (which is always correct) or prime (which is incorrect with error probability 2**-k) Returns False if the number is composite, and True if it's probably prime. rAFT)rGrFrR)rOkirNr r r randomized_primality_testings rUcCst|drdSdS)z>Returns True if the number is prime, and False otherwise. TF)rUrr r r is_primes rWcCs t|}|dO}t|rqq|S)zxReturns a prime number of max. 'math.ceil(nbits/8)*8' bits. In other words: nbits is rounded up to whole bytes. rA)r?rW)r=rr r r getprimes rXcCst||}|dkS)zReturns True if a and b are relatively prime, and False if they are not. >>> are_relatively_prime(2, 3) 1 >>> are_relatively_prime(2, 4) 0 rA)r)rIrJdr r r are_relatively_primes rZcCs<||d}||d}t|}t|}||ks q4q ||fS)z5Returns a tuple of two different primes of nbits bits)rX)r=ZpbitsZqbitsr rr r r find_p_q's    r\c Csd}d}d}d}|}|}|dkr`t||}|||}}||||}}||||}}q|dkrp||7}|dkr||7}|||fS)z@Returns a tuple (r, i, j) such that r = gcd(a, b) = ia + jb rrA)long) rIrJrNyZlxZlyZoaobrr r r extended_gcd2s r`c Cs||}|d|d}tdt|d}t||rt||rqBqt||\}}}|dksjtd||f|dkrztd|||dkstd|||f||fS)zaCalculates an encryption and a decryption key for p and q, and returns them as a tuple (e, d)rAiz.e (%d) and phi_n (%d) are not relatively primerz1New extended_gcd shouldn't return negative valuesz6e (%d) and i (%d) are not mult. inv. modulo phi_n (%d))rDrXrZr` Exception) r rr=rOZphi_nerYrTrPr r r calculate_keysIsrdcCs(t|\}}t|||\}}||||fS)z|Generate RSA keys of nbits bits. Returns (p, q, e, d). Note: this can take a long time, depending on the key size. )r\rdr=r rrcrYr r r gen_keysbs rfcCs4td|}t|\}}}}|||d|||dfS)zGenerates public and private keys, and returns them as (pub, priv). The public key consists of a dict {e: ..., , n: ....). The private key consists of a dict {d: ...., p: ...., q: ....). r$)rcrO)rYr r)rDrfrer r r newkeysms rgcCsht|tjurt|}t|tjur,td|dks<||krDtdt|d}|d|>7}t|||S)z@Encrypts a message using encryption key 'ekey', working modulo nzYou must pass a long or intrzThe message is too longrrA) rrr r]rr OverflowErrorr rM)messageZekeyrOsafebitr r r encrypt_intys  rkcCs(t|||}t|d}|d|>8}|S)zLDecrypts a cypher text using the decryption key 'dkey', working modulo nrrA)rMr )Z cyphertextZdkeyrOrirjr r r decrypt_ints   rlcCs*g}|D]}|t|qd|}|S)zAbase64encodes chops and combines them into a ',' delimited string,)appendr9join)chopschipsvalueencodedr r r encode64chopss  rtcCs*|d}g}|D]}|t|q|S)z9base64decodes and makes a ',' delimited string into chopsrm)splitrnr:)r"rqrpr r r decode64chopss  rvcCst|}|d}t|d}|d}||}||dkr@|d7}g} t|D]6} | |} || | |} t| } | || ||qLt| S)aChops the 'message' into integers that fit into n, leaving room for a safebit to be added to ensure that all messages fold during exponentiation. The MSB of the number n is not independant modulo n (setting it could cause overflow), so use the next lower bit for the safebit. Therefore reserve 2-bits in the number n for non-data bits. Calls specified encryption function for each chop. Used by 'encrypt' and 'sign'. rCrrrA)lenr rGrrnrt)rikeyrOfuncrefZmsglenZmbitsr=r>blockscypherZbindexoffsetblockrrr r r chopstrings    r~cCs2d}t|}|D]}||||}|t|7}q|S)zGlues chops back together into a string. calls funcref(integer, key, n) for each chop. Used by 'decrypt' and 'verify'. r)rvr#)r"rxrOryrirpZcpartZmpartr r r gluechopss  rcCs&d|vrtdt||d|dtS)z5Encrypts a string 'message' with the public key 'key'rOz(You must use the public key with encryptrcrbr~rkrirxr r r encryptsrcCs.d|vrtdt||d|d|dtS)z3Signs a string 'message' with the private key 'key'r z&You must use the private key with signrYrrrr r r signsrcCs.d|vrtdt||d|d|dtS)z5Decrypts a string 'cypher' with the private key 'key'r z)You must use the private key with decryptrYrrbrrlr{rxr r r decryptsrcCs&d|vrtdt||d|dtS)z4Verifies a string 'cypher' with the public key 'key'rOz'You must use the public key with verifyrcrrr r r verifysr__main__)rgrrrr)1__doc__ __author____date__ __version__rr;rEsysrZ rsa._compatrwarningswarn__name__DeprecationWarningr rrr#r1r7r9r:r?rFrLrRrUrWrXrZr\r`rdrfrgrkrlrtrvr~rrrrrdoctesttestmod__all__r r r r sb