~/bend-docscommunity

proofs/crypto/sha/padding.bend checks

raw source on the hub · import 0xe4067e0d858024083f36a7abe7281e89/proofs/crypto/sha/padding.bend as Padding

2 imports
import Base
import ../../../spec/crypto/sha.bend as F

Laws

law zeros_correct provedsource · line 6 · raw

@r:Nat -> {Nat.mod(Nat.sub(119n, r), 64n) == 0xe4067e0d858024083f36a7abe7281e89/spec/crypto/sha.zero_count(r) : Nat}

Universal bridge from implementation modular padding to the FIPS piecewise rule. Every Nat is either one of 0..119 or 120+p. Each branch closes by reduction.