Skip to content

Fix manual_div_ceil Clippy lint #492

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.

Sign up for GitHub

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
newpavlov merged 1 commit into from
Mar 12, 2025
Merged

Fix manual_div_ceil Clippy lint #492

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
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
12 changes: 6 additions & 6 deletions src/algorithms/pss.rs
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -25,7 +25,7 @@ pub(crate) fn emsa_pss_encode(
// See [1], section 9.1.1
let h_len = hash.output_size();
let s_len = salt.len();
let em_len = (em_bits + 7) / 8;
let em_len = em_bits.div_ceil(8);

// 1. If the length of M is greater than the input limitation for the
// hash function (2^61 - 1 octets for SHA-1), output "message too
Expand Down Expand Up @@ -100,7 +100,7 @@ where
// See [1], section 9.1.1
let h_len = <D as Digest>::output_size();
let s_len = salt.len();
let em_len = (em_bits + 7) / 8;
let em_len = em_bits.div_ceil(8);

// 1. If the length of M is greater than the input limitation for the
// hash function (2^61 - 1 octets for SHA-1), output "message too
Expand Down Expand Up @@ -235,8 +235,8 @@ pub(crate) fn emsa_pss_verify(
key_bits: usize,
) -> Result<()> {
let em_bits = key_bits - 1;
let em_len = (em_bits + 7) / 8;
let key_len = (key_bits + 7) / 8;
let em_len = em_bits.div_ceil(8);
let key_len = key_bits.div_ceil(8);
let h_len = hash.output_size();

let em = &mut em[key_len - em_len..];
Expand Down Expand Up @@ -288,8 +288,8 @@ where
D: Digest + FixedOutputReset,
{
let em_bits = key_bits - 1;
let em_len = (em_bits + 7) / 8;
let key_len = (key_bits + 7) / 8;
let em_len = em_bits.div_ceil(8);
let key_len = key_bits.div_ceil(8);
let h_len = <D as Digest>::output_size();

let em = &mut em[key_len - em_len..];
Expand Down
2 changes: 1 addition & 1 deletion src/traits/keys.rs
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -17,7 +17,7 @@ pub trait PublicKeyParts {
/// Returns the modulus size in bytes. Raw signatures and ciphertexts for
/// or by this public key will have the same size.
fn size(&self) -> usize {
(self.n().bits() as usize + 7) / 8
(self.n().bits() as usize).div_ceil(8)
}

/// Returns the parameters for montgomery operations.
Expand Down