use elliptic_curve::ff::PrimeField;
use p256::Scalar;
use sha2::{Digest, Sha256};
pub fn hash_to_scalar(cert: &[u8]) -> Scalar {
let mut digest = Sha256::digest(cert);
let mut prev_lsb = 0u8;
for b in digest.iter_mut() {
let cur_lsb = *b & 1;
*b = (*b >> 1) | (prev_lsb << 7);
prev_lsb = cur_lsb;
}
Scalar::from_repr(digest).unwrap() }
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn truncation_drops_the_lowest_bit_not_the_highest() {
let e = hash_to_scalar(b"ECQV");
let expected =
hex::decode("20D6D7C521BBC6C8661FD13EB680443639329E11D5FCC550AC714E8BA08E2053")
.unwrap();
let arr: [u8; 32] = expected.try_into().unwrap();
assert_eq!(e, Scalar::from_repr(arr.into()).unwrap());
}
#[test]
fn truncation_is_not_reduction_mod_n() {
use elliptic_curve::ops::Reduce;
let cert = b"ECQV";
let e = hash_to_scalar(cert);
let reduced = Scalar::reduce(&Sha256::digest(cert));
assert_ne!(
e, reduced,
"Hn must truncate (right shift), never reduce mod n"
);
}
}