mirror of
https://github.com/saymrwulf/curve25519-dalek-source.git
synced 2026-09-04 20:24:10 +00:00
chore: typo fix (#608)
This commit is contained in:
parent
ba7a073487
commit
0b45e00ad5
3 changed files with 3 additions and 3 deletions
|
|
@ -123,7 +123,7 @@ major series.
|
|||
|
||||
### 2.1.2
|
||||
|
||||
* Multiple documenation typo fixes.
|
||||
* Multiple documentation typo fixes.
|
||||
* Fix `alloc` feature working with stable rust.
|
||||
|
||||
### 2.1.1
|
||||
|
|
|
|||
|
|
@ -351,7 +351,7 @@ This computation requires 25 `vpmadd52luq` and 25 `vpmadd52huq`
|
|||
operations. For 256-bit vectors, IFMA operations execute on an
|
||||
i3-8121U with latency 4 cycles, throughput 0.5 cycles, so executing 50
|
||||
instructions requires 25 cycles' worth of throughput. Accumulating
|
||||
terms with coefficient \\(1\\) and \\(2\\) seperately means that the
|
||||
terms with coefficient \\(1\\) and \\(2\\) separately means that the
|
||||
longest dependency chain has length 5, so the critical path has length
|
||||
20 cycles and the bottleneck is throughput.
|
||||
|
||||
|
|
|
|||
|
|
@ -22,7 +22,7 @@ const VERIFY_ALLOWED_EDGECASES: &[Flag] = &[
|
|||
const VERIFY_STRICT_ALLOWED_EDGECASES: &[Flag] =
|
||||
&[Flag::LowOrderComponentA, Flag::LowOrderComponentR];
|
||||
|
||||
/// Each variant describes a specfiic edge case that can occur in an Ed25519 signature. Refer to
|
||||
/// Each variant describes a specific edge case that can occur in an Ed25519 signature. Refer to
|
||||
/// the test vector [README][] for more info.
|
||||
///
|
||||
/// [README]: https://github.com/C2SP/CCTV/blob/5ea85644bd035c555900a2f707f7e4c31ea65ced/ed25519vectors/README.md
|
||||
|
|
|
|||
Loading…
Reference in a new issue