kris/pqc
1
1
Vork 0
Code Kwesties Pull-aanvragen Publicaties Wiki Activiteit

NTRU Prime: avoid narrowing in loop iteration

Bladeren bron
This commit is contained in:
John M. Schanck 2020-09-02 17:30:26 -04:00 gecommit door Kris Kwiatkowski
bovenliggende 4971f4a4b0
commit 6047ae532a
6 gewijzigde bestanden met toevoegingen van 12 en 6 verwijderingen
Statistieken weergeven Download Patch-bestand Download Diff-bestand Expand all files Collapse all files

3
crypto_kem/ntrulpr653/clean/crypto_sort_int32.c
Bestand weergeven

@ -16,7 +16,8 @@
/* assume 2 <= n <= 0x40000000 */
void PQCLEAN_NTRULPR653_CLEAN_crypto_sort_int32(int32_t *x, long long n) {
int32 top, p, q, r, i, j;
int32 top, p, q, r, i;
long long j;
top = 1;
while (top < n - top) {

3
crypto_kem/ntrulpr761/clean/crypto_sort_int32.c
Bestand weergeven

@ -16,7 +16,8 @@
/* assume 2 <= n <= 0x40000000 */
void PQCLEAN_NTRULPR761_CLEAN_crypto_sort_int32(int32_t *x, long long n) {
int32 top, p, q, r, i, j;
int32 top, p, q, r, i;
long long j;
top = 1;
while (top < n - top) {

3
crypto_kem/ntrulpr857/clean/crypto_sort_int32.c
Bestand weergeven

@ -16,7 +16,8 @@
/* assume 2 <= n <= 0x40000000 */
void PQCLEAN_NTRULPR857_CLEAN_crypto_sort_int32(int32_t *x, long long n) {
int32 top, p, q, r, i, j;
int32 top, p, q, r, i;
long long j;
top = 1;
while (top < n - top) {

3
crypto_kem/sntrup653/clean/crypto_sort_int32.c
Bestand weergeven

@ -16,7 +16,8 @@
/* assume 2 <= n <= 0x40000000 */
void PQCLEAN_SNTRUP653_CLEAN_crypto_sort_int32(int32_t *x, long long n) {
int32 top, p, q, r, i, j;
int32 top, p, q, r, i;
long long j;
top = 1;
while (top < n - top) {

3
crypto_kem/sntrup761/clean/crypto_sort_int32.c
Bestand weergeven

@ -16,7 +16,8 @@
/* assume 2 <= n <= 0x40000000 */
void PQCLEAN_SNTRUP761_CLEAN_crypto_sort_int32(int32_t *x, long long n) {
int32 top, p, q, r, i, j;
int32 top, p, q, r, i;
long long j;
top = 1;
while (top < n - top) {

3
crypto_kem/sntrup857/clean/crypto_sort_int32.c
Bestand weergeven

@ -16,7 +16,8 @@
/* assume 2 <= n <= 0x40000000 */
void PQCLEAN_SNTRUP857_CLEAN_crypto_sort_int32(int32_t *x, long long n) {
int32 top, p, q, r, i, j;
int32 top, p, q, r, i;
long long j;
top = 1;
while (top < n - top) {