def tea.cycles

bend-osdev-legacy-ciphers@0.1.0.0 · tea.bend:131

import Base

131# TEA's steps for n more cycles, sum the value before the next
132def tea.cycles(n: Nat, +s: U32, +k0: U32, +k1: U32, +k2: U32, +k3: U32) -> List<&2, LcTeaOp>:
133  match n:
134    case 0n:
135      Nil{}
136    case 1n+p:
137      +s1 = U32.add(s, tea.delta())
138      Con{LcTeaY{s1, k0, k1}, Con{LcTeaZ{s1, k2, k3}, tea.cycles(p, s1, k0, k1, k2, k3)}}