Questions tagged [lenstra-lenstra-lovasz]
The Lenstra–Lenstra–Lovász (LLL) lattice basis reduction algorithm efficiently finds a short, nearly orthogonal lattice basis form an arbitrary one
4 questions with no upvoted or accepted answers
2
votes
0
answers
151
views
Howgrave-Graham lattice attack on NTRU
I am lookin for a good example to illustrate this attack on NTRU using low parameters but I failed to do that, The attack consist to use LLL reduction on A basis of NTRU Lattice, let us use the column ...
- 483
1
vote
0
answers
98
views
What is the minimal angle between two LLL reduced vectors?
What is the minimal angle between two LLL reduced vectors?
It seems it should be 60 degree as $|\mu_{i,j}| \leq \frac{1}{2}$.
If we make the upper bound of $\mu_{i,j}$ by 1/3, can we get better ...
- 229
0
votes
0
answers
55
views
Does randomization make a big difference in the output of the BKZ algorithm?
We all know that block Korkine-Zolotarev (BKZ) algorithm is essentially a deterministic lattice reduction algorithm. However, in the actual implementation, the BKZ algorithm contains some ...
- 311
0
votes
0
answers
100
views
Gram-Schmidt upper triangular basis
I'm trying to understand the Gram-Schmidt Orthogonalization process. Below, there is an explanation that a lattice basis can be described by an upper triangular vector.
It is often convenient to ...
- 31