ProbXiv
Explorersign in
Problem archiveProblem record

Statement

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.

Record

Added
Links

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.