mirror of
https://github.com/saymrwulf/curve25519-dalek-source.git
synced 2026-09-04 20:24:10 +00:00
Minor documentation fixes.
This commit is contained in:
parent
f8cb7197f9
commit
b9710d59f2
3 changed files with 3 additions and 3 deletions
2
Makefile
2
Makefile
|
|
@ -1,4 +1,4 @@
|
|||
FEATURES := nightly yolocrypto avx2_backend
|
||||
FEATURES := nightly simd_backend
|
||||
|
||||
doc:
|
||||
cargo rustdoc --features "$(FEATURES)" -- --html-in-header docs/assets/rustdoc-include-katex-header.html
|
||||
|
|
|
|||
|
|
@ -58,7 +58,7 @@ use prelude::*;
|
|||
/// However, if `w` is too big and `n` is not too big, then `(2^w/2)*A` could dominate.
|
||||
/// Therefore, the optimal choice of `w` grows slowly as `n` grows.
|
||||
///
|
||||
/// This algorithm is adapted from section 4 of https://eprint.iacr.org/2012/549.pdf.
|
||||
/// This algorithm is adapted from section 4 of <https://eprint.iacr.org/2012/549.pdf>.
|
||||
pub struct Pippenger;
|
||||
|
||||
#[cfg(any(feature = "alloc", feature = "std"))]
|
||||
|
|
|
|||
|
|
@ -159,7 +159,7 @@ impl MontgomeryPoint {
|
|||
|
||||
/// Perform the Elligator2 mapping to a Montgomery point.
|
||||
///
|
||||
/// See https://tools.ietf.org/html/draft-irtf-cfrg-hash-to-curve-10#section-6.7.1
|
||||
/// See <https://tools.ietf.org/html/draft-irtf-cfrg-hash-to-curve-10#section-6.7.1>
|
||||
//
|
||||
// TODO Determine how much of the hash-to-group API should be exposed after the CFRG
|
||||
// draft gets into a more polished/accepted state.
|
||||
|
|
|
|||
Loading…
Reference in a new issue