Research Article
Three Strategies for Improving Shortest Vector Enumeration Using GPUs
Algorithm 2
Generation of a better basis.
| (1) | Input: the basis | | (2) | , , and | | (3) | Compute a bound using equation (8) | | (4) | whiledo | | (5) | Randomize the basis | | (6) | Reduce the basis using pruned BKZ | | (7) | | | (8) | ifthen | | (9) | | | (10) | end if | | (11) | Compute using the bound and equation (6) is the number of nodes | | (12) | ifthen | | (13) | | | (14) | end if | | (15) | ifthen | | (16) | for to do | | (17) | | | (18) | end for | | (19) | | | (20) | end if | | (21) | | | (22) | end while | | (23) | Output: the basis |
|
