bend-osdev-crypto

Releases (1)

• 0.1.0.0 indexed

Definitions (678)

vmac.bend

• def cr.vm.adda + b mod 2^128
• def cr.vm.w
• def cr.vm.multhe 128-bit product of two 64-bit words
• def cr.vm.at.go
• def cr.vm.at
• def cr.vm.u32be
• def cr.vm.u32le
• def cr.vm.w64bethe big-endian and the little-endian 64-bit word at byte i
• def cr.vm.w64le
• def cr.vm.word
• def cr.vm.wordsn big-endian (be True) or little-endian 64-bit words of xs from byte i
• def cr.vm.bytes64
• def cr.vm.encb
• def cr.vm.e
• def cr.vm.kdf.go
• def cr.vm.kdfthe first n bytes of the KDF for index
• def cr.vm.nh.go
• def cr.vm.mod126
• def cr.vm.nhthe NH value of a piece of 1 to 128 bytes (zero-padded to 16 bytes)
• def cr.vm.m63
• def cr.vm.fold.pick
• def cr.vm.foldx below 2^128 to a value congruent mod p127 below 2^127 + 1
• def cr.vm.norm.pick
• def cr.vm.normx (below 2^127 + 1) fully reduced mod p127
• def cr.vm.reduce
• def cr.vm.lt
• def cr.vm.mm3the 256-bit number with 64-bit words x3, x2, x1, x0 reduced mod p127: (x >> 127) + (x mod 2^127)
• def cr.vm.mm2
• def cr.vm.mm1
• def cr.vm.mm0
• def cr.vm.mulmod.gothe 256-bit p3 2^128 + (p1 + p2) 2^64 + p0, reduced mod p127
• def cr.vm.mulmoda * b mod p127, for a, b below 2^127
• def cr.vm.poly.goL2 over the NH values of the pieces ps, from y; an empty message is the poly key itself
• def cr.vm.poly
• def cr.vm.p64
• def cr.vm.f64x below 2^128, folded: hi 2^64 + lo = hi 257 + lo (mod p64)
• def cr.vm.sub64.pick
• def cr.vm.last64
• def cr.vm.mod64x below 2^130 (as hi, lo) mod p64
• def cr.vm.digit
• type CrVmQrq (the quotient's two low base-2^32 digits) and r, for (x2, x1, x0) divided by 2^32 - 1, one digit at a time
• def cr.vm.qr
• def cr.vm.l3.go
• def cr.vm.l3L3 of y (below p127) under k1, k2
• type CrVmIterone VHASH word's keys: the NH key words, the poly key, the L3 pair
• def cr.vm.l3keys.pick
• def cr.vm.l3keysthe L3 pairs of 64-bit words of the KDF bytes xs both below p64, in order
• def cr.vm.nth.pair
• def cr.vm.u128.of
• def cr.vm.pmaskthe poly key mask: each 32-bit field's top 3 bits cleared
• def cr.vm.iter.of
• type CrVmacKeyA VMAC key: the cipher's key schedule and each VHASH word's keys (one for a 64-bit tag, two for a 128-bit tag; opaque)
• def cr.vm.iters
• def cr.vm.key.of
• def CrVmac.keyThe key for tags of words 64-bit words (1: VMAC-64, 2: VMAC-128) from a raw key the cipher takes (KDF index 224's first 16 pairs give the L3 keys)
• def cr.vm.vhashVHASH: one word per iter
• def cr.vm.sumthe tag words: pad word + hash word, mod 2^64
• def cr.vm.len
• def cr.vm.pdf.last
• def cr.vm.pdf.pick
• def cr.vm.pdfthe PDF's words for a nonce of 1 to 15 bytes
• def cr.vm.tag.go
• def cr.vm.tag.pick
• def CrVmac.tagThe tag of m under a nonce of 1 to bsize - 1 bytes (CrBadNonceLength otherwise): 8 bytes for a VMAC-64 key, 16 for a VMAC-128 key
• def cr.vm.or_empty
• def cr.vm.macAs a MAC: the nonce is the message's first nlen bytes (1 to bsize - 1), the data the rest; a message too short for its nonce has the empty tag
• def CrVmac.mac
• def CrVmac.verifywhether t is m's tag (every byte compared; the MAC interface's default)

xcbc.bend

• def cr.xcbc.encbone block of bytes encrypted (a string the format refuses stays as it is)
• def cr.xcbc.e
• type CrXcbcKeyAn XCBC key: the cipher's key schedule of K1, and K2 and K3 as bytes
• def cr.xcbc.key.of
• def CrXcbc.keyThe key from a raw key K (refused when the cipher refuses K or K1)
• def cr.xcbc.full
• def cr.xcbc.gothe CBC-MAC over the pieces from E = e; the last piece is whole or short
• def CrXcbc.macThe tag of m (one block)
• def CrXcbc.mac96RFC 3566's AES-XCBC-MAC-96: the tag's first 12 bytes
• def CrXcbc.verifywhether t is m's tag (every byte compared; the MAC interface's default)