kris/pqcrypto
1
1
派生 0
镜像自地址 https://github.com/henrydcase/pqc.git 已同步 2024-11-22 15:39:07 +00:00
代码 工单 1 版本发布 百科 动态

NTRU Prime: avoid narrowing in loop iteration

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

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

@ -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
查看文件

@ -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
查看文件

@ -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
查看文件

@ -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
查看文件

@ -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
查看文件

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