":hdZdZdZdZy)ukeccakf1600.py Keccak is a family of hash functions based on the sponge construction. It was chosen by NIST to become the SHA-3 standard. This code implements the Keccak-f[1600] permutation. Detailed information about this function can be found on the official site [1]. Original implementation [2] by the Keccak Team. Some caveats about the implementation: * width `b` of permutation is fixed as 1600 (5 * 5 * 64), which means the number of rounds is 24 (12 + 2ℓ, ℓ = log_2(b / 25)) * ρ step could have its offsets pre-computed as the array `r`. * ι step could have its round constants pre-computed as the array `RC`. [1] http://keccak.noekeon.org/ [2] https://git.io/vKfkb c 0d}d}d}tdDcgc]}tdDcgc]}dc}}}tdD]1}tdD]!}d|d|zzz}||||dz|||<#3d} tdD]}tdDcgc].}||d||dz ||d z ||d z ||d z 0} }tdDcgc] }| |dz dz|| |dzdzdz "} }tdDcgc]'}tdDcgc]}|||| |z c})}}}dd|dd} }}tdD]8} |d |zd |zzdz}}| dz| d zzd z}||||| |c} |||<:tdD]T}tdDcgc] }||| }}tdD]&}||||dzdz||d zdzzz |||<(Vtd D]2}| dz| d z d zz dz} | d zs|ddxxdd|zdz zzcc<4tdD]1}tdD]!}d|d|zzz}|||||||dz#3|Scc}wcc}wcc}wcc}wcc}wcc}}wcc}w)uThe inner permutation for the Keccak sponge function. The Keccak-f permutation is an iterated construction consisting of a sequence of almost identical rounds. It operates on a state array with each of the twenty-four rounds performing five steps, described below with detail. The loops above and below the core of the permutation are used to save and restore the state array to a stream of bytes, used outside the permutation. The original state array has three dimensions, whereas this characteristic can be cleverly optimized to a 5x5 matrix with 64-bit words. As such, this implementation makes use of this trick and stores an entire lane (a z-axis set of bits within the state) as a single word. The θ step diffuses the bits alongside the state array by calculating the parity of nearby columns relative to a lane. The ρ and π steps are merged; together, they move more bits around according to two alike recurrence relations. The χ step is similar to an S-box permutation; it makes the whole round non-linear with a few logic operations on bits inside a line. The ι step is a simple LFSR that breaks the symmetry of the rounds. It generates constants by doing computations according to the round number and its previous output, modulo polynomials over GF(2)[x]. Args: state: square matrix of order 5 that holds the input bytes. Returns: state: bytes permuted by Keccak-f[1600]. c>tfdtdDS)z Saves each byte on its respective position within a 64-bit word. Args: b: partial list of bytes from input. Returns: Sum of list with numbers shifted. c34K|]}|d|zzyw)N).0ibs `/var/www/html/turnos/venv/lib/python3.12/site-packages/ccxt/static_dependencies/keccak/keccak.py z0keccak_f_1600..load64..Cs7AaDQUO7r)sumrange)r s`r load64zkeccak_f_1600..load649s7eAh777c>tfdtdDS)z Transforms a 64-bit word into a list of bytes. Args: a: 64-bit word. Returns: List of bytes separated by position on the word. c34K|]}d|zz dzyw)rNr)rras r r z1keccak_f_1600..store64..Os;QQ1q5\S(;r r)listr)rs`r store64zkeccak_f_1600..store64Es;%(;;;rc0|d|dzz z ||dzzzdzS)a= Denotes the bitwise cyclic shift operation, moving bit at position `i` into position `i + n` (modulo the lane size). Args: a: lane with a 64-bit word, or elements from the state array. n: offset for rotation. Returns: The rotated lane. @lr)rns r rotatezkeccak_f_1600..rotateQs)rQV}%!B-8WEErrqr)r)staterrr_AxyrRCDcurrenttoffsetTjs r keccak_f_1600r1s;F 8 < F).a11U1X ! 1A1 1X/q /AQQYAU1q1u-.AaDG // A 2Y/FKAh OQqT!WqtAw 1a (1Q47 2QqT!W < O OAFq JAQA{^fQA{^Q7 7 J J9>q BAeAh /ad1g!n / B B1ad1gg1r @Aq1uq1u})qA1uQ'A-F tAww(? GQqT!W @ q FA"'(+Q1a+A+1X FA$Aq1ukN?aQ! n"DE!Q F F q /Aq&a1f_-4A1u!Q1!q&A.. /!/*1X0q 0AQQYA&qtAw/E!a!e  00 LC 1 P J / B,s?I9 I4 I93I>%J J J4J )J4I9J ct||zdz}|dzdd}}}|t|kratt||z |}t|D]} || xx|| |zzcc<||z }||k(r t |}d}|t|kra||xx|zcc<|dzr||dz k(r t |}||dz xxdzcc<t |}t} |r)t||}| |d|z } ||z}|r t |}|r)| S)a The general sponge function, consisting of the inner permutation and a padding rule (`pad10*1`). It consists of three main parts. * absorbing, where the input will be permuted repeatedly every time it is divided into a block of size `r + c`. * padding, where an oddly sized last block will be filled with bits until it can be fed into the permutation. * squeezing, where the output's blocks will be permuted more times until they are concatenated to the desired size. Args: r: rate, or the number of input bits processed or output bits generated per invocation of the underlying function c: capacity, or the width of the underlying function minus the rate _input: list of bytes containing the desired object to be hashed suffix: distinguishes the inputs arising from SHA-3/SHAKE functions output_len: length of hash output. Returns: Hash of the input bytes. rrrN) bytearraylenminrr1) rc_inputsuffix output_lenr$ rate_bytesblockr.routputs r Keccakr?s3. q1ul #E !Q1vJ 3v; CK&(*5u +A !Hq6z* *H +% J !%(EE 3v;  %LFL Ej1n5e$ *q.T! % E [F J +%-e !%(E  Mrc@d}d}td|dzz |dz|||dzS)a  FIPS 202 generalized instance of the SHA-3 hash function. Args: size: instance of desired SHA3 algorithm. _input: list of bytes to compute a hash from. Returns: Instance of the Keccak permutation that calculates the hash. rri@rr)r?)r9sizepaddings r SHA3rCs1 DG $/4!8VWdai HHrN)__doc__r1r?rCrrr rEs$jZ1hIr