Before revision:  This improves over the previously fastest classical (which is also the fastest quantum) algorithm due to [ ADRS15 ] that has a time and space complexity 2^{n+o(n)}. \bullet A classical algorithm for SVP that runs in time 2^{ 1.73 n+o(n)} time and 2^{0.5n+o(n)} space.
After revision:  This improves over the previously fastest classical (which is also the fastest quantum) algorithm due to [ ADRSD15 ] that has a time and space complexity 2^{n+o(n)}. \bullet A classical algorithm for SVP that runs in time 2^{ 1.73 n+o(n)} time and 2^{0.5n+o(n)} space.