diff options
| author | Dimitris Apostolou <dimitris.apostolou@icloud.com> | 2022-01-03 01:00:27 +0200 |
|---|---|---|
| committer | Tomas Mraz <tomas@openssl.org> | 2022-01-05 12:37:20 +0100 |
| commit | e304aa87b35fac5ea97c405dd3c21549faa45e78 (patch) | |
| tree | 3a9330f9259ddf98984e63db297583b5ef9dcd7b /crypto/bn/asm | |
| parent | e66c41725f03dae2b295df048312fe6d28729e98 (diff) | |
Fix typos
Reviewed-by: Tim Hudson <tjh@openssl.org>
Reviewed-by: Tomas Mraz <tomas@openssl.org>
(Merged from https://github.com/openssl/openssl/pull/17392)
Diffstat (limited to 'crypto/bn/asm')
| -rw-r--r-- | crypto/bn/asm/rsaz-2k-avx512.pl | 2 | ||||
| -rw-r--r-- | crypto/bn/asm/rsaz-3k-avx512.pl | 2 | ||||
| -rw-r--r-- | crypto/bn/asm/rsaz-4k-avx512.pl | 2 |
3 files changed, 3 insertions, 3 deletions
diff --git a/crypto/bn/asm/rsaz-2k-avx512.pl b/crypto/bn/asm/rsaz-2k-avx512.pl index aec5470387..46302e890e 100644 --- a/crypto/bn/asm/rsaz-2k-avx512.pl +++ b/crypto/bn/asm/rsaz-2k-avx512.pl @@ -88,7 +88,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. diff --git a/crypto/bn/asm/rsaz-3k-avx512.pl b/crypto/bn/asm/rsaz-3k-avx512.pl index e294afd294..5e8fa4b35b 100644 --- a/crypto/bn/asm/rsaz-3k-avx512.pl +++ b/crypto/bn/asm/rsaz-3k-avx512.pl @@ -75,7 +75,7 @@ if ($avx512ifma>0) {{{ # 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: 1560 > 1536 + 2 * 1. # # [1] Gueron, S. Efficient software implementations of modular exponentiation. diff --git a/crypto/bn/asm/rsaz-4k-avx512.pl b/crypto/bn/asm/rsaz-4k-avx512.pl index fb5bf10198..417e6dc809 100644 --- a/crypto/bn/asm/rsaz-4k-avx512.pl +++ b/crypto/bn/asm/rsaz-4k-avx512.pl @@ -72,7 +72,7 @@ if ($avx512ifma>0) {{{ # 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: 2080 > 2048 + 2 * 1. # # [1] Gueron, S. Efficient software implementations of modular exponentiation. |