-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathDualDeepLLL.go
83 lines (71 loc) · 1.76 KB
/
DualDeepLLL.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
package glatl
import (
"math"
"github.com/satoshin-des/glal/mat"
"github.com/satoshin-des/glal/vec"
)
// dual version of DeepLLL
//
// panic if delta < 1/4 or delta > 1
//
// M. Yasuda, J. Yamaguchi, M. Ooka, S. Nakamura. Development of a dual version of DeepBKZ and its application to solving the LWE challenge.(2018)
func DualDeepLLL(b Lattice, delta float64) {
if delta < 0.25 || delta > 1 {
panic("reduction parameter must be in [1/4, 1]")
}
var d float64
var q float64
var l int
var rho float64
dualRho := vec.ZeroVec(b.NumRows)
gsoB, mu := GSO(b)
dualMu := mat.Identity(b.NumRows)
for k := b.NumRows - 2; k >= 0; {
dualMu.At[k][k] = 1.0
for j := k + 1; j < b.NumRows; j++ {
dualMu.At[k][j] = 0
for i := k; i < j; i++ {
dualMu.At[k][j] -= mu.At[j][i] * dualMu.At[k][i]
}
if dualMu.At[k][j] > 0.5 || dualMu.At[k][j] < -0.5 {
q = math.Round(dualMu.At[k][j])
for i := 0; i < b.NumCols; i++ {
b.Basis[j][i] += int64(q) * b.Basis[k][i]
}
for i := j; i < b.NumRows; i++ {
dualMu.At[k][i] -= q * dualMu.At[j][i]
}
for i := 0; i <= k; i++ {
mu.At[j][i] += q * mu.At[k][i]
}
}
}
d = 0
l = b.NumRows - 1
for j := k; j < b.NumRows; j++ {
d += dualMu.At[k][j] * dualMu.At[k][j] / gsoB.At[j]
}
for l > k {
if gsoB.At[l]*d < delta {
rho = 1.0 / gsoB.At[k]
vec.SetZero(dualRho)
dualRho.At[k] = rho
for h := k + 1; h < b.NumRows; h++ {
rho += dualMu.At[k][h] * dualMu.At[k][h] / gsoB.At[h]
dualRho.At[h] = rho
}
DualDeepIns(b, k, l)
updateDualDeepInsGSO(k, l, gsoB, mu, dualMu, dualRho)
if l < b.NumRows-2 {
k = l + 1
} else {
k = b.NumRows - 1
}
} else {
d -= dualMu.At[k][l] * dualMu.At[k][l] / gsoB.At[l]
l--
}
}
k--
}
}