Files
ssw-mpc/crates/mpc-core/src/hash.rs
T
admin 54781b3f83
ci / gate (push) Waiting to run
refactor: 项目改名 ssw-mpc,crate 统一到 mpc-* 前缀
- 项目与文档标题:nax-rs → ssw-mpc(尚数网-多方安全计算),二进制 nax → mpc
- 18 个 crate 及目录 nax-* → mpc-*,Rust 引用 nax_* → mpc_*
- 环境变量、C 符号、构建/部署脚本:NAX_* → MPC_*、libnax_ray.so → libmpc_ray.so
- 保留协议域分隔常量与 refs/nax 参考实现路径,维持 golden 向量与历史数据兼容
- 新增 [profile.dev] incremental=false
2026-11-05 15:06:12 +08:00

261 lines
8.4 KiB
Rust

//! SHA-256 —— commitment、种子派生、attestation 摘要。
//!
//! 手写而非引 `sha2` crate,理由与整个算子核一致:TA 里能编进去、
//! 依赖树保持为零、且没有 hidden allocation。
//!
//! 这不是"教学实现"——它按 FIPS 180-4 实现,并与 NIST 测试向量对齐
//! (见模块底部测试:空串、`"abc"`、长度跨块、百万个 `'a'`)。
/// SHA-256 单块状态(8 个 32 位字)。
#[derive(Clone, Copy)]
pub struct Sha256 {
state: [u32; 8],
buf: [u8; 64],
buf_len: usize,
total_len: u64,
}
const K: [u32; 64] = [
0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,
0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,
0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,
0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,
0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,
0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,
0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,
0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2,
];
const H0: [u32; 8] = [
0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19,
];
impl Default for Sha256 {
fn default() -> Self {
Self::new()
}
}
impl Sha256 {
/// 新建一个空摘要器。
pub const fn new() -> Self {
Self { state: H0, buf: [0u8; 64], buf_len: 0, total_len: 0 }
}
/// 追加数据。
pub fn update(&mut self, mut data: &[u8]) {
self.total_len = self.total_len.wrapping_add(data.len() as u64);
// 先把已有的半块填满
if self.buf_len > 0 {
let want = 64 - self.buf_len;
let take = core::cmp::min(want, data.len());
self.buf[self.buf_len..self.buf_len + take].copy_from_slice(&data[..take]);
self.buf_len += take;
data = &data[take..];
if self.buf_len == 64 {
let block = self.buf;
self.compress(&block);
self.buf_len = 0;
}
}
// 整块直接压
while data.len() >= 64 {
let mut block = [0u8; 64];
block.copy_from_slice(&data[..64]);
self.compress(&block);
data = &data[64..];
}
// 尾巴留缓冲
if !data.is_empty() {
self.buf[..data.len()].copy_from_slice(data);
self.buf_len = data.len();
}
}
/// 取摘要(消耗 self)。
pub fn finalize(mut self) -> [u8; 32] {
let bit_len = self.total_len.wrapping_mul(8);
// 手工做 0x80 填充 + 64 位大端长度尾,不能走 update(那会把 total_len 算进去)。
// 剩余空间 < 56 字节时补一块(64),否则补两块(128)。
let used = self.buf_len;
let mut tail = [0u8; 128];
tail[..used].copy_from_slice(&self.buf[..used]);
tail[used] = 0x80;
let total = if used < 56 { 64 } else { 128 };
tail[total - 8..total].copy_from_slice(&bit_len.to_be_bytes());
for i in 0..total / 64 {
let mut block = [0u8; 64];
block.copy_from_slice(&tail[i * 64..(i + 1) * 64]);
self.compress(&block);
}
let mut out = [0u8; 32];
for (i, w) in self.state.iter().enumerate() {
out[i * 4..i * 4 + 4].copy_from_slice(&w.to_be_bytes());
}
out
}
fn compress(&mut self, block: &[u8; 64]) {
let mut w = [0u32; 64];
for i in 0..16 {
w[i] = u32::from_be_bytes([
block[i * 4],
block[i * 4 + 1],
block[i * 4 + 2],
block[i * 4 + 3],
]);
}
for i in 16..64 {
let s0 = w[i - 15].rotate_right(7) ^ w[i - 15].rotate_right(18) ^ (w[i - 15] >> 3);
let s1 = w[i - 2].rotate_right(17) ^ w[i - 2].rotate_right(19) ^ (w[i - 2] >> 10);
w[i] = w[i - 16]
.wrapping_add(s0)
.wrapping_add(w[i - 7])
.wrapping_add(s1);
}
let [mut a, mut b, mut c, mut d, mut e, mut f, mut g, mut h] = self.state;
for i in 0..64 {
let s1 = e.rotate_right(6) ^ e.rotate_right(11) ^ e.rotate_right(25);
let ch = (e & f) ^ ((!e) & g);
let t1 = h
.wrapping_add(s1)
.wrapping_add(ch)
.wrapping_add(K[i])
.wrapping_add(w[i]);
let s0 = a.rotate_right(2) ^ a.rotate_right(13) ^ a.rotate_right(22);
let maj = (a & b) ^ (a & c) ^ (b & c);
let t2 = s0.wrapping_add(maj);
h = g;
g = f;
f = e;
e = d.wrapping_add(t1);
d = c;
c = b;
b = a;
a = t1.wrapping_add(t2);
}
self.state[0] = self.state[0].wrapping_add(a);
self.state[1] = self.state[1].wrapping_add(b);
self.state[2] = self.state[2].wrapping_add(c);
self.state[3] = self.state[3].wrapping_add(d);
self.state[4] = self.state[4].wrapping_add(e);
self.state[5] = self.state[5].wrapping_add(f);
self.state[6] = self.state[6].wrapping_add(g);
self.state[7] = self.state[7].wrapping_add(h);
}
}
/// 一次性哈希。
pub fn sha256(data: &[u8]) -> [u8; 32] {
let mut h = Sha256::new();
h.update(data);
h.finalize()
}
/// 按 label 从主种子派生 32 字节子种子。
///
/// 语义等价于 `SHA256(master || 0x00 || label)`,但用长度前缀
/// 让 `("ab","c")` 与 `("a","bc")` 不撞车。
pub fn derive(master: &[u8; 32], label: &[u8]) -> [u8; 32] {
let mut h = Sha256::new();
h.update(master);
h.update(&(label.len() as u32).to_be_bytes());
h.update(label);
h.finalize()
}
/// 两段式派生:`derive(derive(master, a), b)` 的便捷写法。
pub fn derive2(master: &[u8; 32], a: &[u8], b: &[u8]) -> [u8; 32] {
let s = derive(master, a);
derive(&s, b)
}
#[cfg(test)]
mod tests {
use super::*;
fn hex(d: &[u8]) -> heapless_hex::Hex {
heapless_hex::Hex(d.to_vec())
}
/// 极简 hex 打印,避免为测试引 hex crate
mod heapless_hex {
pub struct Hex(pub Vec<u8>);
impl core::fmt::Display for Hex {
fn fmt(&self, f: &mut core::fmt::Formatter<'_>) -> core::fmt::Result {
for b in &self.0 {
write!(f, "{b:02x}")?;
}
Ok(())
}
}
}
#[test]
fn nist_empty() {
assert_eq!(
hex(&sha256(b"")).to_string(),
"e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855"
);
}
#[test]
fn nist_abc() {
assert_eq!(
hex(&sha256(b"abc")).to_string(),
"ba7816bf8f01cfea414140de5dae2223b00361a396177a9cb410ff61f20015ad"
);
}
#[test]
fn nist_two_block() {
assert_eq!(
hex(&sha256(b"abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq")).to_string(),
"248d6a61d20638b8e5c026930c3e6039a33ce45964ff2167f6ecedd419db06c1"
);
}
#[test]
fn nist_million_a() {
let mut h = Sha256::new();
let chunk = vec![b'a'; 1000];
for _ in 0..1000 {
h.update(&chunk);
}
assert_eq!(
hex(&h.finalize()).to_string(),
"cdc76e5c9914fb9281a1c7e284d73e67f1809a48a497200e046d39ccc7112cd0"
);
}
/// 分块喂入必须与一次性喂入等价(边界:55/56/63/64/65 字节)
#[test]
fn streaming_equals_oneshot() {
for n in [0usize, 1, 55, 56, 57, 63, 64, 65, 127, 128, 129, 200] {
let data: Vec<u8> = (0..n).map(|i| (i % 251) as u8).collect();
let one = sha256(&data);
let mut h = Sha256::new();
for chunk in data.chunks(7) {
h.update(chunk);
}
assert_eq!(one, h.finalize(), "len={n}");
}
}
#[test]
fn derive_is_length_prefixed() {
let m = [7u8; 32];
assert_ne!(derive2(&m, b"ab", b"c"), derive2(&m, b"a", b"bc"));
}
}