kris/pqc
1
1
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Merge pull request #270 from PQClean/fix_newhope

Browse Source 
Fix NewHope CCA verify function
This commit is contained in:
mergify[bot] 2020-03-14 04:52:05 +00:00 committed by GitHub
commit 36283693d2
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
8 changed files with 8 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
crypto_kem/newhope1024cca/clean/reduce.c
View File

@ -5,7 +5,7 @@ static const uint32_t qinv = 12287; // -inverse_mod(p,2^18)
static const uint32_t rlog = 18;
/*************************************************
* Name: verify
* Name: montgomery_reduce
*
* Description: Montgomery reduction; given a 32-bit integer a, computes
* 16-bit integer congruent to a * R^-1 mod q,

2
crypto_kem/newhope1024cca/clean/verify.c
View File

@ -22,7 +22,7 @@ int PQCLEAN_NEWHOPE1024CCA_CLEAN_verify(const unsigned char *a, const unsigned c
r |= a[i] ^ b[i];
}
r = (-(int64_t)r) >> 63;
r = (uint64_t)(-(int64_t)r) >> 63;
return (int)r;
}

2
crypto_kem/newhope1024cpa/clean/reduce.c
View File

@ -5,7 +5,7 @@ static const uint32_t qinv = 12287; // -inverse_mod(p,2^18)
static const uint32_t rlog = 18;
/*************************************************
* Name: verify
* Name: montgomery_reduce
*
* Description: Montgomery reduction; given a 32-bit integer a, computes
* 16-bit integer congruent to a * R^-1 mod q,

2
crypto_kem/newhope1024cpa/clean/verify.c
View File

@ -22,7 +22,7 @@ int PQCLEAN_NEWHOPE1024CPA_CLEAN_verify(const unsigned char *a, const unsigned c
r |= a[i] ^ b[i];
}
r = (-(int64_t)r) >> 63;
r = (uint64_t)(-(int64_t)r) >> 63;
return (int)r;
}

2
crypto_kem/newhope512cca/clean/reduce.c
View File

@ -5,7 +5,7 @@ static const uint32_t qinv = 12287; // -inverse_mod(p,2^18)
static const uint32_t rlog = 18;
/*************************************************
* Name: verify
* Name: montgomery_reduce
*
* Description: Montgomery reduction; given a 32-bit integer a, computes
* 16-bit integer congruent to a * R^-1 mod q,

2
crypto_kem/newhope512cca/clean/verify.c
View File

@ -22,7 +22,7 @@ int PQCLEAN_NEWHOPE512CCA_CLEAN_verify(const unsigned char *a, const unsigned ch
r |= a[i] ^ b[i];
}
r = (-(int64_t)r) >> 63;
r = (uint64_t)(-(int64_t)r) >> 63;
return (int)r;
}

2
crypto_kem/newhope512cpa/clean/reduce.c
View File

@ -5,7 +5,7 @@ static const uint32_t qinv = 12287; // -inverse_mod(p,2^18)
static const uint32_t rlog = 18;
/*************************************************
* Name: verify
* Name: montgomery_reduce
*
* Description: Montgomery reduction; given a 32-bit integer a, computes
* 16-bit integer congruent to a * R^-1 mod q,

2
crypto_kem/newhope512cpa/clean/verify.c
View File

@ -22,7 +22,7 @@ int PQCLEAN_NEWHOPE512CPA_CLEAN_verify(const unsigned char *a, const unsigned ch
r |= a[i] ^ b[i];
}
r = (-(int64_t)r) >> 63;
r = (uint64_t)(-(int64_t)r) >> 63;
return (int)r;
}