Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion emp-tool/src/lpn.rs
Original file line number Diff line number Diff line change
Expand Up @@ -9,7 +9,7 @@ use rayon::prelude::*;
/// `x` - is a `F_{2^128}` vector with length `k`.\
/// `e` - is a `F_{2^128}` vector with length `n`.\
/// Given a vector `x` and `e`, compute `y = Ax + e`.\
/// Note that in the standard LPN problem, `x` is a binary vector, `e` is a sparse binary vector. The way we difined here is a more generic way in term of computing `y`.
/// Note that in the standard LPN problem, `x` is a binary vector, `e` is a sparse binary vector. The way we defined here is a more generic way in term of computing `y`.
pub struct Lpn<const D: usize> {
// The seed to generate the random sparse matrix A.
seed: Block,
Expand Down
2 changes: 1 addition & 1 deletion emp-tool/src/utils.rs
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
//! Useful utils used in the libraries

/// Pack a bit vector into a byte vecotr.
/// Pack a bit vector into a byte vector.
#[inline(always)]
pub fn pack_bits_to_bytes(bits: &[bool]) -> Vec<u8> {
let nbytes = (bits.len() - 1) / 8 + 1;
Expand Down