a db-@sdZdZdZdZz ddlZWney6ddlZYn0ddlmZmZddl Z ddl Z ddl Z ddl Z ddl Z ddlZddlZddlmZddlZedeed ed d Zd d ZddZddZddZddZddZddZddZddZddZ d d!Z!d"d#Z"d$d%Z#d&d'Z$d(d)Z%d*d+Z&d,d-Z'd.d/Z(d0d1Z)d2d3Z*d4d5Z+d6d7Z,d8d9Z-d:d;Z.dd?Z0d@dAZ1dBdCZ2dDdEZ3dFdGZ4edHkrddl5Z5e56gdIZ7dS)Ja_Deprecated version of the RSA module .. deprecated:: 2.0 This submodule is deprecated and will be completely removed as of version 4.0. Module for calculating large primes, and RSA encryption, decryption, signing and verification. Includes generating public and private keys. WARNING: this code implements the mathematics of RSA. It is not suitable for real-world secure cryptography purposes. It has not been reviewed by a security expert. It does not include padding of data. There are many ways in which the output of this module, when used without any modification, can be sucessfully attacked. z.Sybren Stuvel, Marloes de Boer and Ivo Tamboerz 2010-02-05z1.3.3N)dumpsloads)bytez@Insecure version of the RSA module is imported as %s, be carefulzNThis submodule is deprecated and will be completely removed as of version 4.0.cCs0||krt||S|dkr|St|t||S)zNReturns the greatest common divisor of p and q >>> gcd(42, 6) 6 r)gcdabs)pqr `/home/tom/ab/renpy-build/tmp/install.linux-x86_64/lib/python3.9/site-packages/rsa/_version133.pyr?s rcCs\t|tjus$t|tjus$tdd}|D]*}|d9}t|tjurNt|}||7}q,|S)z7Converts a list of bytes or a string to an integer z You must pass a string or a listr)typetypesZListTypeZ StringType TypeErrorord)bytesintegerrr r r bytes2intJs rcCsRt|tjus$t|tjus$tdd}|dkrNdt|d@|f}|d}q(|S)z+Converts a number to a string of bytes You must pass a long or an intrz%s%sr )r r LongTypeIntTyperr)numberstringr r r int2bytesZs rcCsR||}g}|dkr,||d@|d?}q |rN|}|||d|}q,|S)zCalculates r = a^p mod n )appendpop)arnresultZ remaindersremr r r fast_exponentiationis r#cCst|d}t|}t|S)zPReads a random integer of approximately nbits bits rounded up to whole bytes @)ceilosurandomr)nbitsnbytesZ randomdatar r r read_random_intvs  r*cCstt|S)zceil(x) -> int(math.ceil(x)))intmathr%)xr r r r%~sr%cCsNd}||}tt|dd}t|d|d}t||}t|||S)z9Returns a random integer x with minvalue <= x <= maxvalue rr$)r%r,logmaxrandomrandintr*)ZminvalueZmaxvalueZ min_nbitsrangeZ rangebytesZ rangebitsr(r r r r3s  r3cCstd|d}t||d|S)zPReturns 1 if p may be prime, and something else if p definitely is not primer)r3r#)rrr r r fermat_little_theoremsr5cCsz||dkrdSd}|dkrv|d@rR|d|dd?d@rB| }|||}}q|ddd?d@rl| }|d?}q|S)z4Calculates the value of the Jacobi symbol (a/b) rrrr )rbr!r r r jacobis  r8cCs2t|||}t||dd|}||kr.dSdS)zUReturns False if n is an Euler pseudo-prime with base x, and True otherwise. rrFT)r8r#)r-r jfr r r jacobi_witnesss r;cCsPd}t|td|d}t|dD]"}td|d}t||r(dSq(dS)zCalculates whether n is composite (which is always correct) or prime (which is incorrect with error probability 2**-k) Returns False if the number if composite, and True if it's probably prime. g?rrFT)r%r,r0r4r3r;)r krtir-r r r randomized_primality_testings r?cCst|drdSdS)z>Returns True if the number is prime, and False otherwise. TF)r?)rr r r is_primes rAcCs2tt|d}t|}|dO}t|rq.q|S)zxReturns a prime number of max. 'math.ceil(nbits/8)*8' bits. In other words: nbits is rounded up to whole bytes. r$r)r+r,r%r*rA)r(r)rr r r getprimes  rBcCst||}|dkS)zQReturns True if a and b are relatively prime, and False if they are not. r)r)rr7dr r r are_relatively_primes rDcCs$t|}t|}||ksqq||fS)z5Returns a tuple of two different primes of nbits bits)rB)r(rrr r r find_p_qs rEcCsL|dkr|ddfSt||}t||}t||\}}}|||||fS)z@Returns a tuple (d, i, j) such that d = gcd(a, b) = ia + jb rr)rlongextended_euclid_gcd)rr7rrrCr<lr r r rGs    rGc Cs||}|d|d}ttd|d}t||rt||rqBqt||\}}}|dksjtd||f|||dkstd|||f||fS)zaCalculates an encryption and a decryption key for p and q, and returns them as a tuple (e, d)rr/rz.e (%d) and phi_n (%d) are not relatively primez6e (%d) and i (%d) are not mult. inv. modulo phi_n (%d))rBr1rDrG Exception) rrr(r Zphi_nerCr>r9r r r calculate_keyssrLcCs4t|\}}t|||\}}|dkrq(q||||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)rErLr(rrrKrCr r r gen_keys,s  rNcCs*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: ....). )rKr )rCrr)rNrMr r r gen_pubpriv_keys<srOcCstt|tjurtt|||St|tjur4td|dkrhtt |dtt |dkrht dt |||S)zDEncrypts a message using encryption key 'ekey', working modulo nrrrzThe message is too long) r r r encrypt_intrFrrr,floorr0 OverflowErrorr#)messageekeyr r r r rPHs"rPcCs t|||S)zLDecrypts a cypher text using the decryption key 'dkey', working modulo nrP)Z cyphertextdkeyr r r r decrypt_intXsrWcCs t|||S)z2Signs 'message' using key 'dkey', working modulo n)rW)rSrVr r r r sign_int^srXcCs t|||S)z4verifies 'signed' using key 'ekey', working modulo nrU)signedrTr r r r verify_intcsrZcCs tt|}t|}|S)z-Pickles and base64encodes it's argument chops)zlibcompressrbase64 encodestringstrip)chopsvalueencodedr r r picklechopshs rccCsttt|S)z:base64decodes and unpickes it's argument string into chops)rr[ decompressr] decodestring)rr r r unpicklechopsosrfcCst|}|d}ttt|d}|d}||}||dkrJ|d7}g} t|D]6} | |} || | |} t| } | || ||qVt| S)zSplits 'message' into chops that are at most as long as n, converts these into integers, and calls funcref(integer, key, n) for each chop. Used by 'encrypt' and 'sign'. r/rrr) lenr+r,rQr0r4rrrc)rSkeyr funcrefZmsglenZmbitsr(r)blockscypherZbindexoffsetblockrar r r chopstringts  rncCs2d}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)rfr)r`rhr rirSZcpartZmpartr r r gluechopss  rocCst||d|dtS)z5Encrypts a string 'message' with the public key 'key'rKr )rnrPrSrhr r r encryptsrqcCst||d|d|dtS)z3Signs a string 'message' with the private key 'key'rCrr)rnrWrpr r r signsrrcCst||d|d|dtS)z,Decrypts a cypher with the private key 'key'rCrr)rorWrkrhr r r decryptsrtcCst||d|dtS)z+Verifies a cypher with the public key 'key'rKr )rorPrsr r r verifysru__main__)rOrqrtrrru)8__doc__ __author____date__ __version__cPicklepickle ImportErrorrrr]r,r&r2sysr r[Z rsa._compatrwarningswarn__name__DeprecationWarningrrrr#r*r%r3r5r8r;r?rArBrDrErGrLrNrOrPrWrXrZrcrfrnrorqrrrtrudoctesttestmod__all__r r r r st