kris/pqc
1
1
派生 0
代码 工单 合并请求 版本发布 百科 动态

NTRU Prime: satisfy linter

浏览代码
这个提交包含在：
John M. Schanck 2020-09-02 13:01:19 -04:00 提交者 Kris Kwiatkowski
父节点 b568d01ac6
当前提交 1a402a1917
共有 6 个文件被更改，包括 18 次插入 和 6 次删除
显示统计 下载 Patch 文件 下载 Diff 文件 展开所有文件 折叠所有文件

4
crypto_kem/ntrulpr653/clean/crypto_sort_int32.c
查看文件

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

4
crypto_kem/ntrulpr761/clean/crypto_sort_int32.c
查看文件

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

4
crypto_kem/ntrulpr857/clean/crypto_sort_int32.c
查看文件

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

4
crypto_kem/sntrup653/clean/crypto_sort_int32.c
查看文件

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

4
crypto_kem/sntrup761/clean/crypto_sort_int32.c
查看文件

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

4
crypto_kem/sntrup857/clean/crypto_sort_int32.c
查看文件

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