sharpetronics/liboqs
1
0
Fork 0
mirror of https://github.com/open-quantum-safe/liboqs.git synced 2025-10-08 00:03:38 -04:00
Code Issues Projects Releases Wiki Activity

Try to fix prettyprinting inconsistency.

Browse Source
This commit is contained in:
Douglas Stebila 2017-04-20 11:15:10 -04:00
parent 312c220683
commit f7b29e409e
1 changed files with 25 additions and 18 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

43
src/kex_sidh_cln16/AMD64/fp_x64.c
View File

@ -1,5 +1,5 @@
/********************************************************************************************
* SIDH: an efficient supersingular isogeny-based cryptography library for Diffie-Hellman key
* SIDH: an efficient supersingular isogeny-based cryptography library for Diffie-Hellman key
* exchange providing 128 bits of quantum security and 192 bits of classical security.
*
* Copyright (c) Microsoft Corporation. All rights reserved.
@ -16,9 +16,10 @@ extern const uint64_t p751[NWORDS_FIELD];
extern const uint64_t p751p1[NWORDS_FIELD];
extern const uint64_t p751x2[NWORDS_FIELD];
__inline void oqs_sidh_cln16_fpadd751(digit_t *a, digit_t *b, digit_t *c) { // Modular addition, c = a+b mod p751.
// Inputs: a, b in [0, 2*p751-1]
// Output: c in [0, 2*p751-1]
// Modular addition, c = a+b mod p751.
// Inputs: a, b in [0, 2*p751-1]
// Output: c in [0, 2*p751-1]
__inline void oqs_sidh_cln16_fpadd751(digit_t *a, digit_t *b, digit_t *c) {
#if (OS_TARGET == OS_WIN)
unsigned int i, carry = 0;
@ -46,9 +47,10 @@ __inline void oqs_sidh_cln16_fpadd751(digit_t *a, digit_t *b, digit_t *c) { // M
#endif
}
__inline void oqs_sidh_cln16_fpsub751(digit_t *a, digit_t *b, digit_t *c) { // Modular subtraction, c = a-b mod p751.
// Inputs: a, b in [0, 2*p751-1]
// Output: c in [0, 2*p751-1]
// Modular subtraction, c = a-b mod p751.
// Inputs: a, b in [0, 2*p751-1]
// Output: c in [0, 2*p751-1]
__inline void oqs_sidh_cln16_fpsub751(digit_t *a, digit_t *b, digit_t *c) {
#if (OS_TARGET == OS_WIN)
unsigned int i, borrow = 0;
@ -71,8 +73,9 @@ __inline void oqs_sidh_cln16_fpsub751(digit_t *a, digit_t *b, digit_t *c) { // M
#endif
}
__inline void oqs_sidh_cln16_fpneg751(digit_t *a) { // Modular negation, a = -a mod p751.
// Input/output: a in [0, 2*p751-1]
// Modular negation, a = -a mod p751.
// Input/output: a in [0, 2*p751-1]
__inline void oqs_sidh_cln16_fpneg751(digit_t *a) {
unsigned int i, borrow = 0;
for (i = 0; i < NWORDS_FIELD; i++) {
@ -80,9 +83,10 @@ __inline void oqs_sidh_cln16_fpneg751(digit_t *a) { // Modular negation, a = -a
}
}
void oqs_sidh_cln16_fpdiv2_751(digit_t *a, digit_t *c) { // Modular division by two, c = a/2 mod p751.
// Input : a in [0, 2*p751-1]
// Output: c in [0, 2*p751-1]
// Modular division by two, c = a/2 mod p751.
// Input : a in [0, 2*p751-1]
// Output: c in [0, 2*p751-1]
void oqs_sidh_cln16_fpdiv2_751(digit_t *a, digit_t *c) {
unsigned int i, carry = 0;
digit_t mask;
@ -94,7 +98,8 @@ void oqs_sidh_cln16_fpdiv2_751(digit_t *a, digit_t *c) { // Modular division by
oqs_sidh_cln16_mp_shiftr1(c, NWORDS_FIELD);
}
void oqs_sidh_cln16_fpcorrection751(digit_t *a) { // Modular correction to reduce field element a in [0, 2*p751-1] to [0, p751-1].
// Modular correction to reduce field element a in [0, 2*p751-1] to [0, p751-1].
void oqs_sidh_cln16_fpcorrection751(digit_t *a) {
unsigned int i, borrow = 0;
digit_t mask;
@ -109,7 +114,8 @@ void oqs_sidh_cln16_fpcorrection751(digit_t *a) { // Modular correction to reduc
}
}
void oqs_sidh_cln16_mp_mul(digit_t *a, digit_t *b, digit_t *c, UNUSED unsigned int nwords) { // Multiprecision multiply, c = a*b, where lng(a) = lng(b) = nwords.
// Multiprecision multiply, c = a*b, where lng(a) = lng(b) = nwords.
void oqs_sidh_cln16_mp_mul(digit_t *a, digit_t *b, digit_t *c, UNUSED unsigned int nwords) {
#if (OS_TARGET == OS_WIN)
digit_t t = 0;
@ -522,9 +528,10 @@ void oqs_sidh_cln16_mp_mul(digit_t *a, digit_t *b, digit_t *c, UNUSED unsigned i
#endif
}
void oqs_sidh_cln16_rdc_mont(oqs_sidh_cln16_dfelm_t ma, oqs_sidh_cln16_felm_t mc) { // Optimized Montgomery reduction using comba and exploiting the special form of the prime p751.
// mc = ma*mb*R^-1 mod p751, where ma,mb,mc in [0, 2*p751-1] and R = 2^768.
// ma and mb are assumed to be in Montgomery representation.
// Optimized Montgomery reduction using comba and exploiting the special form of the prime p751.
// mc = ma*mb*R^-1 mod p751, where ma,mb,mc in [0, 2*p751-1] and R = 2^768.
// ma and mb are assumed to be in Montgomery representation.
void oqs_sidh_cln16_rdc_mont(oqs_sidh_cln16_dfelm_t ma, oqs_sidh_cln16_felm_t mc) {
#if (OS_TARGET == OS_WIN)
unsigned int carry;
@ -845,4 +852,4 @@ void oqs_sidh_cln16_rdc_mont(oqs_sidh_cln16_dfelm_t ma, oqs_sidh_cln16_felm_t mc
oqs_sidh_cln16_rdc751_asm(ma, mc);
#endif
}
}