mirror/btstack
1
0
Fork 0
mirror of https://github.com/bluekitchen/btstack.git synced 2025-03-21 04:21:03 +00:00
Code Issues Packages Projects Releases Wiki Activity

3rd-party/micro-ecc: avoid // in /* .. */ comment

Browse Source
This commit is contained in:
Matthias Ringwald 2022-11-02 15:29:54 +01:00
parent 9a43dfa4f0
commit c824d78c0a
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
3rd-party/micro-ecc/uECC.c vendored
View File

@ -1001,7 +1001,7 @@ static void vli_mmod_fast(uint64_t *RESTRICT result, uint64_t *RESTRICT product)
#elif uECC_CURVE == uECC_secp256r1
/* Computes result = product % curve_p
from http://www.nsa.gov/ia/_files/nist-routines.pdf */
from www.nsa.gov/ia/_files/nist-routines.pdf */
#if uECC_WORD_SIZE == 1
static void vli_mmod_fast(uint8_t *RESTRICT result, uint8_t *RESTRICT product) {
uint8_t tmp[uECC_BYTES];
@ -1491,7 +1491,7 @@ static void vli_modSquare_fast(uECC_word_t *result, const uECC_word_t *left) {
#define EVEN(vli) (!(vli[0] & 1))
/* Computes result = (1 / input) % mod. All VLIs are the same size.
See "From Euclid's GCD to Montgomery Multiplication to the Great Divide"
https://labs.oracle.com/techrep/2001/smli_tr-2001-95.pdf */
labs.oracle.com/techrep/2001/smli_tr-2001-95.pdf */
#if !asm_modInv
static void vli_modInv(uECC_word_t *result, const uECC_word_t *input, const uECC_word_t *mod) {
uECC_word_t a[uECC_WORDS], b[uECC_WORDS], u[uECC_WORDS], v[uECC_WORDS];
@ -1570,7 +1570,7 @@ static cmpresult_t EccPoint_isZero(const EccPoint *point) {
}
/* Point multiplication algorithm using Montgomery's ladder with co-Z coordinates.
From http://eprint.iacr.org/2011/338.pdf
From eprint.iacr.org/2011/338.pdf
*/
/* Double in place */