o n~bM@sddlZddlZddlmZddlmZmZmZmZm Z m Z m Z ddl m Z mZmZmZmZddlmZddlmZddlmZmZmZddlmZmZmZmZed d Z ed d Z!d$ddZ"d%ddZ#Gddde$Z%d&ddZ&d'ddZ'ddZ(ddZ)ddZ*d(d d!Z+d"d#Z,dS))N)reduce)tobytesbord _copy_bytes iter_rangetostrbchrbstr)SHA1SHA256HMACCMACBLAKE2s)strxor)get_random_bytes)size long_to_bytes bytes_to_long)load_pycryptodome_raw_libcreate_string_bufferget_raw_bufferc_size_tzCryptodome.Cipher._Salsa20z int Salsa20_8_core(const uint8_t *x, const uint8_t *y, uint8_t *out); zCryptodome.Protocol._scrypta  typedef int (core_t)(const uint8_t [64], const uint8_t [64], uint8_t [64]); int scryptROMix(const uint8_t *data_in, uint8_t *data_out, size_t data_len, unsigned N, core_t *core); cCs|st}t|}|||}|j}||krtd|t|dkr*tdt|t|dD] }||}q0|d|S)aYDerive one key from a password (or passphrase). This function performs key derivation according to an old version of the PKCS#5 standard (v1.5) or `RFC2898 `_. Args: password (string): The secret password to generate the key from. salt (byte string): An 8 byte string to use for better protection from dictionary attacks. This value does not need to be kept secret, but it should be randomly chosen for each derivation. dkLen (integer): The length of the desired key. The default is 16 bytes, suitable for instance for :mod:`Cryptodome.Cipher.AES`. count (integer): The number of iterations to carry out. The recommendation is 1000 or more. hashAlgo (module): The hash algorithm to use, as a module or an object from the :mod:`Cryptodome.Hash` package. The digest length must be no shorter than ``dkLen``. The default algorithm is :mod:`Cryptodome.Hash.SHA1`. Return: A byte string of length ``dkLen`` that can be used as key. z:Selected hash algorithm has a too short digest (%d bytes).z,Salt is not 8 bytes long (%d bytes instead).N) r rnew digest_size TypeErrorlen ValueErrorrdigest)passwordsaltdkLencountZhashAlgoZpHashr ir&B/usr/local/lib/python3.10/dist-packages/Cryptodome/Protocol/KDF.pyPBKDF17s  r(c s<tt|}rrtddurdurts!tdsfdur+fddfddd}d }t||kre|td |gd |ttfd d t |D7}|d 7}t||kszPBKDF2..cs(|d|d|d<|d<|dS)Nrrr&)r.)r!prfr&r'links zPBKDF2..linkrz>Ic3s|]}VqdSr+r&).0j)r3r.r&r' szPBKDF2..)rrr hasattrrstructpackrrranger rcopyupdater r*) r!r"r#r$r2r/keyr%baseZ first_digestr&)r/r3r!r2r.r'PBKDF2bs6*  "   rAc@s>eZdZdZd ddZeddZddZd d Zd d Z dS)_S2VzString-to-vector PRF as defined in `RFC5297`_. This class implements a pseudorandom function family based on CMAC that takes as input a vector of strings. .. _RFC5297: http://tools.ietf.org/html/rfc5297 NcCsVtdd||_||_d|j|_|_|jdd|_|dur$i|_dSt||_dS)aInitialize the S2V PRF. :Parameters: key : byte string A secret that can be used as key for CMACs based on ciphers from ``ciphermod``. ciphermod : module A block cipher module from `Cryptodome.Cipher`. cipher_params : dictionary A set of extra parameters to use to create a cipher instance. Nrr) r_key _ciphermod block_size _last_string_cache _n_updates_cipher_paramsdict)selfr? ciphermod cipher_paramsr&r&r'__init__s  z _S2V.__init__cCs t||S)aCreate a new S2V PRF. :Parameters: key : byte string A secret that can be used as key for CMACs based on ciphers from ``ciphermod``. ciphermod : module A block cipher module from `Cryptodome.Cipher`. )rB)r?rMr&r&r'rs z_S2V.newcCs@t|d>}t|dd@r|dN}t|t|t| dS)Nrr)rrrr)rLbsZdoubledr&r&r'_doubles z _S2V._doublecCsd|jdkr td|jd8_tj|j|j|j|jd}t| |j | |_ t dd||_dS)adPass the next component of the vector. The maximum number of components you can pass is equal to the block length of the cipher (in bits) minus 1. :Parameters: item : byte string The next component of the vector. :Raise TypeError: when the limit on the number of components has been reached. rz!Too many components passed to S2VrmsgrMrNN) rIrr rrDrGrErJrrSrHr r)rLitemmacr&r&r'r>s z _S2V.updatecCs|t|jdkr|jddt|jdd|j}n|jdddd}t|||j}tj|j||j|j d}| S)z"Derive a secret from the vector of components. :Return: a byte string, as long as the block length of the cipher. r)NisrT) rrGrrHrSr rrDrErJr )rLfinalpaddedrWr&r&r'derives&z _S2V.deriver+) __name__ __module__ __qualname____doc__rO staticmethodrrSr>r[r&r&r&r'rBs    rBrc s|}|d|jkrtd|sd|j}|durd}tj|||d}|}dg} d} d} | |krYtj|| d |td | |d}| || |j7} | d7} | |ks3d| |dkrhdSfd d t d|D} t | d|S) aDerive one or more keys from a master secret using the HMAC-based KDF defined in RFC5869_. Args: master (byte string): The unguessable value used by the KDF to generate the other keys. It must be a high-entropy secret, though not necessarily uniform. It must not be a password. salt (byte string): A non-secret, reusable value that strengthens the randomness extraction step. Ideally, it is as long as the digest size of the chosen hash. If empty, a string of zeroes in used. key_len (integer): The length in bytes of every derived key. hashmod (module): A cryptographic hash algorithm from :mod:`Cryptodome.Hash`. :mod:`Cryptodome.Hash.SHA512` is a good choice. num_keys (integer): The number of keys to derive. Every key is :data:`key_len` bytes long. The maximum cumulative length of all keys is 255 times the digest size. context (byte string): Optional identifier describing what the keys are used for. Return: A byte string or a tuple of byte strings. .. _RFC5869: http://tools.ietf.org/html/rfc5869 zToo much secret data to deriverCNr4) digestmodrrBcg|] }||qSr&r&r6idxZderived_outputkey_lenr&r' KzHKDF..) rrr rr r:r;appendjoinrlist) Zmasterrir"Zhashmodnum_keyscontextZ output_lenhmacZprktntlenkolr&rhr'HKDFs2  $     rvcs.dt|d|krtd|dkrtd|dd|kr"tdd d }t|||d|d|d }tj} tj} g} t|D]1} | d|} td|}| || | d||t d||| }|ritd || t |g7} q?t|d | |d|d |dkrSfddtd|D}|S)uHDerive one or more keys from a passphrase. Args: password (string): The secret pass phrase to generate the keys from. salt (string): A string to use for better protection from dictionary attacks. This value does not need to be kept secret, but it should be randomly chosen for each derivation. It is recommended to be at least 16 bytes long. key_len (integer): The length in bytes of every derived key. N (integer): CPU/Memory cost parameter. It must be a power of 2 and less than :math:`2^{32}`. r (integer): Block size parameter. p (integer): Parallelization parameter. It must be no greater than :math:`(2^{32}-1)/(4r)`. num_keys (integer): The number of keys to derive. Every key is :data:`key_len` bytes long. By default, only 1 key is generated. The maximum cumulative length of all keys is :math:`(2^{32}-1)*32` (that is, 128TB). A good choice of parameters *(N, r , p)* was suggested by Colin Percival in his `presentation in 2009`__: - *( 2¹⁴, 8, 1 )* for interactive logins (≤100ms) - *( 2²⁰, 8, 1 )* for file encryption (≤5s) Return: A byte string or a tuple of byte strings. .. __: http://www.tarsnap.com/scrypt/scrypt-slides.pdf r5rzN must be a power of 2lz N is too biglrPzp or r are too bigcSst||tSr+)r rr r r,r&r&r'r0r1zscrypt..)r2zError %X while running scryptr4crer&r&rfZdkrir&r'rjrkzscrypt..r) bit_sizerrA_raw_scrypt_lib scryptROMix_raw_salsa20_libZSalsa20_8_corerrrrrm)r!r"riNrr-roZprf_hmac_sha256Zstage_1rzcoreZdata_outZflowrgZ buffer_outresultrur&rwr'scryptQsD'      rcsd}g|D]}tt|ddd}t|qdfddtdtdD}g}|dd D]}t|d}|||q9|d }t|ddt|>}|||d |}t |S) N@./ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789r5rr4cg|] }||dqS)r&rfbitsr&r'rjz"_bcrypt_encode..rrrc) binrzfillrlr rmr<rintr)datar.cZbits_cbits6rgrgr&rr'_bcrypt_encodes    rc sd}gt|D]}||}t|ddd}|qdt|d}|dkr3td|dkr>ddn |d krHdd fd d td tdD}g}|D] }|t t |dq[d|}|S)Nrr5rrrzIncorrect lengthcr)rr&rfrr&r'rjrz"_bcrypt_decode..rrr4) rfindrrrlrmrrr<rr) rr.rrgrZmodulo4Zbits8rrr&rr'_bcrypt_decodes(       rc Csxddlm}t|dkrtdd|krdks"tdtd|||j|||}|}tdD]}||}q2|S) Nr) _EKSBlowfishHz6The password is too long. It must be 72 bytes at most.rz-bcrypt cost factor must be in the range 4..31@)ZCryptodome.CipherrrrrZMODE_ECBr<encrypt) r!costr"Zconstantinvertrcipherctext_r&r&r' _bcrypt_hashs    rcCst|d}|tdddkrtdt|dkr|d7}|dur&td}t|dkr0td t|||d d }d tt| d }d t |}t |dd}d|||S)a>Hash a password into a key, using the OpenBSD bcrypt protocol. Args: password (byte string or string): The secret password or pass phrase. It must be at most 72 bytes long. It must not contain the zero byte. Unicode strings will be encoded as UTF-8. cost (integer): The exponential factor that makes it slower to compute the hash. It must be in the range 4 to 31. A value of at least 12 is recommended. salt (byte string): Optional. Random byte string to thwarts dictionary and rainbow table attacks. It must be 16 bytes long. If not passed, a random value is generated. Return (byte string): The bcrypt hash Raises: ValueError: if password is longer than 72 bytes or if it contains the zero byte zutf-8rrcz#The password contains the zero byterrCNr)z!bcrypt salt must be 16 bytes longsOrpheanBeholderScryDoubtT$r5s$2a) rrrrrrrr strrr)r!rr"rZcost_encZsalt_encZhash_encr&r&r'bcrypts    rc Cst|}t|dkrtdt||dddkrtdtd}||}|s.tdt|d }d|krBd ksGtd td t|d }t |||}t d }t j d||d }t j d||d } || krttddS)aVerify if the provided password matches the given bcrypt hash. Args: password (byte string or string): The secret password or pass phrase to test. It must be at most 72 bytes long. It must not contain the zero byte. Unicode strings will be encoded as UTF-8. bcrypt_hash (byte string, bytearray): The reference bcrypt hash the password needs to be checked against. Raises: ValueError: if the password does not match <z;Incorrect length of the bcrypt hash: %d bytes instead of 60Nrs$2a$zUnsupported prefixs@\$2a\$([0-9][0-9])\$([A-Za-z0-9./]{22,22})([A-Za-z0-9./]{31,31})zIncorrect bcrypt hash formatrrzIncorrect costr5r))Z digest_bitsr?rzIncorrect bcrypt hash)rrrrecompilematchrgrouprrrrrr ) r!Z bcrypt_hashr-r}rr"Z bcrypt_hash2secretZmac1Zmac2r&r&r' bcrypt_checks,    r)rN)r)rNN)rN)rr+)-rr: functoolsrZCryptodome.Util.py3compatrrrrrrr ZCryptodome.Hashr r r r rZCryptodome.Util.strxorrZCryptodome.RandomrZCryptodome.Util.numberrrxrrZCryptodome.Util._raw_apirrrrr{ryr(rAobjectrBrvrrrrrrr&r&r&r's2 $    +Q ` >P  /