| 1 |
// +build noasm arm64 |
| 2 |
|
| 3 |
package csidh |
| 4 |
|
| 5 |
import "math/bits" |
| 6 |
|
| 7 |
func mul512(r, m1 *fp, m2 uint64) { |
| 8 |
var c, h, l uint64 |
| 9 |
|
| 10 |
c, r[0] = bits.Mul64(m2, m1[0]) |
| 11 |
|
| 12 |
h, l = bits.Mul64(m2, m1[1]) |
| 13 |
r[1], c = bits.Add64(l, c, 0) |
| 14 |
c = h + c |
| 15 |
|
| 16 |
h, l = bits.Mul64(m2, m1[2]) |
| 17 |
r[2], c = bits.Add64(l, c, 0) |
| 18 |
c = h + c |
| 19 |
|
| 20 |
h, l = bits.Mul64(m2, m1[3]) |
| 21 |
r[3], c = bits.Add64(l, c, 0) |
| 22 |
c = h + c |
| 23 |
|
| 24 |
h, l = bits.Mul64(m2, m1[4]) |
| 25 |
r[4], c = bits.Add64(l, c, 0) |
| 26 |
c = h + c |
| 27 |
|
| 28 |
h, l = bits.Mul64(m2, m1[5]) |
| 29 |
r[5], c = bits.Add64(l, c, 0) |
| 30 |
c = h + c |
| 31 |
|
| 32 |
h, l = bits.Mul64(m2, m1[6]) |
| 33 |
r[6], c = bits.Add64(l, c, 0) |
| 34 |
c = h + c |
| 35 |
|
| 36 |
h, l = bits.Mul64(m2, m1[7]) |
| 37 |
r[7], _ = bits.Add64(l, c, 0) |
| 38 |
} |
| 39 |
|
| 40 |
func mul576(r *[9]uint64, m1 *fp, m2 uint64) { |
| 41 |
var c, h, l uint64 |
| 42 |
|
| 43 |
c, r[0] = bits.Mul64(m2, m1[0]) |
| 44 |
|
| 45 |
h, l = bits.Mul64(m2, m1[1]) |
| 46 |
r[1], c = bits.Add64(l, c, 0) |
| 47 |
c = h + c |
| 48 |
|
| 49 |
h, l = bits.Mul64(m2, m1[2]) |
| 50 |
r[2], c = bits.Add64(l, c, 0) |
| 51 |
c = h + c |
| 52 |
|
| 53 |
h, l = bits.Mul64(m2, m1[3]) |
| 54 |
r[3], c = bits.Add64(l, c, 0) |
| 55 |
c = h + c |
| 56 |
|
| 57 |
h, l = bits.Mul64(m2, m1[4]) |
| 58 |
r[4], c = bits.Add64(l, c, 0) |
| 59 |
c = h + c |
| 60 |
|
| 61 |
h, l = bits.Mul64(m2, m1[5]) |
| 62 |
r[5], c = bits.Add64(l, c, 0) |
| 63 |
c = h + c |
| 64 |
|
| 65 |
h, l = bits.Mul64(m2, m1[6]) |
| 66 |
r[6], c = bits.Add64(l, c, 0) |
| 67 |
c = h + c |
| 68 |
|
| 69 |
h, l = bits.Mul64(m2, m1[7]) |
| 70 |
r[7], c = bits.Add64(l, c, 0) |
| 71 |
r[8], c = bits.Add64(h, c, 0) |
| 72 |
r[8] += c |
| 73 |
} |
| 74 |
|
| 75 |
func cswap512(x, y *fp, choice uint8) { |
| 76 |
var tmp uint64 |
| 77 |
mask64 := 0 - uint64(choice) |
| 78 |
|
| 79 |
for i := 0; i < numWords; i++ { |
| 80 |
tmp = mask64 & (x[i] ^ y[i]) |
| 81 |
x[i] = tmp ^ x[i] |
| 82 |
y[i] = tmp ^ y[i] |
| 83 |
} |
| 84 |
} |
| 85 |
|
| 86 |
func mul(res, x, y *fp) { |
| 87 |
mulGeneric(res, x, y) |
| 88 |
} |
| 89 |
|
| 90 |
// mulRdc performs montgomery multiplication r = x * y mod P. |
| 91 |
// Returned result r is already reduced and in Montgomery domain. |
| 92 |
func mulRdc(r, x, y *fp) { |
| 93 |
var t fp |
| 94 |
var c uint64 |
| 95 |
|
| 96 |
mulGeneric(r, x, y) |
| 97 |
|
| 98 |
// if p <= r < 2p then r = r-p |
| 99 |
t[0], c = bits.Sub64(r[0], p[0], 0) |
| 100 |
t[1], c = bits.Sub64(r[1], p[1], c) |
| 101 |
t[2], c = bits.Sub64(r[2], p[2], c) |
| 102 |
t[3], c = bits.Sub64(r[3], p[3], c) |
| 103 |
t[4], c = bits.Sub64(r[4], p[4], c) |
| 104 |
t[5], c = bits.Sub64(r[5], p[5], c) |
| 105 |
t[6], c = bits.Sub64(r[6], p[6], c) |
| 106 |
t[7], c = bits.Sub64(r[7], p[7], c) |
| 107 |
|
| 108 |
var w = uint64(0 - uint64(c)) |
| 109 |
r[0] = ctPick64(w, r[0], t[0]) |
| 110 |
r[1] = ctPick64(w, r[1], t[1]) |
| 111 |
r[2] = ctPick64(w, r[2], t[2]) |
| 112 |
r[3] = ctPick64(w, r[3], t[3]) |
| 113 |
r[4] = ctPick64(w, r[4], t[4]) |
| 114 |
r[5] = ctPick64(w, r[5], t[5]) |
| 115 |
r[6] = ctPick64(w, r[6], t[6]) |
| 116 |
r[7] = ctPick64(w, r[7], t[7]) |
| 117 |
} |