-
Notifications
You must be signed in to change notification settings - Fork 143
Add SLH-DSA #812
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Merged
Merged
Add SLH-DSA #812
Changes from all commits
Commits
Show all changes
3 commits
Select commit
Hold shift + click to select a range
File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
Large diffs are not rendered by default.
Oops, something went wrong.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
|
@@ -6,7 +6,8 @@ members = [ | |
"ed448", | ||
"ed25519", | ||
"lms", | ||
"rfc6979" | ||
"rfc6979", | ||
"slh-dsa" | ||
] | ||
|
||
[profile.dev] | ||
|
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,42 @@ | ||
[package] | ||
name = "slh-dsa" | ||
version = "0.0.1" | ||
edition = "2021" | ||
|
||
[dependencies] | ||
hybrid-array = {version = "0.2.0-rc.8", features = ["extra-sizes"]} | ||
typenum = {version = "1.17.0", features = ["const-generics"]} | ||
sha3 = "0.10.8" | ||
zerocopy = "0.7.32" | ||
zerocopy-derive = "0.7.32" | ||
rand_core = {version = "0.6.4"} | ||
signature = {version = "2.3.0-pre.0", features = ["rand_core"]} | ||
hmac = "0.12.1" | ||
sha2 = "0.10.8" | ||
digest = "0.10.7" | ||
|
||
[dev-dependencies] | ||
hex-literal = "0.4.1" | ||
hex = "0.4.1" | ||
num-bigint = "0.4.4" | ||
quickcheck = "1" | ||
quickcheck_macros = "1" | ||
proptest = "1.4.0" | ||
criterion = "0.5" | ||
aes = "0.8.4" | ||
cipher = "0.4.4" | ||
ctr = "0.9.2" | ||
rand_core = "0.6.4" | ||
paste = "1.0.14" | ||
rand = "0.8.5" | ||
|
||
[lib] | ||
bench = false | ||
|
||
[[bench]] | ||
name = "sign_verify" | ||
harness = false | ||
|
||
[features] | ||
alloc = [] | ||
default = ["alloc"] |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,19 @@ | ||
# SLH-DSA | ||
|
||
Pure Rust implementation of the SLH-DSA (aka SPHINCS+) signature scheme. | ||
|
||
Implemented based on the [FIPS-205 Inital Public Draft](https://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.205.ipd.pdf) | ||
|
||
## ⚠️ Security Warning | ||
|
||
The implementation contained in this crate has never been independently audited! | ||
|
||
USE AT YOUR OWN RISK! | ||
|
||
## Minimum Supported Version | ||
This crate has only been tested with Rust 1.75+ | ||
|
||
|
||
|
||
|
||
|
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,47 @@ | ||
use criterion::{black_box, criterion_group, criterion_main, Criterion}; | ||
use signature::{Keypair, Signer, Verifier}; | ||
use slh_dsa::*; | ||
|
||
pub fn sign_benchmark<P: ParameterSet>(c: &mut Criterion) { | ||
let mut rng = rand::thread_rng(); | ||
let sk = SigningKey::<P>::new(&mut rng); | ||
c.bench_function(&format!("sign: {}", P::NAME), |b| { | ||
b.iter(|| { | ||
let msg = b"Hello, world!"; | ||
let sig = sk.try_sign(msg).unwrap(); | ||
black_box(sig) | ||
}) | ||
}); | ||
} | ||
|
||
pub fn verify_benchmark<P: ParameterSet>(c: &mut Criterion) { | ||
let mut rng = rand::thread_rng(); | ||
let sk = SigningKey::<P>::new(&mut rng); | ||
let msg = b"Hello, world!"; | ||
let sig = sk.try_sign(msg).unwrap(); | ||
let vk = sk.verifying_key(); | ||
c.bench_function(&format!("verify: {}", P::NAME), |b| { | ||
b.iter(|| { | ||
let ok = vk.verify(msg, &sig); | ||
black_box(ok) | ||
}) | ||
}); | ||
} | ||
|
||
criterion_group!(name = sign_benches; | ||
config = Criterion::default().sample_size(10); | ||
targets = sign_benchmark<Shake128s>, sign_benchmark<Shake192s>, sign_benchmark<Shake256s>, | ||
sign_benchmark<Shake128f>, sign_benchmark<Shake192f>, sign_benchmark<Shake256f>, | ||
sign_benchmark<Sha2_128s>, sign_benchmark<Sha2_192s>, sign_benchmark<Sha2_256s>, | ||
sign_benchmark<Sha2_128f>, sign_benchmark<Sha2_192f>, sign_benchmark<Sha2_256f>, | ||
); | ||
|
||
criterion_group!(name = verify_benches; | ||
config = Criterion::default().sample_size(10); | ||
targets = sign_benchmark<Shake128s>, sign_benchmark<Shake192s>, sign_benchmark<Shake256s>, | ||
sign_benchmark<Shake128f>, sign_benchmark<Shake192f>, sign_benchmark<Shake256f>, | ||
sign_benchmark<Sha2_128s>, sign_benchmark<Sha2_192s>, sign_benchmark<Sha2_256s>, | ||
sign_benchmark<Sha2_128f>, sign_benchmark<Sha2_192f>, sign_benchmark<Sha2_256f>, | ||
); | ||
|
||
criterion_main!(sign_benches, verify_benches); |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,273 @@ | ||
//! Hash address definitions and serialization | ||
//! | ||
//! From FIPS-205 section 4.2: | ||
//! > An ADRS | ||
//! > consists of public values that indicate the position of the value being computed by the function. A | ||
//! > different ADRS value is used for each call to each function. In the case of PRF, this is in order | ||
//! > to generate a large number of different secret values from a single seed. In the case of Tℓ, H, and | ||
//! > F, it is used to mitigate multi-target attacks. | ||
//! | ||
//! Address fields are big-endian integers. We use zero-copyable structs to represent the addresses | ||
//! and serialize transparently to bytes using the `zerocopy` crate. | ||
//! | ||
//! Note that `tree_adrs_high` is unused in all parameter sets currently defined by FIPS-205 | ||
//! | ||
//! Rather than implementing a generic `setTypeAndClear` as specified in FIPS-205, we define specific transitions for those | ||
//! address conversions which are actually used. | ||
|
||
use hybrid_array::Array; | ||
use typenum::U22; | ||
|
||
use zerocopy::byteorder::big_endian::{U32, U64}; | ||
use zerocopy::AsBytes; | ||
use zerocopy_derive::AsBytes; | ||
|
||
/// `Address` represents a hash address as defined by FIPS-205 section 4.2 | ||
pub trait Address: AsRef<[u8]> { | ||
const TYPE_CONST: u32; | ||
|
||
#[allow(clippy::doc_markdown)] // False positive | ||
/// Returns the address as a compressed 22-byte array | ||
/// ADRSc = ADRS[3] ∥ ADRS[8 : 16] ∥ ADRS[19] ∥ ADRS[20 : 32] | ||
fn compressed(&self) -> Array<u8, U22> { | ||
let bytes = self.as_ref(); | ||
let mut compressed = Array::<u8, U22>::default(); | ||
compressed[0] = bytes[3]; | ||
compressed[1..9].copy_from_slice(&bytes[8..16]); | ||
compressed[9] = bytes[19]; | ||
compressed[10..22].copy_from_slice(&bytes[20..32]); | ||
compressed | ||
} | ||
} | ||
|
||
#[derive(Clone, AsBytes)] | ||
#[repr(C)] | ||
pub struct WotsHash { | ||
pub layer_adrs: U32, | ||
pub tree_adrs_high: U32, | ||
pub tree_adrs_low: U64, | ||
type_const: U32, // 0 | ||
pub key_pair_adrs: U32, | ||
pub chain_adrs: U32, | ||
pub hash_adrs: U32, | ||
} | ||
|
||
#[derive(Clone, AsBytes)] | ||
#[repr(C)] | ||
pub struct WotsPk { | ||
pub layer_adrs: U32, | ||
pub tree_adrs_high: U32, | ||
pub tree_adrs_low: U64, | ||
type_const: U32, // 1 | ||
pub key_pair_adrs: U32, | ||
padding: U64, // 0 | ||
} | ||
|
||
#[derive(Clone, AsBytes)] | ||
#[repr(C)] | ||
pub struct HashTree { | ||
pub layer_adrs: U32, | ||
pub tree_adrs_high: U32, | ||
pub tree_adrs_low: U64, | ||
type_const: U32, // 2 | ||
padding: U32, // 0 | ||
pub tree_height: U32, | ||
pub tree_index: U32, | ||
} | ||
|
||
#[derive(Clone, AsBytes)] | ||
#[repr(C)] | ||
pub struct ForsTree { | ||
layer_adrs: U32, // 0 | ||
pub tree_adrs_high: U32, | ||
pub tree_adrs_low: U64, | ||
type_const: U32, // 3 | ||
pub key_pair_adrs: U32, | ||
pub tree_height: U32, | ||
pub tree_index: U32, | ||
} | ||
|
||
#[derive(Clone, AsBytes)] | ||
#[repr(C)] | ||
pub struct ForsRoots { | ||
layer_adrs: U32, // 0 | ||
pub tree_adrs_high: U32, | ||
pub tree_adrs_low: U64, | ||
type_const: U32, // 4 | ||
pub key_pair_adrs: U32, | ||
padding: U64, // 0 | ||
} | ||
|
||
#[derive(Clone, AsBytes)] | ||
#[repr(C)] | ||
pub struct WotsPrf { | ||
pub layer_adrs: U32, | ||
pub tree_adrs_high: U32, | ||
pub tree_adrs_low: U64, | ||
type_const: U32, // 5 | ||
pub key_pair_adrs: U32, | ||
pub chain_adrs: U32, | ||
hash_adrs: U32, // 0 | ||
} | ||
|
||
#[derive(Clone, AsBytes)] | ||
#[repr(C)] | ||
pub struct ForsPrf { | ||
layer_adrs: U32, // 0 | ||
pub tree_adrs_high: U32, | ||
pub tree_adrs_low: U64, | ||
type_const: U32, // 6 | ||
pub key_pair_adrs: U32, | ||
tree_height: U32, // 0 | ||
pub tree_index: U32, | ||
} | ||
|
||
impl Address for WotsHash { | ||
const TYPE_CONST: u32 = 0; | ||
} | ||
impl AsRef<[u8]> for WotsHash { | ||
fn as_ref(&self) -> &[u8] { | ||
self.as_bytes() | ||
} | ||
} | ||
|
||
impl Address for WotsPk { | ||
const TYPE_CONST: u32 = 1; | ||
} | ||
impl AsRef<[u8]> for WotsPk { | ||
fn as_ref(&self) -> &[u8] { | ||
self.as_bytes() | ||
} | ||
} | ||
|
||
impl Address for HashTree { | ||
const TYPE_CONST: u32 = 2; | ||
} | ||
impl AsRef<[u8]> for HashTree { | ||
fn as_ref(&self) -> &[u8] { | ||
self.as_bytes() | ||
} | ||
} | ||
|
||
impl Address for ForsTree { | ||
const TYPE_CONST: u32 = 3; | ||
} | ||
impl AsRef<[u8]> for ForsTree { | ||
fn as_ref(&self) -> &[u8] { | ||
self.as_bytes() | ||
} | ||
} | ||
|
||
impl Address for ForsRoots { | ||
const TYPE_CONST: u32 = 4; | ||
} | ||
impl AsRef<[u8]> for ForsRoots { | ||
fn as_ref(&self) -> &[u8] { | ||
self.as_bytes() | ||
} | ||
} | ||
|
||
impl Address for WotsPrf { | ||
const TYPE_CONST: u32 = 5; | ||
} | ||
impl AsRef<[u8]> for WotsPrf { | ||
fn as_ref(&self) -> &[u8] { | ||
self.as_bytes() | ||
} | ||
} | ||
|
||
impl Address for ForsPrf { | ||
const TYPE_CONST: u32 = 6; | ||
} | ||
impl AsRef<[u8]> for ForsPrf { | ||
fn as_ref(&self) -> &[u8] { | ||
self.as_bytes() | ||
} | ||
} | ||
|
||
impl WotsHash { | ||
pub fn prf_adrs(&self) -> WotsPrf { | ||
WotsPrf { | ||
layer_adrs: self.layer_adrs, | ||
tree_adrs_low: self.tree_adrs_low, | ||
tree_adrs_high: self.tree_adrs_high, | ||
type_const: WotsPrf::TYPE_CONST.into(), | ||
key_pair_adrs: self.key_pair_adrs, | ||
chain_adrs: 0.into(), | ||
hash_adrs: 0.into(), | ||
} | ||
} | ||
|
||
pub fn pk_adrs(&self) -> WotsPk { | ||
WotsPk { | ||
layer_adrs: self.layer_adrs, | ||
tree_adrs_low: self.tree_adrs_low, | ||
tree_adrs_high: self.tree_adrs_high, | ||
type_const: WotsPk::TYPE_CONST.into(), | ||
key_pair_adrs: self.key_pair_adrs, | ||
padding: 0.into(), | ||
} | ||
} | ||
|
||
pub fn tree_adrs(&self) -> HashTree { | ||
HashTree { | ||
layer_adrs: self.layer_adrs, | ||
tree_adrs_low: self.tree_adrs_low, | ||
tree_adrs_high: self.tree_adrs_high, | ||
type_const: HashTree::TYPE_CONST.into(), | ||
padding: 0.into(), | ||
tree_height: 0.into(), | ||
tree_index: 0.into(), | ||
} | ||
} | ||
} | ||
|
||
impl ForsTree { | ||
pub fn new(tree_adrs_low: u64, key_pair_adrs: u32) -> ForsTree { | ||
ForsTree { | ||
layer_adrs: 0.into(), | ||
tree_adrs_low: tree_adrs_low.into(), | ||
tree_adrs_high: 0.into(), | ||
type_const: ForsTree::TYPE_CONST.into(), | ||
key_pair_adrs: key_pair_adrs.into(), | ||
tree_height: 0.into(), | ||
tree_index: 0.into(), | ||
} | ||
} | ||
pub fn prf_adrs(&self) -> ForsPrf { | ||
ForsPrf { | ||
layer_adrs: 0.into(), | ||
tree_adrs_low: self.tree_adrs_low, | ||
tree_adrs_high: self.tree_adrs_high, | ||
type_const: ForsPrf::TYPE_CONST.into(), | ||
key_pair_adrs: self.key_pair_adrs, | ||
tree_height: 0.into(), | ||
tree_index: self.tree_index, | ||
} | ||
} | ||
|
||
pub fn fors_roots(&self) -> ForsRoots { | ||
ForsRoots { | ||
layer_adrs: 0.into(), | ||
tree_adrs_low: self.tree_adrs_low, | ||
tree_adrs_high: self.tree_adrs_high, | ||
type_const: ForsRoots::TYPE_CONST.into(), | ||
key_pair_adrs: self.key_pair_adrs, | ||
padding: 0.into(), | ||
} | ||
} | ||
} | ||
|
||
impl Default for WotsHash { | ||
fn default() -> Self { | ||
WotsHash { | ||
layer_adrs: 0.into(), | ||
tree_adrs_low: 0.into(), | ||
tree_adrs_high: 0.into(), | ||
type_const: 0.into(), | ||
key_pair_adrs: 0.into(), | ||
chain_adrs: 0.into(), | ||
hash_adrs: 0.into(), | ||
} | ||
} | ||
} |
Oops, something went wrong.
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Uh oh!
There was an error while loading. Please reload this page.