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 src/aead/chacha/tests.rs
Original file line number Diff line number Diff line change
Expand Up @@ -31,7 +31,7 @@ const MAX_ALIGNMENT_AND_OFFSET_SUBSET: (usize, usize) =

#[test]
fn chacha20_test_default() {
// Always use `MAX_OFFSET` if we hav assembly code.
// Always use `MAX_OFFSET` if we have assembly code.
let max_offset = if cfg!(any(
all(target_arch = "aarch64", target_endian = "little"),
all(target_arch = "arm", target_endian = "little"),
Expand Down
2 changes: 1 addition & 1 deletion src/cpu/x86.rs
Original file line number Diff line number Diff line change
Expand Up @@ -22,7 +22,7 @@ use core::ops::{BitAnd, Shl};
mod abi_assumptions {
use core::mem::size_of;

// TOOD: Support targets that do not have SSE and SSE2 enabled, such as
// TODO: Support targets that do not have SSE and SSE2 enabled, such as
// x86_64-unknown-linux-none. See
// https://github.com/briansmith/ring/issues/1793#issuecomment-1793243725,
// https://github.com/briansmith/ring/issues/1832,
Expand Down
2 changes: 1 addition & 1 deletion src/cpu/x86_64.rs
Original file line number Diff line number Diff line change
Expand Up @@ -22,7 +22,7 @@ use core::ops::{BitAnd, Shl};
mod abi_assumptions {
use core::mem::size_of;

// TOOD: Support targets that do not have SSE and SSE2 enabled, such as
// TODO: Support targets that do not have SSE and SSE2 enabled, such as
// x86_64-unknown-linux-none. See
// https://github.com/briansmith/ring/issues/1793#issuecomment-1793243725,
// https://github.com/briansmith/ring/issues/1832,
Expand Down
2 changes: 1 addition & 1 deletion src/ec/suite_b/mod.rs
Original file line number Diff line number Diff line change
Expand Up @@ -21,7 +21,7 @@ use crate::{arithmetic::montgomery::*, cpu, ec, error, io::der, pkcs8};
// yQ**2 = xQ**3 + axQ + b in GF(p), where the arithmetic is performed modulo
// p."
//
// That is, verify that (x, y) is on the curve, which is true iif:
// That is, verify that (x, y) is on the curve, which is true iff:
//
// y**2 == x**3 + a*x + b (mod q)
//
Expand Down
2 changes: 1 addition & 1 deletion src/ec/suite_b/ops/mod.rs
Original file line number Diff line number Diff line change
Expand Up @@ -457,7 +457,7 @@ impl PublicScalarOps {
pub struct PrivateScalarOps {
pub scalar_ops: &'static ScalarOps,

oneRR_mod_n: PublicScalar<RR>, // 1 * R**2 (mod n). TOOD: Use One<RR>.
oneRR_mod_n: PublicScalar<RR>, // 1 * R**2 (mod n). TODO: Use One<RR>.
scalar_inv_to_mont: fn(a: Scalar<R>, cpu: cpu::Features) -> Scalar<R>,
}

Expand Down