bend-collections
Search uses release 1.0.0.0 · 4,483 definitions
Definitions (4,483)
- def diagonal8_3
- def diagonal8_2
- def diagonal8_1
- def diagonal8Round 8, G on the four diagonals: (0,5,10,15), (1,6,11,12), (2,7,8,13), (3,4,9,14).
- def round8Round 8 uses the message schedule SIGMA[8], fixed at compile time.
- def column9_4
- def column9_3
- def column9_2
- def column9_1
- def column9Round 9, G on the four columns: (0,4,8,12), (1,5,9,13), (2,6,10,14), (3,7,11,15).
- def diagonal9_4
- def diagonal9_3
- def diagonal9_2
- def diagonal9_1
- def diagonal9Round 9, G on the four diagonals: (0,5,10,15), (1,6,11,12), (2,7,8,13), (3,4,9,14).
- def round9Round 9 uses the message schedule SIGMA[9], fixed at compile time.
- def column10_4
- def column10_3
- def column10_2
- def column10_1
- def column10Round 10, G on the four columns: (0,4,8,12), (1,5,9,13), (2,6,10,14), (3,7,11,15).
- def diagonal10_4
- def diagonal10_3
- def diagonal10_2
- def diagonal10_1
- def diagonal10Round 10, G on the four diagonals: (0,5,10,15), (1,6,11,12), (2,7,8,13), (3,4,9,14).
- def round10Round 10 uses the message schedule SIGMA[0], fixed at compile time.
- def column11_4
- def column11_3
- def column11_2
- def column11_1
- def column11Round 11, G on the four columns: (0,4,8,12), (1,5,9,13), (2,6,10,14), (3,7,11,15).
- def diagonal11_4
- def diagonal11_3
- def diagonal11_2
- def diagonal11_1
- def diagonal11Round 11, G on the four diagonals: (0,5,10,15), (1,6,11,12), (2,7,8,13), (3,4,9,14).
- def round11Round 11 uses the message schedule SIGMA[1], fixed at compile time.
- def rounds
- def startv = h[0..7] || IV[0..7], v12 ^= t low 64 bits, v13 ^= t high 64 bits; a block that is not the last.
- def start_lastv = h[0..7] || IV[0..7], v12 ^= t low 64 bits, v13 ^= t high 64 bits; the last block (v14 inverted).
- def finishh[i] ^= v[i] ^ v[i+8].
- def compressThe compression function F on one block of 32 little-endian words.
- def compress_lastThe compression function F on one block of 32 little-endian words.
- def bumpt += x on the 128-bit counter.
- def add64-bit addition modulo 2^64: the low halves add, their carry-out enters the high half.
- def xor
- def rot32The four fixed right rotations of BLAKE2b.
- def rot24
- def rot16
- def rot63
- def wordFour little-endian bytes as one word.
- def wordsThe bytes packed four per word, the last word zero-padded.
- def fill
- def pw
- def depth_goThe smallest d >= k with 2^d >= n.
- def depth
- def packThe packed array of the bytes.
- def initialh[0] ^= 0x01010000 ^ nn: the parameter block of an unkeyed hash with nn bytes.
- def le
- def lane_bytes
- def chain_bytesThe 64 little-endian bytes of the chaining value.
- def chainThe chaining value after every block: dd - 1 = (ll - 1) div 128 full blocks, then the last one (RFC 7693 section 3.3).
- def hashBLAKE2b with an nn-byte digest (1 <= nn <= 64) of the bytes.
- type LaneA 64-bit word as two 32-bit halves, low half first.
- type StateThe 16-word working vector v[0..15].
- type ChainThe chaining value h[0..7].
- type QuadThe four words G returns: v[a], v[b], v[c], v[d].
- type CounterThe 128-bit byte counter t as four little-endian 32-bit limbs.