Showing math.NTShow all
2 papers · 1 filter
math.NT2026
NP-hardness of SVP in Euclidean Space
Daqing Wan
In 1981, van Emde Boas conjectured that computing a shortest non-zero vector of a lattice in a Euclidean space is -hard. In this paper, we prove this conjecture, there…
math.NT2004
On the List and Bounded Distance Decodibility of the Reed-Solomon Codes
Qi Cheng, Daqing Wan
In this paper show that the list and bounded-distance decoding problems of certain bounds for the Reed-Solomon code are at least as hard as the discrete logarithm problem over fini…