kris/pqcrypto
1
1
Fork 0
鏡像自 https://github.com/henrydcase/pqc.git synced 2024-11-22 07:35:38 +00:00
程式碼 問題 1 版本發布 Wiki 動態

NTRU Prime: change prototype for clean/crypto_sort_int32

瀏覽代碼
This commit is contained in:
John M. Schanck 2020-09-02 16:41:51 -04:00
父節點 4f6e00ed69
當前提交 8a372ad2e8
共有 12 個檔案被更改，包括 12 行新增 和 12 行删除
顯示統計資料 下載 Patch 檔 下載差異檔 展開所有檔案 折疊所有檔案

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

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

2
crypto_kem/ntrulpr653/clean/crypto_sort_int32.h
查看文件

@ -4,5 +4,5 @@
#include <stdint.h>
#define PQCLEAN_NTRULPR653_CLEAN_crypto_sort_int32_BYTES 4
void PQCLEAN_NTRULPR653_CLEAN_crypto_sort_int32(int32_t *x, long long n);
void PQCLEAN_NTRULPR653_CLEAN_crypto_sort_int32(int32_t *x, int32_t n);
#endif

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

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

2
crypto_kem/ntrulpr761/clean/crypto_sort_int32.h
查看文件

@ -4,5 +4,5 @@
#include <stdint.h>
#define PQCLEAN_NTRULPR761_CLEAN_crypto_sort_int32_BYTES 4
void PQCLEAN_NTRULPR761_CLEAN_crypto_sort_int32(int32_t *x, long long n);
void PQCLEAN_NTRULPR761_CLEAN_crypto_sort_int32(int32_t *x, int32_t n);
#endif

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

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

2
crypto_kem/ntrulpr857/clean/crypto_sort_int32.h
查看文件

@ -4,5 +4,5 @@
#include <stdint.h>
#define PQCLEAN_NTRULPR857_CLEAN_crypto_sort_int32_BYTES 4
void PQCLEAN_NTRULPR857_CLEAN_crypto_sort_int32(int32_t *x, long long n);
void PQCLEAN_NTRULPR857_CLEAN_crypto_sort_int32(int32_t *x, int32_t n);
#endif

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

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

2
crypto_kem/sntrup653/clean/crypto_sort_int32.h
查看文件

@ -4,5 +4,5 @@
#include <stdint.h>
#define PQCLEAN_SNTRUP653_CLEAN_crypto_sort_int32_BYTES 4
void PQCLEAN_SNTRUP653_CLEAN_crypto_sort_int32(int32_t *x, long long n);
void PQCLEAN_SNTRUP653_CLEAN_crypto_sort_int32(int32_t *x, int32_t n);
#endif

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

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

2
crypto_kem/sntrup761/clean/crypto_sort_int32.h
查看文件

@ -4,5 +4,5 @@
#include <stdint.h>
#define PQCLEAN_SNTRUP761_CLEAN_crypto_sort_int32_BYTES 4
void PQCLEAN_SNTRUP761_CLEAN_crypto_sort_int32(int32_t *x, long long n);
void PQCLEAN_SNTRUP761_CLEAN_crypto_sort_int32(int32_t *x, int32_t n);
#endif

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

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

2
crypto_kem/sntrup857/clean/crypto_sort_int32.h
查看文件

@ -4,5 +4,5 @@
#include <stdint.h>
#define PQCLEAN_SNTRUP857_CLEAN_crypto_sort_int32_BYTES 4
void PQCLEAN_SNTRUP857_CLEAN_crypto_sort_int32(int32_t *x, long long n);
void PQCLEAN_SNTRUP857_CLEAN_crypto_sort_int32(int32_t *x, int32_t n);
#endif