Low Weight Discrete Logarithm and Subset Sum in $$2^{0.65n}$$ with Polynomial Memory

Post quantum cryptographic constructions

“…The best classical algorithm runs with time complexityÕ(2 0.291n ) and the same space complexity [BCJ11]. Recently, the space complexity is improved to polynomial while the time complexity isÕ(2 0.645n ) [EM20]. The best quantum algorithm for the density 1 subset sum problem has complexityÕ(2 0.209n ) [LL19].…”