commit 2248416a7222392134fd7c3869cb9f67d42d31c1
parent 304e286d076e9940409ce1f35cf287b59eac38bd
Author: Sebastian <sebastian@sebsite.pw>
Date: Tue, 5 Sep 2023 22:06:33 -0400
crypto::bigint: fix unresolved references
Signed-off-by: Sebastian <sebastian@sebsite.pw>
Diffstat:
1 file changed, 2 insertions(+), 2 deletions(-)
diff --git a/crypto/bigint/README b/crypto/bigint/README
@@ -11,8 +11,8 @@ the effective word length, i.e. the number of words that are actually used to
store the value. The value may be decoded back to its byte format by [[decode]].
Repeated modular multiplication is supported via montgomery multiplication. See
-[[to_monty]] and [[from_monty]] on how to convert from and back to this format
-and [[montymul]] for the actual multiplication operation.
+[[tomonty]] and [[frommonty]] on how to convert from and back to this format and
+[[montymul]] for the actual multiplication operation.
This is a low-level module which implements cryptographic primitives. Direct
use of cryptographic primitives is not recommended for non-experts, as
