An Efficient Quantum Algorithm for a Variant of the Closest Lattice-Vector Problem · HackerPapers discussions

An Efficient Quantum Algorithm for a Variant of the Closest Lattice-Vector Problem — mentioned by VLM

Wed, 24 May 2017 19:15:02 GMT

Thats a good paper. I thought about it awhile and would retract my remarks of it being expensive and replace it with being expensive or risky. Also there's the problem of "what is the definition of post quantum" where a lot of people call 1995 or so after Shor "PQ", and maybe I'd retract that part of my comment and call it something like "way way long time in the future, which by whatever definition of post quantum, is also post quantum, lets call it 3000 AD" The trick in the big-key RSA paper is knowing how Shor works, because the average big-O is low for a randomly selected large number…

Paper and discussion history. A mention is not an endorsement.

An Efficient Quantum Algorithm for a Variant of the Closest Lattice-Vector Problem — mentioned by greeneggs

Wed, 28 Dec 2016 03:13:53 GMT

Here's an example: https://arxiv.org/abs/1611.06999 I believe the PDF link is only removed after a paper has been withdrawn. But if you click on v1, you can still access the original paper (incorrect, in this case).

Paper and discussion history. A mention is not an endorsement.

An Efficient Quantum Algorithm for a Variant of the Closest Lattice-Vector Problem — HN submission

Wed, 23 Nov 2016 07:29:22 GMT

An Efficient Quantum Algorithm for a Variant of the Closest Vector Problem

3 points; 1 discussion reply on HN. Paper and source history. A submission is not an endorsement.