summaryrefslogtreecommitdiffstats
path: root/crypto/bn/asm/rsaz-2k-avx512.pl
diff options
context:
space:
mode:
Diffstat (limited to 'crypto/bn/asm/rsaz-2k-avx512.pl')
-rw-r--r--crypto/bn/asm/rsaz-2k-avx512.pl2
1 files changed, 1 insertions, 1 deletions
diff --git a/crypto/bn/asm/rsaz-2k-avx512.pl b/crypto/bn/asm/rsaz-2k-avx512.pl
index 80bc4a51b2..2ae7f70b72 100644
--- a/crypto/bn/asm/rsaz-2k-avx512.pl
+++ b/crypto/bn/asm/rsaz-2k-avx512.pl
@@ -97,7 +97,7 @@ ___
# specified in the original algorithm as according to the Lemma 1 from the paper
# [2], the result will be always < 2*m and can be used as a direct input to
# the next AMM iteration. This post-condition is true, provided the correct
-# parameter |s| (notion of the Lemma 1 from [2]) is choosen, i.e. s >= n + 2 * k,
+# parameter |s| (notion of the Lemma 1 from [2]) is chosen, i.e. s >= n + 2 * k,
# which matches our case: 1040 > 1024 + 2 * 1.
#
# [1] Gueron, S. Efficient software implementations of modular exponentiation.