kris/pqcrypto
1
1
Forka 0
mirror da https://github.com/henrydcase/pqc.git synced 2024-11-22 07:35:38 +00:00
Codice Problemi 1 Rilasci Wiki Attività

NTRU Prime: satisfy linter

Sfoglia il codice sorgente
This commit is contained in:
John M. Schanck 2020-09-02 13:01:19 -04:00 committato da Kris Kwiatkowski
parent b568d01ac6
commit 1a402a1917
6 ha cambiato i file con 18 aggiunte e 6 eliminazioni
Mostra statistiche Scarica il file Patch Scarica il file Diff Expand all files Collapse all files

4
crypto_kem/ntrulpr653/clean/crypto_sort_int32.c
Vedi File

@ -38,7 +38,8 @@ static void crypto_sort_smallindices(int32 *x, int32 n) {
i = 0;
j = 0;
for (q = top; q > p; q >>= 1) {
if (j != i) for (;;) {
if (j != i) {
for (;;) {
if (j == n - q) {
goto done;
}
@ -53,6 +54,7 @@ static void crypto_sort_smallindices(int32 *x, int32 n) {
break;
}
}
}
while (i + p <= n - q) {
for (j = i; j < i + p; ++j) {
int32 a = x[j + p];

4
crypto_kem/ntrulpr761/clean/crypto_sort_int32.c
Vedi File

@ -38,7 +38,8 @@ static void crypto_sort_smallindices(int32 *x, int32 n) {
i = 0;
j = 0;
for (q = top; q > p; q >>= 1) {
if (j != i) for (;;) {
if (j != i) {
for (;;) {
if (j == n - q) {
goto done;
}
@ -53,6 +54,7 @@ static void crypto_sort_smallindices(int32 *x, int32 n) {
break;
}
}
}
while (i + p <= n - q) {
for (j = i; j < i + p; ++j) {
int32 a = x[j + p];

4
crypto_kem/ntrulpr857/clean/crypto_sort_int32.c
Vedi File

@ -38,7 +38,8 @@ static void crypto_sort_smallindices(int32 *x, int32 n) {
i = 0;
j = 0;
for (q = top; q > p; q >>= 1) {
if (j != i) for (;;) {
if (j != i) {
for (;;) {
if (j == n - q) {
goto done;
}
@ -53,6 +54,7 @@ static void crypto_sort_smallindices(int32 *x, int32 n) {
break;
}
}
}
while (i + p <= n - q) {
for (j = i; j < i + p; ++j) {
int32 a = x[j + p];

4
crypto_kem/sntrup653/clean/crypto_sort_int32.c
Vedi File

@ -38,7 +38,8 @@ static void crypto_sort_smallindices(int32 *x, int32 n) {
i = 0;
j = 0;
for (q = top; q > p; q >>= 1) {
if (j != i) for (;;) {
if (j != i) {
for (;;) {
if (j == n - q) {
goto done;
}
@ -53,6 +54,7 @@ static void crypto_sort_smallindices(int32 *x, int32 n) {
break;
}
}
}
while (i + p <= n - q) {
for (j = i; j < i + p; ++j) {
int32 a = x[j + p];

4
crypto_kem/sntrup761/clean/crypto_sort_int32.c
Vedi File

@ -38,7 +38,8 @@ static void crypto_sort_smallindices(int32 *x, int32 n) {
i = 0;
j = 0;
for (q = top; q > p; q >>= 1) {
if (j != i) for (;;) {
if (j != i) {
for (;;) {
if (j == n - q) {
goto done;
}
@ -53,6 +54,7 @@ static void crypto_sort_smallindices(int32 *x, int32 n) {
break;
}
}
}
while (i + p <= n - q) {
for (j = i; j < i + p; ++j) {
int32 a = x[j + p];

4
crypto_kem/sntrup857/clean/crypto_sort_int32.c
Vedi File

@ -38,7 +38,8 @@ static void crypto_sort_smallindices(int32 *x, int32 n) {
i = 0;
j = 0;
for (q = top; q > p; q >>= 1) {
if (j != i) for (;;) {
if (j != i) {
for (;;) {
if (j == n - q) {
goto done;
}
@ -53,6 +54,7 @@ static void crypto_sort_smallindices(int32 *x, int32 n) {
break;
}
}
}
while (i + p <= n - q) {
for (j = i; j < i + p; ++j) {
int32 a = x[j + p];