Research Article
Three Strategies for Improving Shortest Vector Enumeration Using GPUs
Algorithm 3
Generation of GPU points.
(1) | Input: Gram–Shmidt coefficients for , and | (2) | , , , , , , , , and | (3) | , | (4) | t = n | (5) | whiledo | (6) | | (7) | ifthen | (8) | ifthen | (9) | | (10) | | (11) | ifthen | (12) | return | (13) | end if | (14) | whiledo | (15) | update and | (16) | | (17) | end while | (18) | else | (19) | ifthen | (20) | | (21) | , , | (22) | ifthen | (23) | | (24) | else | (25) | | (26) | end if | (27) | else | (28) | , | (29) | end if | (30) | end if | (31) | else | (32) | select new value using zig-zag pattern | (33) | end if | (34) | end while | (35) | Output: the sets of GPU points and |
|