code wiki / _hdl_build / nx_device_cert_gate.nx
nx_device_cert_gate.nx
buildroot/runtime/_hdl_build/nx_device_cert_gate.nx
about
nx_device_cert_gate.nx -- gate for device provisioning (nx_device_cert). Proves the challenge-response device
auth over the KAT-verified ed25519: a provisioned device signs a fresh challenge and is admitted; a TAMPERED
signature, an UNKNOWN device, a REPLAY (wrong challenge), and an IMPERSONATION (signing with a different key)
are all rejected. Anchors on the RFC 8032 test vector so the crypto is proven GENUINE, not a stub. Positive
AND negative controls. Appends "ACCESSGATE row=nx_device_cert device-provision ... verdict=PASS" to
knowledge/status/access_gate.log on all-pass. license_tier: ORIGINAL
dependencies 3 imports · 0 importers
imports: nx_device_cert.nxnx_ed25519_signature.nxnx_syscalls.nx
imported by: nobody (leaf or entry point)
call flow from main pre-order; caps 40 nodes / depth 6 declared; ↻ = already shown
structs
| none |
consts
| none |
functions
| 11 | func dg_w(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(1,s,n); return 0 } |
| 12 | func dg_num(v: i64) -> i64 { let bb: *u8=sys_mmap(28); var m: i64=v; if m<0{m=0-m}; let t: *u8=sys_mmap(28); var k: i64=0; if m==0{t[0]=48 as u8;k=1}; while m>0{t[k]=(48+(m%10)) as u8;m=m/10;k=k+1}; var i: i64=0; while i<k{bb[i]=t[k-1-i];i=i+1}; sys_write(1,bb,k); return 0 } |
| 13 | func dg_cat(dst: *u8, off: i64, s: *u8) -> i64 { var o: i64=off; var k: i64=0; while s[k]!=(0 as u8){dst[o]=s[k];o=o+1;k=k+1} return o } called by 1: main |
| 14 | func dg_catnum(dst: *u8, off: i64, v: i64) -> i64 { var o: i64=off; let t: *u8=sys_mmap(28); var m: i64=v; if m<0{m=0-m}; var k: i64=0; if m==0{t[0]=48 as u8;k=1}; while m>0{t[k]=(48+(m%10)) as u8;m=m/10;k=k+1}; var i: i64=0; while i<k{dst[o]=t[k-1-i];o=o+1;i=i+1} return o } |
| 15 | func dg_row(id: i64, ok: i64, what: *u8) -> i64 { dg_w("DCROW " as *u8); dg_num(id); dg_w(" " as *u8); if ok==1 { dg_w("PASS " as *u8) } else { dg_w("FAIL " as *u8) } dg_w(what); dg_w("\n" as *u8); return ok } |
| 16 | func dg_slen(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} return n } called by 1: main |
| 18 | func dg_hb(c: i64) -> i64 { if c>=0x30 { if c<=0x39 { return c-0x30 } } if c>=0x61 { if c<=0x66 { return c-0x61+10 } } if c>=0x41 { if c<=0x46 { return c-0x41+10 } } return 0 } called by 1: dg_hex2bytes |
| 19 | func dg_hex2bytes(hex: *u8, nbytes: i64, out: *u8) -> i64 { var i: i64=0; while i<nbytes { let hi: i64=dg_hb(hex[i*2] as i64); let lo: i64=dg_hb(hex[i*2+1] as i64); out[i]=((hi<<4)|lo) as u8; i=i+1 } return 0 } |
| 20 | func dg_byteeq(a: *u8, b: *u8, n: i64) -> i64 { var i: i64=0; while i<n { if a[i]!=b[i] { return 0 } i=i+1 } return 1 } called by 1: main |
| 22 | func main() -> i64 |