bend-osdev-legacy-ciphers
Search uses release 0.1.0.0 · 970 definitions
Definitions (970)
- def bf.pi.listBEGIN GENERATED by gen/tables.py: tables the first 1042 words of the fractional part of pi: P1 ..
- type LcBfTabsThe four S-boxes (internal)
- def bf.fF
- type LcBfOpThe steps of the cipher (internal)
- def bf.op
- def bf.unop
- def bf.run
- def bf.unrun
- def bf.opsthe steps from a P-array of 18 words (n = 16 rounds, then the final)
- def bf.slicen words of xs from offset i
- def bf.cyclethe key bytes repeated cyclically: n bytes, from the rest of the key ys (the whole key xs when ys runs out)
- def bf.pkeyP xored with the key bytes as big-endian words
- def bf.set_pP entries i and i + 1 replaced by h and l
- def bf.set_sentry j of the S-box k (0 to 3) set to v
- type LcBfStThe state of the key schedule: the P-array, the S-boxes, and the last block encrypted
- def bf.fill_p.go
- def bf.fill_pP1 ..
- def bf.fill_s.go
- def bf.fill_sthe S-box k's 256 entries replaced, two at a time (128 encryptions)
- type LcBlowfishKeyA Blowfish key: the steps of the cipher (opaque; built by LcBlowfish.key)
- def bf.tablesthe S-boxes before the key: pi's words 18 to 1041
- def bf.key.of
- def bf.key
- def bf.key.pick
- def LcBlowfish.keya key of 4 to 56 bytes (32 to 448 bits, as the specification says)
- def LcBlowfish.key_anya key of 1 to 72 bytes: the key schedule takes up to 72 (18 words of P), and some test sets use keys shorter than 4 bytes
- def LcBlowfish.encrypt
- def LcBlowfish.decrypt
- def cam.sbox1.listSBOX1 (RFC 3713, 2.4.4); SBOX2, SBOX3 and SBOX4 are derived from it
- def cam.rotl8a byte rotated left by n
- def cam.genthe entries of a table for x = i, i + 1, .., i + n - 1
- def cam.s1.raw
- def cam.s1
- def cam.s2SBOX2[x] = SBOX1[x] <<< 1, SBOX3[x] = SBOX1[x] <<< 7, SBOX4[x] = SBOX1[x <<< 1]
- def cam.s3
- def cam.s4
- type LcCamTabsThe four S-boxes as tables, built once per key (internal)
- def cam.tables
- def cam.hi
- def cam.lo
- def cam.p
- def cam.f
- def cam.flFL and FL^-1 (RFC 3713, 2.4.2)
- def cam.flinv
- def cam.whiteD1 ^= a, D2 ^= b
- type LcCamOpThe steps of the cipher (internal)
- def cam.op
- def cam.unopthe step undone
- def cam.run
- def cam.unrun
- def cam.xor128
- def cam.rotwq rotated left by 32 bits, and by r bits (r = 0 to 31)
- def cam.rotb
- def cam.rotws
- def cam.rolq <<< n
- def cam.top
- def cam.bot
- def cam.hthe high and the low 64 bits of q <<< n
- def cam.l
- def cam.sigma
- def cam.mixD2 ^= F(D1, Sigma_i); D1 ^= F(D2, Sigma_(i+1)), on the 128-bit value D1:D2
- def cam.kaKA from KL and KR
- def cam.kbKB from KA and KR
- def cam.ops128the steps for a 128-bit key
- def cam.ops256the steps for a 192- or 256-bit key
- type LcCamelliaKeyA Camellia key: the steps of the cipher (opaque; built by LcCamellia.key)
- def cam.wword i (big-endian) of the key bytes xs
- def cam.key128
- def cam.key256.go
- def cam.key192a 192-bit key's KR is its last 64 bits, then their complement
- def cam.key256
- def cam.key.pickthe key for 16, 24 or 32 bytes, if n says so
- def LcCamellia.keya 16-, 24- or 32-byte key (Camellia-128, -192, -256, by its length)
- def LcCamellia.key128a key of exactly this size
- def LcCamellia.key192
- def LcCamellia.key256
- def LcCamellia.encrypt
- def LcCamellia.decrypt