kris/pqc
1
1
Förgrening 0
Kod Ärenden Pull-förfrågningar Släpp Wiki Aktiviteter

NTRU Prime: avoid narrowing in loop iteration

Bläddra i källkod
This commit is contained in:
John M. Schanck 2020-09-02 17:30:26 -04:00 committad av Kris Kwiatkowski
förälder 4971f4a4b0
incheckning 6047ae532a
6 ändrade filer med 12 tillägg och 6 borttagningar
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
crypto_kem/ntrulpr653/clean/crypto_sort_int32.c
Visa fil

@ -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
Visa fil

@ -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
Visa fil

@ -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
Visa fil

@ -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
Visa fil

@ -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
Visa fil

@ -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) {