mirror/mbedtls
1
0
Fork 0
mirror of https://github.com/Mbed-TLS/mbedtls.git synced 2025-03-25 13:43:31 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Fix typos

Browse Source 
Signed-off-by: Tom Cosgrove <tom.cosgrove@arm.com>
This commit is contained in:
Tom Cosgrove 2022-12-16 16:10:36 +00:00
parent 342d00bc22
commit f723754f6d
5 changed files with 7 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
library/bignum_core.h
View File

@ -623,7 +623,7 @@ static inline size_t mbedtls_mpi_core_montmul_working_limbs( size_t AN_limbs )
* \param[in] A The MPI to convert into Montgomery form. * \param[in] A The MPI to convert into Montgomery form.
* Must have the same number of limbs as the modulus. * Must have the same number of limbs as the modulus.
* \param[in] N The address of the modulus, which gives the size of * \param[in] N The address of the modulus, which gives the size of
* the base `R` = 2^(biL*m->limbs). * the base `R` = 2^(biL*N->limbs).
* \param[in] AN_limbs The number of limbs in \p X, \p A, \p N and \p rr. * \param[in] AN_limbs The number of limbs in \p X, \p A, \p N and \p rr.
* \param mm The Montgomery constant for \p N: -N^-1 mod 2^biL. * \param mm The Montgomery constant for \p N: -N^-1 mod 2^biL.
* This can be determined by calling * This can be determined by calling
@ -661,7 +661,7 @@ void mbedtls_mpi_core_to_mont_rep( mbedtls_mpi_uint *X,
* \param[in] A The MPI to convert from Montgomery form. * \param[in] A The MPI to convert from Montgomery form.
* Must have the same number of limbs as the modulus. * Must have the same number of limbs as the modulus.
* \param[in] N The address of the modulus, which gives the size of * \param[in] N The address of the modulus, which gives the size of
* the base `R` = 2^(biL*m->limbs). * the base `R` = 2^(biL*N->limbs).
* \param[in] AN_limbs The number of limbs in \p X, \p A and \p N. * \param[in] AN_limbs The number of limbs in \p X, \p A and \p N.
* \param mm The Montgomery constant for \p N: -N^-1 mod 2^biL. * \param mm The Montgomery constant for \p N: -N^-1 mod 2^biL.
* This can be determined by calling * This can be determined by calling

4
scripts/mbedtls_dev/bignum_common.py
View File

@ -249,7 +249,7 @@ class ModOperationCommon(OperationCommon):
#pylint: disable=abstract-method #pylint: disable=abstract-method
"""Target for bignum mod_raw test case generation.""" """Target for bignum mod_raw test case generation."""
moduli = MODULI_DEFAULT # type: List[str] moduli = MODULI_DEFAULT # type: List[str]
mongtomgery_form_a = False montgomery_form_a = False
disallow_zero_a = False disallow_zero_a = False
def __init__(self, val_n: str, val_a: str, val_b: str = "0", def __init__(self, val_n: str, val_a: str, val_b: str = "0",
@ -272,7 +272,7 @@ class ModOperationCommon(OperationCommon):
@property @property
def arg_a(self) -> str: def arg_a(self) -> str:
if self.mongtomgery_form_a: if self.montgomery_form_a:
value_a = self.to_montgomery(self.int_a) value_a = self.to_montgomery(self.int_a)
else: else:
value_a = self.int_a value_a = self.int_a

2
scripts/mbedtls_dev/bignum_core.py
View File

@ -757,7 +757,7 @@ class BignumCoreExpMod(BignumCoreTarget, bignum_common.ModOperationCommon):
test_function = "mpi_core_exp_mod" test_function = "mpi_core_exp_mod"
test_name = "Core modular exponentiation (Mongtomery form only)" test_name = "Core modular exponentiation (Mongtomery form only)"
input_style = "fixed" input_style = "fixed"
mongtomgery_form_a = True montgomery_form_a = True
def result(self) -> List[str]: def result(self) -> List[str]:
# Result has to be given in Montgomery form too # Result has to be given in Montgomery form too

2
scripts/mbedtls_dev/bignum_mod.py
View File

@ -76,7 +76,7 @@ class BignumModInvMont(bignum_common.ModOperationCommon, BignumModTarget):
arity = 1 arity = 1
suffix = True suffix = True
disallow_zero_a = True disallow_zero_a = True
mongtomgery_form_a = True montgomery_form_a = True
def result(self) -> List[str]: def result(self) -> List[str]:
result = bignum_common.invmod_positive(self.int_a, self.int_n) result = bignum_common.invmod_positive(self.int_a, self.int_n)

2
scripts/mbedtls_dev/bignum_mod_raw.py
View File

@ -64,7 +64,7 @@ class BignumModRawInvPrime(bignum_common.ModOperationCommon,
input_style = "arch_split" input_style = "arch_split"
arity = 1 arity = 1
suffix = True suffix = True
mongtomgery_form_a = True montgomery_form_a = True
disallow_zero_a = True disallow_zero_a = True
def result(self) -> List[str]: def result(self) -> List[str]: