bend-osdev-hashes

Releases (1)

• 0.1.0.0 indexed

Definitions (266)

sm3.bend

• def HsSm3.init
• def HsSm3.update
• def HsSm3.finalthe digest of the bytes so far: the padding, then the eight words big-endian
• def HsSm3.digestThe digest in one call

streebog.bend

• type HsStbTabA table of 256 64-bit entries, as a tree on the index's bits (opaque)
• type HsStbTabsThe eight LPS tables (opaque)
• type HsStbCvThe chaining value (opaque): h, N, Sigma, and the tables
• def hs.stb.leaves
• def hs.stb.pairs
• def hs.stb.up
• def hs.stb.root
• def hs.stb.tabthe table of 256 entries (entry i is element i)
• def hs.stb.pick
• def hs.stb.get.go
• def hs.stb.getentry i (a byte) of a table
• def hs.stb.x8the XOR of eight 64-bit values
• def hs.stb.joineight 64-bit chunks as a 512-bit vector, chunk 0 the least significant
• def hs.stb.t0.listBEGIN GENERATED by gen/streebog.py: tables T_0[b] = l(Pi(b) << 0): each entry's low and high 32 bits
• def hs.stb.t1.listT_1[b] = l(Pi(b) << 8): each entry's low and high 32 bits
• def hs.stb.t2.listT_2[b] = l(Pi(b) << 16): each entry's low and high 32 bits
• def hs.stb.t3.listT_3[b] = l(Pi(b) << 24): each entry's low and high 32 bits
• def hs.stb.t4.listT_4[b] = l(Pi(b) << 32): each entry's low and high 32 bits
• def hs.stb.t5.listT_5[b] = l(Pi(b) << 40): each entry's low and high 32 bits
• def hs.stb.t6.listT_6[b] = l(Pi(b) << 48): each entry's low and high 32 bits
• def hs.stb.t7.listT_7[b] = l(Pi(b) << 56): each entry's low and high 32 bits
• def HsStreebog.tables
• def hs.stb.c1BEGIN GENERATED by gen/streebog.py: consts
• def hs.stb.c2
• def hs.stb.c3
• def hs.stb.c4
• def hs.stb.c5
• def hs.stb.c6
• def hs.stb.c7
• def hs.stb.c8
• def hs.stb.c9
• def hs.stb.c10
• def hs.stb.c11
• def hs.stb.c12
• def hs.stb.lpsBEGIN GENERATED by gen/streebog.py: lps LPS(x): chunk k of the result is the XOR over j of T_j[byte k of chunk j]
• def hs.stb.xor
• def hs.stb.words
• def hs.stb.of_words
• def hs.stb.bit
• def hs.stb.add.gothe words of x + y + c (c a carry, 0 or 1), least significant first, modulo 2^(32 n)
• def hs.stb.add
• def hs.stb.smallthe 512-bit vector of a number below 2^32
• def hs.stb.zero
• def hs.stb.cs
• def hs.stb.roundsE's rounds: x the data so far, k the round key; then the last key added
• def hs.stb.gg_N(h, m)
• def hs.stb.compress.ofOne 64-byte block of stage 2: h = g_N(h, m), N += 512, Sigma += m
• def HsStreebog.compress(a block of another length gives zeros, as Hs.hs.block.le does: the engine passes only whole blocks)
• def hs.stb.finish.ofStage 3 on the chaining value: the last block m (its cnt bytes, then 1, then zeros), N += 8 cnt, Sigma += m, then g_0(h, N) and g_0(h, Sigma)
• def hs.stb.finish
• def hs.stb.out512the digests' bytes: all 64 (Streebog-512), or the most significant 32, bytes 32 to 63 (Streebog-256)
• def hs.stb.out256
• def hs.stb.v512The transformations on 512-bit vectors as 64-byte strings, byte i a_i (a shorter string is a number's low bytes, zeros above; bytes past 64 are ignored): LPS, and the compression function g_N(h, m) (RFC 6986, sections 7 and 8)
• def HsStreebog.lps
• def HsStreebog.g
• def HsStreebog.init512
• def HsStreebog.init256
• def HsStreebog.updatethe state after more bytes (either digest size: init chooses)
• def HsStreebog.final512the digests of the bytes so far (a state from init512 for final512, from init256 for final256)
• def HsStreebog.final256
• def HsStreebog.digest512The digests in one call
• def HsStreebog.digest256