Index Mathematics Conjectures nbv lettuce Widgets

mldsa44_parse_sig

stdlib/mldsa/mldsa44_parse_sig.nbv

mldsa44_parse_sig(sig)

Decode an ML-DSA-44 signature (FIPS 204 Algorithm 27) given as byte values, and check the signature response norm.

Returns (ctilde bits, the 18 bits of each v = gamma1 - z, hint bits). Malformed hints and |z| >= gamma1 - beta make the constraints unsatisfiable.

Calls
bits/bytes_to_bits, bits/from_bits, mldsa/mldsa_hint_unpack, slice, bits/to_bits_exact
Precompiles
assert_eq!, assert_lt!, clone!, field_bit_width!, len!, loop!
Used by
dilithium/mldsa/mldsa44_verify_static, mldsa/mldsa44_parse

Source

# Decode an ML-DSA-44 signature (FIPS 204 Algorithm 27) given as byte values,
# and check the signature response norm.
#
# Returns (ctilde bits, the 18 bits of each v = gamma1 - z, hint bits).
# Malformed hints and |z| >= gamma1 - beta make the constraints
# unsatisfiable.
(sig)

assert_lt! 22, field_bit_width!, "ML-DSA needs a field of at least q = 8380417 elements"
static L = 4
static GAMMA1 = 131072
static BETA = 78
assert_eq! 2420, len! sig

let sig_bits = bytes_to_bits(sig)

# sigDecode: ctilde || z with z = gamma1 - v for 18 bit v || hint
let ctilde = slice((clone! sig_bits), 0, 256)
let v_bits = slice((clone! sig_bits), 256, 18 * 256 * L)
loop! 256 * L, i {
  let v = from_bits(slice((clone! v_bits), 18 * i, 18))
  # |z| < gamma1 - beta, i.e. beta < v < 2 gamma1 - beta
  let _ = to_bits_exact(v - BETA - 1, 18)
  let _ = to_bits_exact(2 * GAMMA1 - BETA - 1 - v, 18)
}
let h = mldsa_hint_unpack(slice(sig_bits, 8 * 2336, 8 * 84))

(ctilde, v_bits, h)