初始提交：SM2/SM3/SM4/SM9 密码算法库
- SM3 哈希函数 (GB/T 32905-2013) - SM4 分组密码，支持 ECB/CBC/OFB/CFB/CTR/GCM/CCM/XTS 模式 (GB/T 32907-2016) - SM2 椭圆曲线密码 (GB/T 32918.1-5-2016) - SM9 标识密码 (GB/T 38635.1-2-2020) - 全程常量时间运算 - 支持 no_std，带 alloc 特性 - 完整的国标测试向量 - Criterion 性能基准测试
This commit is contained in:
huangxt
+262
@@ -0,0 +1,262 @@
|
||||
//! SM3 密码杂凑算法（GB/T 32905-2016）
|
||||
//!
|
||||
//! # 示例
|
||||
//!
|
||||
//! ```rust
|
||||
//! use libsmx::sm3::Sm3Hasher;
|
||||
//!
|
||||
//! // 单次哈希
|
||||
//! let digest = Sm3Hasher::digest(b"abc");
|
||||
//! assert_eq!(digest.len(), 32);
|
||||
//!
|
||||
//! // 流式哈希
|
||||
//! let mut h = Sm3Hasher::new();
|
||||
//! h.update(b"ab");
|
||||
//! h.update(b"c");
|
||||
//! let digest2 = h.finalize();
|
||||
//! assert_eq!(digest, digest2);
|
||||
//! ```
|
||||
//!
|
||||
//! # 安全说明
|
||||
//!
|
||||
//! SM3 的压缩函数不涉及密钥材料，无需常量时间保护。
|
||||
//! 如需 HMAC，请使用 [`hmac_sm3`]。
|
||||
|
||||
mod compress;
|
||||
|
||||
use compress::{compress, IV};
|
||||
|
||||
/// SM3 摘要长度（字节）
|
||||
pub const DIGEST_LEN: usize = 32;
|
||||
|
||||
/// SM3 流式哈希器
|
||||
///
|
||||
/// 支持逐步 [`update`](Sm3Hasher::update) 输入数据，最终调用
|
||||
/// [`finalize`](Sm3Hasher::finalize) 获取 32 字节摘要。
|
||||
///
|
||||
/// 实现遵循 GB/T 32905-2016。
|
||||
#[derive(Clone)]
|
||||
pub struct Sm3Hasher {
|
||||
/// 当前状态（8 × u32）
|
||||
state: [u32; 8],
|
||||
/// 未处理的字节缓冲区（最多 64 字节）
|
||||
buffer: [u8; 64],
|
||||
/// 缓冲区已填充字节数
|
||||
buf_len: usize,
|
||||
/// 已处理的总位数（用于最终填充）
|
||||
bit_len: u64,
|
||||
}
|
||||
|
||||
impl Sm3Hasher {
|
||||
/// 创建新的 SM3 哈希器（初始化为 IV）
|
||||
pub fn new() -> Self {
|
||||
Self {
|
||||
state: IV,
|
||||
buffer: [0u8; 64],
|
||||
buf_len: 0,
|
||||
bit_len: 0,
|
||||
}
|
||||
}
|
||||
|
||||
/// 一次性计算 `data` 的 SM3 摘要（便捷函数）
|
||||
pub fn digest(data: &[u8]) -> [u8; DIGEST_LEN] {
|
||||
let mut h = Self::new();
|
||||
h.update(data);
|
||||
h.finalize()
|
||||
}
|
||||
|
||||
/// 追加输入数据
|
||||
pub fn update(&mut self, data: &[u8]) {
|
||||
let mut remaining = data;
|
||||
|
||||
// 若缓冲区已有数据，先尝试填满一块
|
||||
if self.buf_len > 0 {
|
||||
let need = 64 - self.buf_len;
|
||||
let take = need.min(remaining.len());
|
||||
self.buffer[self.buf_len..self.buf_len + take].copy_from_slice(&remaining[..take]);
|
||||
self.buf_len += take;
|
||||
remaining = &remaining[take..];
|
||||
|
||||
if self.buf_len == 64 {
|
||||
let block: &[u8; 64] = self.buffer[..].try_into().unwrap();
|
||||
compress(&mut self.state, block);
|
||||
self.bit_len = self.bit_len.wrapping_add(512);
|
||||
self.buf_len = 0;
|
||||
}
|
||||
}
|
||||
|
||||
// 处理完整块
|
||||
while remaining.len() >= 64 {
|
||||
let block: &[u8; 64] = remaining[..64].try_into().unwrap();
|
||||
compress(&mut self.state, block);
|
||||
self.bit_len = self.bit_len.wrapping_add(512);
|
||||
remaining = &remaining[64..];
|
||||
}
|
||||
|
||||
// 剩余字节存入缓冲区
|
||||
if !remaining.is_empty() {
|
||||
self.buffer[..remaining.len()].copy_from_slice(remaining);
|
||||
self.buf_len = remaining.len();
|
||||
}
|
||||
}
|
||||
|
||||
/// 完成哈希，返回 32 字节摘要
|
||||
///
|
||||
/// 调用后此 hasher 不应再使用（消耗所有权的版本请用 [`finalize`](Self::finalize)）。
|
||||
pub fn finalize(mut self) -> [u8; DIGEST_LEN] {
|
||||
// 计算总位数（包含缓冲区中的字节）
|
||||
let total_bits = self.bit_len.wrapping_add((self.buf_len as u64) * 8);
|
||||
|
||||
// Padding：追加 0x80 + 零字节，使消息长度 ≡ 56 (mod 64)
|
||||
self.buffer[self.buf_len] = 0x80;
|
||||
self.buf_len += 1;
|
||||
|
||||
if self.buf_len > 56 {
|
||||
// 当前块填不下长度字段，先处理这块，再开一块
|
||||
for i in self.buf_len..64 {
|
||||
self.buffer[i] = 0;
|
||||
}
|
||||
compress(&mut self.state, &self.buffer);
|
||||
self.buffer = [0u8; 64];
|
||||
} else {
|
||||
for i in self.buf_len..56 {
|
||||
self.buffer[i] = 0;
|
||||
}
|
||||
}
|
||||
|
||||
// 最后 8 字节写入总位长（大端）
|
||||
self.buffer[56..64].copy_from_slice(&total_bits.to_be_bytes());
|
||||
compress(&mut self.state, &self.buffer);
|
||||
|
||||
// 输出：8 个 u32 大端序拼接
|
||||
let mut out = [0u8; 32];
|
||||
for (i, &v) in self.state.iter().enumerate() {
|
||||
out[i * 4..i * 4 + 4].copy_from_slice(&v.to_be_bytes());
|
||||
}
|
||||
out
|
||||
}
|
||||
}
|
||||
|
||||
impl Default for Sm3Hasher {
|
||||
fn default() -> Self {
|
||||
Self::new()
|
||||
}
|
||||
}
|
||||
|
||||
/// HMAC-SM3（GB/T 15852.1）
|
||||
///
|
||||
/// # 参数
|
||||
/// - `key`: 密钥（任意长度；若超过 64 字节则先做 SM3 压缩）
|
||||
/// - `data`: 消息数据
|
||||
///
|
||||
/// # 返回
|
||||
/// 32 字节 HMAC 值
|
||||
pub fn hmac_sm3(key: &[u8], data: &[u8]) -> [u8; DIGEST_LEN] {
|
||||
// 将 key 标准化到 64 字节（不足补零，过长先哈希）
|
||||
let mut k_pad = [0u8; 64];
|
||||
if key.len() > 64 {
|
||||
let h = Sm3Hasher::digest(key);
|
||||
k_pad[..32].copy_from_slice(&h);
|
||||
} else {
|
||||
k_pad[..key.len()].copy_from_slice(key);
|
||||
}
|
||||
|
||||
// inner = HMAC_ipad XOR k_pad，outer = HMAC_opad XOR k_pad
|
||||
let mut ipad = [0u8; 64];
|
||||
let mut opad = [0u8; 64];
|
||||
for i in 0..64 {
|
||||
ipad[i] = k_pad[i] ^ 0x36;
|
||||
opad[i] = k_pad[i] ^ 0x5C;
|
||||
}
|
||||
|
||||
// inner hash = SM3(ipad || data)
|
||||
let mut inner = Sm3Hasher::new();
|
||||
inner.update(&ipad);
|
||||
inner.update(data);
|
||||
let inner_hash = inner.finalize();
|
||||
|
||||
// outer hash = SM3(opad || inner_hash)
|
||||
let mut outer = Sm3Hasher::new();
|
||||
outer.update(&opad);
|
||||
outer.update(&inner_hash);
|
||||
outer.finalize()
|
||||
}
|
||||
|
||||
#[cfg(test)]
|
||||
mod tests {
|
||||
use super::*;
|
||||
|
||||
/// GB/T 32905-2016 附录 A 示例 1：SM3("abc")
|
||||
#[test]
|
||||
fn test_sm3_vector_abc() {
|
||||
let digest = Sm3Hasher::digest(b"abc");
|
||||
let expected =
|
||||
hex_literal("66c7f0f462eeedd9d1f2d46bdc10e4e24167c4875cf2f7a2297da02b8f4ba8e0");
|
||||
assert_eq!(digest, expected, "SM3(\"abc\") 测试向量不匹配");
|
||||
}
|
||||
|
||||
/// GB/T 32905-2016 附录 A 示例 2：SM3("abcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcd")
|
||||
#[test]
|
||||
fn test_sm3_vector_64bytes() {
|
||||
let msg = b"abcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcd";
|
||||
let digest = Sm3Hasher::digest(msg);
|
||||
let expected =
|
||||
hex_literal("debe9ff92275b8a138604889c18e5a4d6fdb70e5387e5765293dcba39c0c5732");
|
||||
assert_eq!(digest, expected, "SM3(64字节) 测试向量不匹配");
|
||||
}
|
||||
|
||||
/// 流式哈希与单次哈希结果一致
|
||||
#[test]
|
||||
fn test_sm3_streaming_equals_onceshot() {
|
||||
let data = b"hello world this is a test message for streaming";
|
||||
let once = Sm3Hasher::digest(data);
|
||||
|
||||
let mut h = Sm3Hasher::new();
|
||||
for chunk in data.chunks(7) {
|
||||
h.update(chunk);
|
||||
}
|
||||
let streamed = h.finalize();
|
||||
|
||||
assert_eq!(once, streamed, "流式哈希与一次性哈希结果不一致");
|
||||
}
|
||||
|
||||
/// 空输入测试
|
||||
#[test]
|
||||
fn test_sm3_empty() {
|
||||
let digest = Sm3Hasher::digest(b"");
|
||||
let expected =
|
||||
hex_literal("1ab21d8355cfa17f8e61194831e81a8f22bec8c728fefb747ed035eb5082aa2b");
|
||||
assert_eq!(digest, expected, "SM3(\"\") 测试向量不匹配");
|
||||
}
|
||||
|
||||
/// HMAC-SM3 基本功能测试（确保输出长度正确且可重复）
|
||||
#[test]
|
||||
fn test_hmac_sm3_basic() {
|
||||
let key = b"test-key";
|
||||
let data = b"test-message";
|
||||
let mac1 = hmac_sm3(key, data);
|
||||
let mac2 = hmac_sm3(key, data);
|
||||
assert_eq!(mac1, mac2, "HMAC-SM3 应为确定性函数");
|
||||
assert_eq!(mac1.len(), 32);
|
||||
}
|
||||
|
||||
/// HMAC-SM3：超长密钥应先哈希再使用
|
||||
#[test]
|
||||
fn test_hmac_sm3_long_key() {
|
||||
let long_key = [0x42u8; 100];
|
||||
let data = b"data";
|
||||
let mac = hmac_sm3(&long_key, data);
|
||||
assert_eq!(mac.len(), 32);
|
||||
}
|
||||
|
||||
// 辅助：从十六进制字符串构造 [u8; 32]
|
||||
fn hex_literal(s: &str) -> [u8; 32] {
|
||||
let mut out = [0u8; 32];
|
||||
let bytes: alloc::vec::Vec<u8> = (0..s.len())
|
||||
.step_by(2)
|
||||
.map(|i| u8::from_str_radix(&s[i..i + 2], 16).unwrap())
|
||||
.collect();
|
||||
out.copy_from_slice(&bytes);
|
||||
out
|
||||
}
|
||||
}
|
||||
Reference in New Issue
Block a user