ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let VV be the vector space with the second-order multilinear operation defined in the source, and let

∗ ⁣:V×V→V.*\colon V\times V\to V.

For a fixed vector a∈Va\in V and a positive integer nn, write

an:=a∗a∗⋯∗a⏟n times.a^n:=\underbrace{a*a*\dots*a}_{n\text{ times}}.

Hardness conjecture for the discrete iteration problem. Given aa and ana^n, it is computationally hard to recover nn for general parameter values, input vectors, and sufficiently large nn. 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 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.