bend-osdev-legacy-ciphers

Releases (1)

• 0.1.0.0 indexed

Definitions (970)

check.bend

• def twofish_cbc
• def serpent_cbc
• def aria_cbc
• def cast6_cbc
• def last8
• def same64
• def tdes_cbc_big
• def cbc64
• def blowfish_cbc
• def cast5_cbc
• def tea_cbc
• def xtea_cbc
• def fcrypt_cbc
• def mainBEGIN GENERATED by gen/vectors.py: check

des.bend

• def des.ip.tableIP
• def des.fp.tableIP^-1
• def des.p.tableP
• def des.pc1c.tablePC-1, the bits of C_0
• def des.pc1d.tablePC-1, the bits of D_0
• def des.pc2a.tablePC-2, its first 24 entries
• def des.pc2b.tablePC-2, its last 24 entries
• def des.shiftsthe left shifts of the key schedule
• def des.s1S1: row r (0 to 3), column c (0 to 15) is entry 16r + c
• def des.s2S2: row r (0 to 3), column c (0 to 15) is entry 16r + c
• def des.s3S3: row r (0 to 3), column c (0 to 15) is entry 16r + c
• def des.s4S4: row r (0 to 3), column c (0 to 15) is entry 16r + c
• def des.s5S5: row r (0 to 3), column c (0 to 15) is entry 16r + c
• def des.s6S6: row r (0 to 3), column c (0 to 15) is entry 16r + c
• def des.s7S7: row r (0 to 3), column c (0 to 15) is entry 16r + c
• def des.s8S8: row r (0 to 3), column c (0 to 15) is entry 16r + c
• def des.bitsthe bits of a block, bit 1 (the top bit of hi) first
• def des.pickthe bits a table picks: entry t is bit t of bs
• type LcDesHalvesThe two halves of the Feistel network (internal)
• def des.halves64 bits as halves: the first 32 (most significant first) are l
• def des.block
• def des.hbits
• def des.ip
• def des.fp
• def des.swap
• def des.perm32a permutation of a 32-bit word (P): entry t is bit t of x
• def des.sboxthe S-box entry for 6 bits b1 ..
• def des.sp.gothe SP table of S-box s, its output placed sh bits up (28 for S1 ..
• def des.sp
• def des.sp1
• def des.sp2
• def des.sp3
• def des.sp4
• def des.sp5
• def des.sp6
• def des.sp7
• def des.sp8
• type LcDesSpthe eight SP tables, built once per key (internal)
• def des.tables
• type LcDesRka round key: a 48-bit subkey as its eight 6-bit groups, K's bits 1 to 6 first, and the SP tables (internal)
• def des.egroup i of E(R): bits 4i ..
• def des.f
• def des.step
• def des.unstepthe round undone
• def des.roundsthe rounds of ks, first to last
• def des.unroundsthe rounds of ks undone, last to first
• def des.kbit.pick
• def des.picks64the bits that tab picks from the 64-bit key hi:lo, appended to acc
• def des.cdbit.pick
• def des.picks56the bits that tab picks from the 56 bits C:D (28 each), appended to acc
• def des.rot28
• def des.group
• def des.subkeyK_i = PC-2(C_i D_i), as its eight groups
• def des.scheduleK_1 ..
• type LcDesKeyA DES key: its sixteen round keys (opaque; built by LcDes.key)
• def des.key_ofthe key whose 64 bits (parity bits included, and ignored) are hi:lo
• def des.key.pick
• def LcDes.keyan 8-byte key (the parity bits, the low bit of each byte, are not checked)
• def LcDes.encrypt
• def LcDes.decrypt

fcrypt.bend

• def fc.s0.listBEGIN GENERATED by gen/tables.py: tables S0 (the FCrypt specification)
• def fc.s1.listS1 (the FCrypt specification)
• def fc.s2.listS2 (the FCrypt specification)
• def fc.s3.listS3 (the FCrypt specification)
• type LcFcTabsThe four S-boxes, built once per key (internal)
• def fc.tables
• type LcFcRkA round key: W_i and the S-boxes (internal)
• def fc.fF(R, W_i)
• def fc.vthe 56-bit value of the key bytes xs (parity bits dropped), onto v
• def fc.rot11v rotated right by 11 within 56 bits
• def fc.rks
• type LcFcryptKeyAn FCrypt key: the sixteen round keys (opaque; built by LcFcrypt.key)
• def fc.key.pick
• def LcFcrypt.keyan 8-byte key (the parity bits are ignored)
• def LcFcrypt.encrypt
• def LcFcrypt.decrypt

legacy_ciphers.bend

• type LcErrorEvery failure the package reports
• type LcBlock64A 64-bit block: two 32-bit words, big-endian (hi holds bytes 0 to 3, byte 0 in its top 8 bits).
• def LcBlock64.zero
• def LcBlock64.xor
• def lc.rotl
• def lc.bytebyte n of x, counting from the least significant (n = 0 to 3)
• def lc.bethe word with bytes a (most significant), b, c, d
• def lc.lethe word with bytes a (least significant), b, c, d
• def lc.bitbit i of x (0 the least significant), as 0 or 1
• def lc.atelement n of a list of words (0 past the end)