mirror of
https://github.com/monero-project/monero.git
synced 2025-08-06 05:04:32 -04:00
miscellaneous crypto updates
This commit is contained in:
parent
9367b432f6
commit
b1bce857c9
5 changed files with 18 additions and 6 deletions
|
@ -38,7 +38,6 @@ DISABLE_VS_WARNINGS(4146 4244)
|
|||
|
||||
/* Predeclarations */
|
||||
|
||||
static void fe_mul(fe, const fe, const fe);
|
||||
static void fe_sq(fe, const fe);
|
||||
static void ge_madd(ge_p1p1 *, const ge_p3 *, const ge_precomp *);
|
||||
static void ge_msub(ge_p1p1 *, const ge_p3 *, const ge_precomp *);
|
||||
|
@ -72,7 +71,7 @@ uint64_t load_4(const unsigned char *in)
|
|||
h = 0
|
||||
*/
|
||||
|
||||
static void fe_0(fe h) {
|
||||
void fe_0(fe h) {
|
||||
h[0] = 0;
|
||||
h[1] = 0;
|
||||
h[2] = 0;
|
||||
|
@ -375,7 +374,7 @@ Can get away with 11 carries, but then data flow is much deeper.
|
|||
With tighter constraints on inputs can squeeze carries into int32.
|
||||
*/
|
||||
|
||||
static void fe_mul(fe h, const fe f, const fe g) {
|
||||
void fe_mul(fe h, const fe f, const fe g) {
|
||||
int32_t f0 = f[0];
|
||||
int32_t f1 = f[1];
|
||||
int32_t f2 = f[2];
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue