Hardness of the discrete iteration problem
Statement
Let be the vector space with the second-order multilinear operation defined in the source, and let
For a fixed vector and a positive integer , write
Hardness conjecture for the discrete iteration problem. Given and , it is computationally hard to recover for general parameter values, input vectors, and sufficiently large . The problem is introduced as an analogue of the discrete logarithm problem, but the supplied text gives no formal computational model or evidence resolving its hardness.
Record
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.