Quantum lower bounds for group-theoretic problems in the generic group model
We would like to solidify the credentials of group-theoretic cryptography as post-quantum by developing lower bounds for the quantum complexity of problems arising in group theory. It would be especially nice to develop such a bound for the vectorisation problem, since this underpins many hardness problems in the area.
References
Primary source
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.