diff --git a/arm/curve25519/edwards25519_scalarmulbase.S b/arm/curve25519/edwards25519_scalarmulbase.S index 8c9d0f9193..89e98494ac 100644 --- a/arm/curve25519/edwards25519_scalarmulbase.S +++ b/arm/curve25519/edwards25519_scalarmulbase.S @@ -577,7 +577,7 @@ S2N_BN_SYMBOL(edwards25519_scalarmulbase): // (X,Y,Z,T), representing an affine point on the edwards25519 curve // (x,y) via x = X/Z, y = Y/Z and x * y = T/Z (so X * Y = T * Z). // In comments B means the standard basepoint (x,4/5) = -// (0x216....f25d51a,0x0x6666..666658). +// (0x216....f25d51a,0x6666..666658). // // Initialize accumulator "acc" to either 0 or 2^251 * B depending on // bit 251 of the (reduced) scalar. That leaves bits 0..250 to handle. diff --git a/arm/curve25519/edwards25519_scalarmulbase_alt.S b/arm/curve25519/edwards25519_scalarmulbase_alt.S index 03e5598f2c..e89d58b378 100644 --- a/arm/curve25519/edwards25519_scalarmulbase_alt.S +++ b/arm/curve25519/edwards25519_scalarmulbase_alt.S @@ -419,7 +419,7 @@ S2N_BN_SYMBOL(edwards25519_scalarmulbase_alt): // (X,Y,Z,T), representing an affine point on the edwards25519 curve // (x,y) via x = X/Z, y = Y/Z and x * y = T/Z (so X * Y = T * Z). // In comments B means the standard basepoint (x,4/5) = -// (0x216....f25d51a,0x0x6666..666658). +// (0x216....f25d51a,0x6666..666658). // // Initialize accumulator "acc" to either 0 or 2^251 * B depending on // bit 251 of the (reduced) scalar. That leaves bits 0..250 to handle. diff --git a/arm/curve25519/edwards25519_scalarmuldouble.S b/arm/curve25519/edwards25519_scalarmuldouble.S index 00ea37eaaf..d6fc9121f9 100644 --- a/arm/curve25519/edwards25519_scalarmuldouble.S +++ b/arm/curve25519/edwards25519_scalarmuldouble.S @@ -1514,7 +1514,7 @@ edwards25519_scalarmuldouble_loop: // form amounts to swapping the first two fields and negating the third. // The negation does not always fully reduce even mod 2^256-38 in the zero // case, instead giving -0 = 2^256-38. But that is fine since the result is -// always fed to a multipliction inside the "pepadd" function below that +// always fed to a multiplication inside the "pepadd" function below that // handles any 256-bit input. cmp cf, xzr diff --git a/arm/curve25519/edwards25519_scalarmuldouble_alt.S b/arm/curve25519/edwards25519_scalarmuldouble_alt.S index ad05eae1fb..54cebef997 100644 --- a/arm/curve25519/edwards25519_scalarmuldouble_alt.S +++ b/arm/curve25519/edwards25519_scalarmuldouble_alt.S @@ -1298,7 +1298,7 @@ edwards25519_scalarmuldouble_alt_loop: // form amounts to swapping the first two fields and negating the third. // The negation does not always fully reduce even mod 2^256-38 in the zero // case, instead giving -0 = 2^256-38. But that is fine since the result is -// always fed to a multipliction inside the "pepadd" function below that +// always fed to a multiplication inside the "pepadd" function below that // handles any 256-bit input. cmp cf, xzr diff --git a/arm/generic/bignum_copy_row_from_table_8n_neon.S b/arm/generic/bignum_copy_row_from_table_8n_neon.S index 80db20d6b6..e17ebceeff 100644 --- a/arm/generic/bignum_copy_row_from_table_8n_neon.S +++ b/arm/generic/bignum_copy_row_from_table_8n_neon.S @@ -3,7 +3,7 @@ // ---------------------------------------------------------------------------- // Given table: uint64_t[height*width], copy table[idx*width...(idx+1)*width-1] -// into z[0..width-1]. width must be a mutiple of 8. +// into z[0..width-1]. width must be a multiple of 8. // This function is constant-time with respect to the value of `idx`. This is // achieved by reading the whole table and using the bit-masking to get the // `idx`-th row. diff --git a/arm/p384/Makefile b/arm/p384/Makefile index d3feb070c7..2390e53e44 100644 --- a/arm/p384/Makefile +++ b/arm/p384/Makefile @@ -3,7 +3,7 @@ # SPDX-License-Identifier: Apache-2.0 OR ISC ############################################################################# -# If actually on an ARM8 machine, just use the GNU assmbler (as). Otherwise +# If actually on an ARM8 machine, just use the GNU assembler (as). Otherwise # use a cross-assembling version so that the code can still be assembled # and the proofs checked against the object files (though you won't be able # to run code without additional emulation infrastructure). The aarch64 diff --git a/arm/p521/Makefile b/arm/p521/Makefile index b8ad763c35..9121b81013 100644 --- a/arm/p521/Makefile +++ b/arm/p521/Makefile @@ -3,7 +3,7 @@ # SPDX-License-Identifier: Apache-2.0 OR ISC ############################################################################# -# If actually on an ARM8 machine, just use the GNU assmbler (as). Otherwise +# If actually on an ARM8 machine, just use the GNU assembler (as). Otherwise # use a cross-assembling version so that the code can still be assembled # and the proofs checked against the object files (though you won't be able # to run code without additional emulation infrastructure). The aarch64 diff --git a/x86_att/curve25519/edwards25519_scalarmulbase.S b/x86_att/curve25519/edwards25519_scalarmulbase.S index c44e31724c..950b8dc649 100644 --- a/x86_att/curve25519/edwards25519_scalarmulbase.S +++ b/x86_att/curve25519/edwards25519_scalarmulbase.S @@ -431,7 +431,7 @@ edwards25519_scalarmulbase_standard: // (X,Y,Z,T), representing an affine point on the edwards25519 curve // (x,y) via x = X/Z, y = Y/Z and x * y = T/Z (so X * Y = T * Z). // In comments B means the standard basepoint (x,4/5) = -// (0x216....f25d51a,0x0x6666..666658). +// (0x216....f25d51a,0x6666..666658). // // Initialize accumulator "acc" to either 0 or 2^251 * B depending on // bit 251 of the (reduced) scalar. That leaves bits 0..250 to handle. diff --git a/x86_att/curve25519/edwards25519_scalarmulbase_alt.S b/x86_att/curve25519/edwards25519_scalarmulbase_alt.S index 00b91fe1aa..db7fa574b5 100644 --- a/x86_att/curve25519/edwards25519_scalarmulbase_alt.S +++ b/x86_att/curve25519/edwards25519_scalarmulbase_alt.S @@ -507,7 +507,7 @@ edwards25519_scalarmulbase_alt_standard: // (X,Y,Z,T), representing an affine point on the edwards25519 curve // (x,y) via x = X/Z, y = Y/Z and x * y = T/Z (so X * Y = T * Z). // In comments B means the standard basepoint (x,4/5) = -// (0x216....f25d51a,0x0x6666..666658). +// (0x216....f25d51a,0x6666..666658). // // Initialize accumulator "acc" to either 0 or 2^251 * B depending on // bit 251 of the (reduced) scalar. That leaves bits 0..250 to handle. diff --git a/x86_att/curve25519/edwards25519_scalarmuldouble.S b/x86_att/curve25519/edwards25519_scalarmuldouble.S index 7e5fd2b41c..eabdcd461b 100644 --- a/x86_att/curve25519/edwards25519_scalarmuldouble.S +++ b/x86_att/curve25519/edwards25519_scalarmuldouble.S @@ -1528,7 +1528,7 @@ edwards25519_scalarmuldouble_loop: // form amounts to swapping the first two fields and negating the third. // The negation does not always fully reduce even mod 2^256-38 in the zero // case, instead giving -0 = 2^256-38. But that is fine since the result is -// always fed to a multipliction inside the "pepadd" function below that +// always fed to a multiplication inside the "pepadd" function below that // handles any 256-bit input. movq cf, %rdi diff --git a/x86_att/curve25519/edwards25519_scalarmuldouble_alt.S b/x86_att/curve25519/edwards25519_scalarmuldouble_alt.S index 4cd5d1e63f..b285d57ff5 100644 --- a/x86_att/curve25519/edwards25519_scalarmuldouble_alt.S +++ b/x86_att/curve25519/edwards25519_scalarmuldouble_alt.S @@ -1645,7 +1645,7 @@ edwards25519_scalarmuldouble_alt_loop: // form amounts to swapping the first two fields and negating the third. // The negation does not always fully reduce even mod 2^256-38 in the zero // case, instead giving -0 = 2^256-38. But that is fine since the result is -// always fed to a multipliction inside the "pepadd" function below that +// always fed to a multiplication inside the "pepadd" function below that // handles any 256-bit input. movq cf, %rdi